./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/sum_non_eq-2.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-simple/sum_non_eq-2.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 3a2c06ffe4451efc19431b7b50aeafd7da4d885b78d7f0fdbbfb76228ce66142 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:17:41,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:17:41,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:17:41,176 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:17:41,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:17:41,181 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:17:41,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:17:41,184 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:17:41,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:17:41,188 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:17:41,188 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:17:41,190 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:17:41,190 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:17:41,195 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:17:41,196 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:17:41,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:17:41,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:17:41,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:17:41,200 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:17:41,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:17:41,207 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:17:41,208 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:17:41,209 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:17:41,210 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:17:41,211 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:17:41,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:17:41,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:17:41,215 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:17:41,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:17:41,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:17:41,217 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:17:41,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:17:41,218 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:17:41,219 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:17:41,220 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:17:41,220 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:17:41,221 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:17:41,221 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:17:41,221 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:17:41,222 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:17:41,222 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:17:41,223 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:17:41,242 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:17:41,242 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:17:41,243 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:17:41,243 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:17:41,244 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:17:41,244 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:17:41,244 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:17:41,245 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:17:41,245 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:17:41,245 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:17:41,246 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:17:41,246 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:17:41,246 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:17:41,246 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:17:41,246 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:17:41,246 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:17:41,246 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:17:41,247 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:17:41,247 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:17:41,247 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:17:41,247 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:17:41,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:17:41,247 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:17:41,248 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:17:41,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:17:41,248 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:17:41,248 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:17:41,248 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:17:41,248 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:17:41,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:17:41,249 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:17:41,249 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:17:41,249 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:17:41,249 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 -> 3a2c06ffe4451efc19431b7b50aeafd7da4d885b78d7f0fdbbfb76228ce66142 [2022-02-20 18:17:41,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:17:41,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:17:41,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:17:41,461 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:17:41,462 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:17:41,463 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/sum_non_eq-2.c [2022-02-20 18:17:41,520 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47908e82a/02e11101fbdc4277bb3f45290c2c652b/FLAGf472464c7 [2022-02-20 18:17:41,891 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:17:41,892 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_non_eq-2.c [2022-02-20 18:17:41,896 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47908e82a/02e11101fbdc4277bb3f45290c2c652b/FLAGf472464c7 [2022-02-20 18:17:41,905 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47908e82a/02e11101fbdc4277bb3f45290c2c652b [2022-02-20 18:17:41,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:17:41,908 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:17:41,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:17:41,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:17:41,912 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:17:41,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:17:41" (1/1) ... [2022-02-20 18:17:41,914 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22ba50da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:17:41, skipping insertion in model container [2022-02-20 18:17:41,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:17:41" (1/1) ... [2022-02-20 18:17:41,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:17:41,926 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:17:42,113 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-simple/sum_non_eq-2.c[628,641] [2022-02-20 18:17:42,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:17:42,132 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:17:42,144 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-simple/sum_non_eq-2.c[628,641] [2022-02-20 18:17:42,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:17:42,162 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:17:42,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:17:42 WrapperNode [2022-02-20 18:17:42,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:17:42,165 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:17:42,165 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:17:42,166 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:17:42,172 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:17:42" (1/1) ... [2022-02-20 18:17:42,177 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:17:42" (1/1) ... [2022-02-20 18:17:42,191 INFO L137 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-02-20 18:17:42,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:17:42,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:17:42,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:17:42,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:17:42,198 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:17:42" (1/1) ... [2022-02-20 18:17:42,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:17:42" (1/1) ... [2022-02-20 18:17:42,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:17:42" (1/1) ... [2022-02-20 18:17:42,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:17:42" (1/1) ... [2022-02-20 18:17:42,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:17:42" (1/1) ... [2022-02-20 18:17:42,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:17:42" (1/1) ... [2022-02-20 18:17:42,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:17:42" (1/1) ... [2022-02-20 18:17:42,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:17:42,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:17:42,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:17:42,214 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:17:42,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:17:42" (1/1) ... [2022-02-20 18:17:42,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:17:42,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:17:42,257 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:17:42,259 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:17:42,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:17:42,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:17:42,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:17:42,283 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2022-02-20 18:17:42,283 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2022-02-20 18:17:42,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:17:42,323 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:17:42,324 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:17:42,397 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:17:42,404 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:17:42,404 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:17:42,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:17:42 BoogieIcfgContainer [2022-02-20 18:17:42,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:17:42,408 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:17:42,408 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:17:42,411 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:17:42,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:17:41" (1/3) ... [2022-02-20 18:17:42,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fe259d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:17:42, skipping insertion in model container [2022-02-20 18:17:42,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:17:42" (2/3) ... [2022-02-20 18:17:42,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fe259d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:17:42, skipping insertion in model container [2022-02-20 18:17:42,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:17:42" (3/3) ... [2022-02-20 18:17:42,413 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_non_eq-2.c [2022-02-20 18:17:42,418 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:17:42,418 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:17:42,455 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:17:42,461 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:17:42,462 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:17:42,477 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 18:17:42,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 18:17:42,481 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:17:42,482 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:17:42,483 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:17:42,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:17:42,487 INFO L85 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2022-02-20 18:17:42,495 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:17:42,495 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80722112] [2022-02-20 18:17:42,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:17:42,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:17:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:17:42,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:17:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:17:42,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#true} ~n := #in~n;~m := #in~m; {27#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} is VALID [2022-02-20 18:17:42,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} assume 0 == ~n % 4294967296;#res := ~m; {28#(and (<= 0 (+ (* 4294967296 (div (* (- 1) |sum_#in~n|) 4294967296)) |sum_#in~n|)) (= |sum_#res| |sum_#in~m|))} is VALID [2022-02-20 18:17:42,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#(and (<= 0 (+ (* 4294967296 (div (* (- 1) |sum_#in~n|) 4294967296)) |sum_#in~n|)) (= |sum_#res| |sum_#in~m|))} assume true; {28#(and (<= 0 (+ (* 4294967296 (div (* (- 1) |sum_#in~n|) 4294967296)) |sum_#in~n|)) (= |sum_#res| |sum_#in~m|))} is VALID [2022-02-20 18:17:42,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#(and (<= 0 (+ (* 4294967296 (div (* (- 1) |sum_#in~n|) 4294967296)) |sum_#in~n|)) (= |sum_#res| |sum_#in~m|))} {19#true} #25#return; {25#(and (= |ULTIMATE.start_main_#t~ret7#1| |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~a~0#1| (* 4294967296 (div |ULTIMATE.start_main_~a~0#1| 4294967296))))} is VALID [2022-02-20 18:17:42,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#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); {19#true} is VALID [2022-02-20 18:17:42,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_~a~0#1, main_~b~0#1, main_~result~0#1;main_~a~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {19#true} is VALID [2022-02-20 18:17:42,991 INFO L272 TraceCheckUtils]: 2: Hoare triple {19#true} call main_#t~ret7#1 := sum(main_~a~0#1, main_~b~0#1); {19#true} is VALID [2022-02-20 18:17:42,992 INFO L290 TraceCheckUtils]: 3: Hoare triple {19#true} ~n := #in~n;~m := #in~m; {27#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} is VALID [2022-02-20 18:17:42,993 INFO L290 TraceCheckUtils]: 4: Hoare triple {27#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} assume 0 == ~n % 4294967296;#res := ~m; {28#(and (<= 0 (+ (* 4294967296 (div (* (- 1) |sum_#in~n|) 4294967296)) |sum_#in~n|)) (= |sum_#res| |sum_#in~m|))} is VALID [2022-02-20 18:17:42,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#(and (<= 0 (+ (* 4294967296 (div (* (- 1) |sum_#in~n|) 4294967296)) |sum_#in~n|)) (= |sum_#res| |sum_#in~m|))} assume true; {28#(and (<= 0 (+ (* 4294967296 (div (* (- 1) |sum_#in~n|) 4294967296)) |sum_#in~n|)) (= |sum_#res| |sum_#in~m|))} is VALID [2022-02-20 18:17:42,997 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {28#(and (<= 0 (+ (* 4294967296 (div (* (- 1) |sum_#in~n|) 4294967296)) |sum_#in~n|)) (= |sum_#res| |sum_#in~m|))} {19#true} #25#return; {25#(and (= |ULTIMATE.start_main_#t~ret7#1| |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~a~0#1| (* 4294967296 (div |ULTIMATE.start_main_~a~0#1| 4294967296))))} is VALID [2022-02-20 18:17:42,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#(and (= |ULTIMATE.start_main_#t~ret7#1| |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~a~0#1| (* 4294967296 (div |ULTIMATE.start_main_~a~0#1| 4294967296))))} main_~result~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {26#(and (< (+ (* (div (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|) 4294967296) 4294967296) |ULTIMATE.start_main_~result~0#1|) (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1| (* (div |ULTIMATE.start_main_~result~0#1| 4294967296) 4294967296) 1)) (= (+ (* (- 1) |ULTIMATE.start_main_~result~0#1|) |ULTIMATE.start_main_~b~0#1|) 0) (<= (+ |ULTIMATE.start_main_~a~0#1| (* (div |ULTIMATE.start_main_~result~0#1| 4294967296) 4294967296)) (* (div (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|) 4294967296) 4294967296)))} is VALID [2022-02-20 18:17:42,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#(and (< (+ (* (div (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|) 4294967296) 4294967296) |ULTIMATE.start_main_~result~0#1|) (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1| (* (div |ULTIMATE.start_main_~result~0#1| 4294967296) 4294967296) 1)) (= (+ (* (- 1) |ULTIMATE.start_main_~result~0#1|) |ULTIMATE.start_main_~b~0#1|) 0) (<= (+ |ULTIMATE.start_main_~a~0#1| (* (div |ULTIMATE.start_main_~result~0#1| 4294967296) 4294967296)) (* (div (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|) 4294967296) 4294967296)))} assume main_~result~0#1 % 4294967296 != (main_~a~0#1 + main_~b~0#1) % 4294967296; {20#false} is VALID [2022-02-20 18:17:43,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {20#false} assume !false; {20#false} is VALID [2022-02-20 18:17:43,001 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:17:43,002 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:17:43,002 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80722112] [2022-02-20 18:17:43,004 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80722112] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:17:43,005 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:17:43,005 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:17:43,008 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051534604] [2022-02-20 18:17:43,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:17:43,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) 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:17:43,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:17:43,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) 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:17:43,058 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:17:43,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:17:43,058 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:17:43,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:17:43,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:17:43,089 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 6 states have (on average 1.3333333333333333) 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:17:43,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:17:43,276 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-02-20 18:17:43,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:17:43,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) 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:17:43,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:17:43,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) 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:17:43,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-02-20 18:17:43,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) 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:17:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-02-20 18:17:43,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2022-02-20 18:17:43,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:17:43,322 INFO L225 Difference]: With dead ends: 28 [2022-02-20 18:17:43,322 INFO L226 Difference]: Without dead ends: 15 [2022-02-20 18:17:43,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:17:43,327 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 8 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:17:43,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 40 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:17:43,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-20 18:17:43,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-20 18:17:43,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:17:43,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 18:17:43,353 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 18:17:43,353 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 18:17:43,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:17:43,356 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-02-20 18:17:43,356 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-02-20 18:17:43,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:17:43,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:17:43,357 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 15 states. [2022-02-20 18:17:43,358 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 15 states. [2022-02-20 18:17:43,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:17:43,360 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-02-20 18:17:43,360 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-02-20 18:17:43,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:17:43,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:17:43,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:17:43,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:17:43,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 18:17:43,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-02-20 18:17:43,364 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2022-02-20 18:17:43,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:17:43,364 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-02-20 18:17:43,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) 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:17:43,364 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-02-20 18:17:43,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 18:17:43,365 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:17:43,365 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:17:43,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:17:43,366 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:17:43,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:17:43,367 INFO L85 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2022-02-20 18:17:43,367 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:17:43,367 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002728455] [2022-02-20 18:17:43,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:17:43,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:17:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:17:43,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:17:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:17:43,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:17:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:17:43,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {112#true} ~n := #in~n;~m := #in~m; {126#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} is VALID [2022-02-20 18:17:43,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {126#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} assume 0 == ~n % 4294967296;#res := ~m; {133#(and (= |sum_#res| |sum_#in~m|) (<= |sum_#in~n| (* (div |sum_#in~n| 4294967296) 4294967296)))} is VALID [2022-02-20 18:17:43,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {133#(and (= |sum_#res| |sum_#in~m|) (<= |sum_#in~n| (* (div |sum_#in~n| 4294967296) 4294967296)))} assume true; {133#(and (= |sum_#res| |sum_#in~m|) (<= |sum_#in~n| (* (div |sum_#in~n| 4294967296) 4294967296)))} is VALID [2022-02-20 18:17:43,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {133#(and (= |sum_#res| |sum_#in~m|) (<= |sum_#in~n| (* (div |sum_#in~n| 4294967296) 4294967296)))} {126#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} #27#return; {131#(<= |sum_#t~ret4| (+ (* (div (+ (* (- 1) |sum_#in~n|) (* (- 1) |sum_#in~m|) |sum_#t~ret4|) 4294967296) 4294967296) |sum_#in~n| |sum_#in~m|))} is VALID [2022-02-20 18:17:43,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {112#true} ~n := #in~n;~m := #in~m; {126#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} is VALID [2022-02-20 18:17:43,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {126#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} assume !(0 == ~n % 4294967296); {126#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} is VALID [2022-02-20 18:17:43,590 INFO L272 TraceCheckUtils]: 2: Hoare triple {126#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} call #t~ret4 := sum(~n - 1, 1 + ~m); {112#true} is VALID [2022-02-20 18:17:43,591 INFO L290 TraceCheckUtils]: 3: Hoare triple {112#true} ~n := #in~n;~m := #in~m; {126#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} is VALID [2022-02-20 18:17:43,591 INFO L290 TraceCheckUtils]: 4: Hoare triple {126#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} assume 0 == ~n % 4294967296;#res := ~m; {133#(and (= |sum_#res| |sum_#in~m|) (<= |sum_#in~n| (* (div |sum_#in~n| 4294967296) 4294967296)))} is VALID [2022-02-20 18:17:43,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {133#(and (= |sum_#res| |sum_#in~m|) (<= |sum_#in~n| (* (div |sum_#in~n| 4294967296) 4294967296)))} assume true; {133#(and (= |sum_#res| |sum_#in~m|) (<= |sum_#in~n| (* (div |sum_#in~n| 4294967296) 4294967296)))} is VALID [2022-02-20 18:17:43,594 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {133#(and (= |sum_#res| |sum_#in~m|) (<= |sum_#in~n| (* (div |sum_#in~n| 4294967296) 4294967296)))} {126#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} #27#return; {131#(<= |sum_#t~ret4| (+ (* (div (+ (* (- 1) |sum_#in~n|) (* (- 1) |sum_#in~m|) |sum_#t~ret4|) 4294967296) 4294967296) |sum_#in~n| |sum_#in~m|))} is VALID [2022-02-20 18:17:43,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {131#(<= |sum_#t~ret4| (+ (* (div (+ (* (- 1) |sum_#in~n|) (* (- 1) |sum_#in~m|) |sum_#t~ret4|) 4294967296) 4294967296) |sum_#in~n| |sum_#in~m|))} #res := #t~ret4;havoc #t~ret4; {132#(<= |sum_#res| (+ (* (div (+ (* (- 1) |sum_#in~n|) |sum_#res| (* (- 1) |sum_#in~m|)) 4294967296) 4294967296) |sum_#in~n| |sum_#in~m|))} is VALID [2022-02-20 18:17:43,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {132#(<= |sum_#res| (+ (* (div (+ (* (- 1) |sum_#in~n|) |sum_#res| (* (- 1) |sum_#in~m|)) 4294967296) 4294967296) |sum_#in~n| |sum_#in~m|))} assume true; {132#(<= |sum_#res| (+ (* (div (+ (* (- 1) |sum_#in~n|) |sum_#res| (* (- 1) |sum_#in~m|)) 4294967296) 4294967296) |sum_#in~n| |sum_#in~m|))} is VALID [2022-02-20 18:17:43,597 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {132#(<= |sum_#res| (+ (* (div (+ (* (- 1) |sum_#in~n|) |sum_#res| (* (- 1) |sum_#in~m|)) 4294967296) 4294967296) |sum_#in~n| |sum_#in~m|))} {112#true} #25#return; {124#(<= (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|) (+ |ULTIMATE.start_main_#t~ret7#1| (* (div (+ (* (- 1) |ULTIMATE.start_main_#t~ret7#1|) |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|) 4294967296) 4294967296)))} is VALID [2022-02-20 18:17:43,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {112#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); {112#true} is VALID [2022-02-20 18:17:43,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {112#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_~a~0#1, main_~b~0#1, main_~result~0#1;main_~a~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {112#true} is VALID [2022-02-20 18:17:43,598 INFO L272 TraceCheckUtils]: 2: Hoare triple {112#true} call main_#t~ret7#1 := sum(main_~a~0#1, main_~b~0#1); {112#true} is VALID [2022-02-20 18:17:43,598 INFO L290 TraceCheckUtils]: 3: Hoare triple {112#true} ~n := #in~n;~m := #in~m; {126#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} is VALID [2022-02-20 18:17:43,599 INFO L290 TraceCheckUtils]: 4: Hoare triple {126#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} assume !(0 == ~n % 4294967296); {126#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} is VALID [2022-02-20 18:17:43,599 INFO L272 TraceCheckUtils]: 5: Hoare triple {126#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} call #t~ret4 := sum(~n - 1, 1 + ~m); {112#true} is VALID [2022-02-20 18:17:43,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {112#true} ~n := #in~n;~m := #in~m; {126#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} is VALID [2022-02-20 18:17:43,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {126#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} assume 0 == ~n % 4294967296;#res := ~m; {133#(and (= |sum_#res| |sum_#in~m|) (<= |sum_#in~n| (* (div |sum_#in~n| 4294967296) 4294967296)))} is VALID [2022-02-20 18:17:43,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {133#(and (= |sum_#res| |sum_#in~m|) (<= |sum_#in~n| (* (div |sum_#in~n| 4294967296) 4294967296)))} assume true; {133#(and (= |sum_#res| |sum_#in~m|) (<= |sum_#in~n| (* (div |sum_#in~n| 4294967296) 4294967296)))} is VALID [2022-02-20 18:17:43,603 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {133#(and (= |sum_#res| |sum_#in~m|) (<= |sum_#in~n| (* (div |sum_#in~n| 4294967296) 4294967296)))} {126#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} #27#return; {131#(<= |sum_#t~ret4| (+ (* (div (+ (* (- 1) |sum_#in~n|) (* (- 1) |sum_#in~m|) |sum_#t~ret4|) 4294967296) 4294967296) |sum_#in~n| |sum_#in~m|))} is VALID [2022-02-20 18:17:43,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {131#(<= |sum_#t~ret4| (+ (* (div (+ (* (- 1) |sum_#in~n|) (* (- 1) |sum_#in~m|) |sum_#t~ret4|) 4294967296) 4294967296) |sum_#in~n| |sum_#in~m|))} #res := #t~ret4;havoc #t~ret4; {132#(<= |sum_#res| (+ (* (div (+ (* (- 1) |sum_#in~n|) |sum_#res| (* (- 1) |sum_#in~m|)) 4294967296) 4294967296) |sum_#in~n| |sum_#in~m|))} is VALID [2022-02-20 18:17:43,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {132#(<= |sum_#res| (+ (* (div (+ (* (- 1) |sum_#in~n|) |sum_#res| (* (- 1) |sum_#in~m|)) 4294967296) 4294967296) |sum_#in~n| |sum_#in~m|))} assume true; {132#(<= |sum_#res| (+ (* (div (+ (* (- 1) |sum_#in~n|) |sum_#res| (* (- 1) |sum_#in~m|)) 4294967296) 4294967296) |sum_#in~n| |sum_#in~m|))} is VALID [2022-02-20 18:17:43,606 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {132#(<= |sum_#res| (+ (* (div (+ (* (- 1) |sum_#in~n|) |sum_#res| (* (- 1) |sum_#in~m|)) 4294967296) 4294967296) |sum_#in~n| |sum_#in~m|))} {112#true} #25#return; {124#(<= (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|) (+ |ULTIMATE.start_main_#t~ret7#1| (* (div (+ (* (- 1) |ULTIMATE.start_main_#t~ret7#1|) |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|) 4294967296) 4294967296)))} is VALID [2022-02-20 18:17:43,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {124#(<= (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|) (+ |ULTIMATE.start_main_#t~ret7#1| (* (div (+ (* (- 1) |ULTIMATE.start_main_#t~ret7#1|) |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|) 4294967296) 4294967296)))} main_~result~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {125#(and (< (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1| (* (div |ULTIMATE.start_main_~result~0#1| 4294967296) 4294967296)) (+ (* (div (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|) 4294967296) 4294967296) |ULTIMATE.start_main_~result~0#1| 1)) (<= (+ (* (div (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|) 4294967296) 4294967296) |ULTIMATE.start_main_~result~0#1|) (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1| (* (div |ULTIMATE.start_main_~result~0#1| 4294967296) 4294967296))))} is VALID [2022-02-20 18:17:43,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {125#(and (< (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1| (* (div |ULTIMATE.start_main_~result~0#1| 4294967296) 4294967296)) (+ (* (div (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|) 4294967296) 4294967296) |ULTIMATE.start_main_~result~0#1| 1)) (<= (+ (* (div (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|) 4294967296) 4294967296) |ULTIMATE.start_main_~result~0#1|) (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1| (* (div |ULTIMATE.start_main_~result~0#1| 4294967296) 4294967296))))} assume main_~result~0#1 % 4294967296 != (main_~a~0#1 + main_~b~0#1) % 4294967296; {113#false} is VALID [2022-02-20 18:17:43,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {113#false} assume !false; {113#false} is VALID [2022-02-20 18:17:43,610 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:17:43,610 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:17:43,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002728455] [2022-02-20 18:17:43,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002728455] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:17:43,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379292869] [2022-02-20 18:17:43,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:17:43,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:17:43,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:17:43,613 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:17:43,614 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:17:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:17:43,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-20 18:17:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:17:43,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:17:44,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {112#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); {112#true} is VALID [2022-02-20 18:17:44,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {112#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_~a~0#1, main_~b~0#1, main_~result~0#1;main_~a~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {112#true} is VALID [2022-02-20 18:17:44,719 INFO L272 TraceCheckUtils]: 2: Hoare triple {112#true} call main_#t~ret7#1 := sum(main_~a~0#1, main_~b~0#1); {112#true} is VALID [2022-02-20 18:17:44,720 INFO L290 TraceCheckUtils]: 3: Hoare triple {112#true} ~n := #in~n;~m := #in~m; {126#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} is VALID [2022-02-20 18:17:44,720 INFO L290 TraceCheckUtils]: 4: Hoare triple {126#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} assume !(0 == ~n % 4294967296); {126#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} is VALID [2022-02-20 18:17:44,720 INFO L272 TraceCheckUtils]: 5: Hoare triple {126#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} call #t~ret4 := sum(~n - 1, 1 + ~m); {112#true} is VALID [2022-02-20 18:17:44,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {112#true} ~n := #in~n;~m := #in~m; {126#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} is VALID [2022-02-20 18:17:44,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {126#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} assume 0 == ~n % 4294967296;#res := ~m; {133#(and (= |sum_#res| |sum_#in~m|) (<= |sum_#in~n| (* (div |sum_#in~n| 4294967296) 4294967296)))} is VALID [2022-02-20 18:17:44,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {133#(and (= |sum_#res| |sum_#in~m|) (<= |sum_#in~n| (* (div |sum_#in~n| 4294967296) 4294967296)))} assume true; {133#(and (= |sum_#res| |sum_#in~m|) (<= |sum_#in~n| (* (div |sum_#in~n| 4294967296) 4294967296)))} is VALID [2022-02-20 18:17:44,724 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {133#(and (= |sum_#res| |sum_#in~m|) (<= |sum_#in~n| (* (div |sum_#in~n| 4294967296) 4294967296)))} {126#(and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|))} #27#return; {164#(and (= |sum_#t~ret4| (+ |sum_#in~m| 1)) (<= |sum_#in~n| (+ (* (div (+ (- 1) |sum_#in~n|) 4294967296) 4294967296) 1)))} is VALID [2022-02-20 18:17:44,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {164#(and (= |sum_#t~ret4| (+ |sum_#in~m| 1)) (<= |sum_#in~n| (+ (* (div (+ (- 1) |sum_#in~n|) 4294967296) 4294967296) 1)))} #res := #t~ret4;havoc #t~ret4; {168#(and (= |sum_#res| (+ |sum_#in~m| 1)) (<= |sum_#in~n| (+ (* (div (+ (- 1) |sum_#in~n|) 4294967296) 4294967296) 1)))} is VALID [2022-02-20 18:17:44,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {168#(and (= |sum_#res| (+ |sum_#in~m| 1)) (<= |sum_#in~n| (+ (* (div (+ (- 1) |sum_#in~n|) 4294967296) 4294967296) 1)))} assume true; {168#(and (= |sum_#res| (+ |sum_#in~m| 1)) (<= |sum_#in~n| (+ (* (div (+ (- 1) |sum_#in~n|) 4294967296) 4294967296) 1)))} is VALID [2022-02-20 18:17:44,726 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {168#(and (= |sum_#res| (+ |sum_#in~m| 1)) (<= |sum_#in~n| (+ (* (div (+ (- 1) |sum_#in~n|) 4294967296) 4294967296) 1)))} {112#true} #25#return; {175#(and (<= |ULTIMATE.start_main_~a~0#1| (+ (* (div (+ (- 1) |ULTIMATE.start_main_~a~0#1|) 4294967296) 4294967296) 1)) (= |ULTIMATE.start_main_#t~ret7#1| (+ |ULTIMATE.start_main_~b~0#1| 1)))} is VALID [2022-02-20 18:17:44,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {175#(and (<= |ULTIMATE.start_main_~a~0#1| (+ (* (div (+ (- 1) |ULTIMATE.start_main_~a~0#1|) 4294967296) 4294967296) 1)) (= |ULTIMATE.start_main_#t~ret7#1| (+ |ULTIMATE.start_main_~b~0#1| 1)))} main_~result~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {179#(and (<= |ULTIMATE.start_main_~a~0#1| (+ (* (div (+ (- 1) |ULTIMATE.start_main_~a~0#1|) 4294967296) 4294967296) 1)) (= |ULTIMATE.start_main_~result~0#1| (+ |ULTIMATE.start_main_~b~0#1| 1)))} is VALID [2022-02-20 18:17:44,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {179#(and (<= |ULTIMATE.start_main_~a~0#1| (+ (* (div (+ (- 1) |ULTIMATE.start_main_~a~0#1|) 4294967296) 4294967296) 1)) (= |ULTIMATE.start_main_~result~0#1| (+ |ULTIMATE.start_main_~b~0#1| 1)))} assume main_~result~0#1 % 4294967296 != (main_~a~0#1 + main_~b~0#1) % 4294967296; {113#false} is VALID [2022-02-20 18:17:44,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {113#false} assume !false; {113#false} is VALID [2022-02-20 18:17:44,729 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:17:44,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:17:45,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {113#false} assume !false; {113#false} is VALID [2022-02-20 18:17:45,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {125#(and (< (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1| (* (div |ULTIMATE.start_main_~result~0#1| 4294967296) 4294967296)) (+ (* (div (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|) 4294967296) 4294967296) |ULTIMATE.start_main_~result~0#1| 1)) (<= (+ (* (div (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|) 4294967296) 4294967296) |ULTIMATE.start_main_~result~0#1|) (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1| (* (div |ULTIMATE.start_main_~result~0#1| 4294967296) 4294967296))))} assume main_~result~0#1 % 4294967296 != (main_~a~0#1 + main_~b~0#1) % 4294967296; {113#false} is VALID [2022-02-20 18:17:45,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {124#(<= (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|) (+ |ULTIMATE.start_main_#t~ret7#1| (* (div (+ (* (- 1) |ULTIMATE.start_main_#t~ret7#1|) |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|) 4294967296) 4294967296)))} main_~result~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {125#(and (< (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1| (* (div |ULTIMATE.start_main_~result~0#1| 4294967296) 4294967296)) (+ (* (div (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|) 4294967296) 4294967296) |ULTIMATE.start_main_~result~0#1| 1)) (<= (+ (* (div (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|) 4294967296) 4294967296) |ULTIMATE.start_main_~result~0#1|) (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1| (* (div |ULTIMATE.start_main_~result~0#1| 4294967296) 4294967296))))} is VALID [2022-02-20 18:17:45,652 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {132#(<= |sum_#res| (+ (* (div (+ (* (- 1) |sum_#in~n|) |sum_#res| (* (- 1) |sum_#in~m|)) 4294967296) 4294967296) |sum_#in~n| |sum_#in~m|))} {112#true} #25#return; {124#(<= (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|) (+ |ULTIMATE.start_main_#t~ret7#1| (* (div (+ (* (- 1) |ULTIMATE.start_main_#t~ret7#1|) |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|) 4294967296) 4294967296)))} is VALID [2022-02-20 18:17:45,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {132#(<= |sum_#res| (+ (* (div (+ (* (- 1) |sum_#in~n|) |sum_#res| (* (- 1) |sum_#in~m|)) 4294967296) 4294967296) |sum_#in~n| |sum_#in~m|))} assume true; {132#(<= |sum_#res| (+ (* (div (+ (* (- 1) |sum_#in~n|) |sum_#res| (* (- 1) |sum_#in~m|)) 4294967296) 4294967296) |sum_#in~n| |sum_#in~m|))} is VALID [2022-02-20 18:17:45,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {131#(<= |sum_#t~ret4| (+ (* (div (+ (* (- 1) |sum_#in~n|) (* (- 1) |sum_#in~m|) |sum_#t~ret4|) 4294967296) 4294967296) |sum_#in~n| |sum_#in~m|))} #res := #t~ret4;havoc #t~ret4; {132#(<= |sum_#res| (+ (* (div (+ (* (- 1) |sum_#in~n|) |sum_#res| (* (- 1) |sum_#in~m|)) 4294967296) 4294967296) |sum_#in~n| |sum_#in~m|))} is VALID [2022-02-20 18:17:45,656 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {211#(and (<= (div (+ |sum_#res| (* (- 1) |sum_#in~m|) (- 4294967296)) (- 4294967296)) (+ (div (+ |sum_#in~m| (* (- 1) |sum_#res|)) 4294967296) 1)) (<= (mod |sum_#in~n| 4294967296) 0))} {207#(or (<= (+ sum_~m 1) (+ |sum_#in~n| |sum_#in~m| (* (div (+ (* (- 1) |sum_#in~n|) (* (- 1) |sum_#in~m|) sum_~m 1) 4294967296) 4294967296))) (not (<= (mod (+ sum_~n 4294967295) 4294967296) 0)))} #27#return; {131#(<= |sum_#t~ret4| (+ (* (div (+ (* (- 1) |sum_#in~n|) (* (- 1) |sum_#in~m|) |sum_#t~ret4|) 4294967296) 4294967296) |sum_#in~n| |sum_#in~m|))} is VALID [2022-02-20 18:17:45,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {211#(and (<= (div (+ |sum_#res| (* (- 1) |sum_#in~m|) (- 4294967296)) (- 4294967296)) (+ (div (+ |sum_#in~m| (* (- 1) |sum_#res|)) 4294967296) 1)) (<= (mod |sum_#in~n| 4294967296) 0))} assume true; {211#(and (<= (div (+ |sum_#res| (* (- 1) |sum_#in~m|) (- 4294967296)) (- 4294967296)) (+ (div (+ |sum_#in~m| (* (- 1) |sum_#res|)) 4294967296) 1)) (<= (mod |sum_#in~n| 4294967296) 0))} is VALID [2022-02-20 18:17:45,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {218#(or (and (<= (mod |sum_#in~n| 4294967296) 0) (<= (div (+ (* (- 1) |sum_#in~m|) sum_~m (- 4294967296)) (- 4294967296)) (+ (div (+ (* (- 1) sum_~m) |sum_#in~m|) 4294967296) 1))) (not (<= (mod sum_~n 4294967296) 0)))} assume 0 == ~n % 4294967296;#res := ~m; {211#(and (<= (div (+ |sum_#res| (* (- 1) |sum_#in~m|) (- 4294967296)) (- 4294967296)) (+ (div (+ |sum_#in~m| (* (- 1) |sum_#res|)) 4294967296) 1)) (<= (mod |sum_#in~n| 4294967296) 0))} is VALID [2022-02-20 18:17:45,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {112#true} ~n := #in~n;~m := #in~m; {218#(or (and (<= (mod |sum_#in~n| 4294967296) 0) (<= (div (+ (* (- 1) |sum_#in~m|) sum_~m (- 4294967296)) (- 4294967296)) (+ (div (+ (* (- 1) sum_~m) |sum_#in~m|) 4294967296) 1))) (not (<= (mod sum_~n 4294967296) 0)))} is VALID [2022-02-20 18:17:45,659 INFO L272 TraceCheckUtils]: 5: Hoare triple {207#(or (<= (+ sum_~m 1) (+ |sum_#in~n| |sum_#in~m| (* (div (+ (* (- 1) |sum_#in~n|) (* (- 1) |sum_#in~m|) sum_~m 1) 4294967296) 4294967296))) (not (<= (mod (+ sum_~n 4294967295) 4294967296) 0)))} call #t~ret4 := sum(~n - 1, 1 + ~m); {112#true} is VALID [2022-02-20 18:17:45,660 INFO L290 TraceCheckUtils]: 4: Hoare triple {207#(or (<= (+ sum_~m 1) (+ |sum_#in~n| |sum_#in~m| (* (div (+ (* (- 1) |sum_#in~n|) (* (- 1) |sum_#in~m|) sum_~m 1) 4294967296) 4294967296))) (not (<= (mod (+ sum_~n 4294967295) 4294967296) 0)))} assume !(0 == ~n % 4294967296); {207#(or (<= (+ sum_~m 1) (+ |sum_#in~n| |sum_#in~m| (* (div (+ (* (- 1) |sum_#in~n|) (* (- 1) |sum_#in~m|) sum_~m 1) 4294967296) 4294967296))) (not (<= (mod (+ sum_~n 4294967295) 4294967296) 0)))} is VALID [2022-02-20 18:17:45,661 INFO L290 TraceCheckUtils]: 3: Hoare triple {112#true} ~n := #in~n;~m := #in~m; {207#(or (<= (+ sum_~m 1) (+ |sum_#in~n| |sum_#in~m| (* (div (+ (* (- 1) |sum_#in~n|) (* (- 1) |sum_#in~m|) sum_~m 1) 4294967296) 4294967296))) (not (<= (mod (+ sum_~n 4294967295) 4294967296) 0)))} is VALID [2022-02-20 18:17:45,661 INFO L272 TraceCheckUtils]: 2: Hoare triple {112#true} call main_#t~ret7#1 := sum(main_~a~0#1, main_~b~0#1); {112#true} is VALID [2022-02-20 18:17:45,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {112#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_~a~0#1, main_~b~0#1, main_~result~0#1;main_~a~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {112#true} is VALID [2022-02-20 18:17:45,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {112#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); {112#true} is VALID [2022-02-20 18:17:45,662 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:17:45,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379292869] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:17:45,663 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:17:45,663 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 15 [2022-02-20 18:17:45,664 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908190086] [2022-02-20 18:17:45,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:17:45,665 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 11 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 16 [2022-02-20 18:17:45,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:17:45,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 11 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 18:17:45,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:17:45,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 18:17:45,701 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:17:45,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 18:17:45,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-02-20 18:17:45,702 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 11 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 18:17:45,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:17:45,972 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-02-20 18:17:45,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 18:17:45,972 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 11 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 16 [2022-02-20 18:17:45,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:17:45,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 11 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 18:17:45,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 22 transitions. [2022-02-20 18:17:45,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 11 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 18:17:45,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 22 transitions. [2022-02-20 18:17:45,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 22 transitions. [2022-02-20 18:17:46,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:17:46,003 INFO L225 Difference]: With dead ends: 20 [2022-02-20 18:17:46,003 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 18:17:46,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-02-20 18:17:46,005 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 13 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:17:46,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 34 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:17:46,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 18:17:46,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 18:17:46,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:17:46,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:17:46,007 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:17:46,007 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:17:46,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:17:46,007 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 18:17:46,007 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 18:17:46,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:17:46,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:17:46,008 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 18:17:46,008 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 18:17:46,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:17:46,008 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 18:17:46,008 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 18:17:46,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:17:46,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:17:46,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:17:46,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:17:46,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:17:46,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 18:17:46,010 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-02-20 18:17:46,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:17:46,010 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 18:17:46,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 11 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 18:17:46,011 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 18:17:46,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:17:46,013 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 18:17:46,040 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:17:46,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:17:46,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 18:17:46,243 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 18:17:46,244 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 18:17:46,244 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 18:17:46,244 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 18:17:46,244 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-02-20 18:17:46,244 INFO L858 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-02-20 18:17:46,244 INFO L858 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-02-20 18:17:46,245 INFO L861 garLoopResultBuilder]: At program point L17(line 17) the Hoare annotation is: true [2022-02-20 18:17:46,245 INFO L858 garLoopResultBuilder]: For program point L17-1(line 17) no Hoare annotation was computed. [2022-02-20 18:17:46,245 INFO L858 garLoopResultBuilder]: For program point L14(lines 14 21) no Hoare annotation was computed. [2022-02-20 18:17:46,245 INFO L858 garLoopResultBuilder]: For program point sumEXIT(lines 6 12) no Hoare annotation was computed. [2022-02-20 18:17:46,245 INFO L854 garLoopResultBuilder]: At program point L10(line 10) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|)) [2022-02-20 18:17:46,246 INFO L858 garLoopResultBuilder]: For program point L10-1(line 10) no Hoare annotation was computed. [2022-02-20 18:17:46,246 INFO L858 garLoopResultBuilder]: For program point L7(lines 7 11) no Hoare annotation was computed. [2022-02-20 18:17:46,246 INFO L858 garLoopResultBuilder]: For program point sumFINAL(lines 6 12) no Hoare annotation was computed. [2022-02-20 18:17:46,246 INFO L861 garLoopResultBuilder]: At program point sumENTRY(lines 6 12) the Hoare annotation is: true [2022-02-20 18:17:46,249 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 18:17:46,250 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 18:17:46,253 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 18:17:46,253 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-02-20 18:17:46,253 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 18:17:46,253 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-02-20 18:17:46,253 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-02-20 18:17:46,253 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2022-02-20 18:17:46,254 WARN L170 areAnnotationChecker]: sumFINAL has no Hoare annotation [2022-02-20 18:17:46,254 WARN L170 areAnnotationChecker]: L10-1 has no Hoare annotation [2022-02-20 18:17:46,254 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2022-02-20 18:17:46,254 WARN L170 areAnnotationChecker]: sumEXIT has no Hoare annotation [2022-02-20 18:17:46,254 WARN L170 areAnnotationChecker]: sumEXIT has no Hoare annotation [2022-02-20 18:17:46,254 WARN L170 areAnnotationChecker]: L10-1 has no Hoare annotation [2022-02-20 18:17:46,254 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 18:17:46,254 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 18:17:46,255 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-20 18:17:46,255 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-20 18:17:46,255 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-02-20 18:17:46,255 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 18:17:46,255 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 18:17:46,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 06:17:46 BoogieIcfgContainer [2022-02-20 18:17:46,256 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 18:17:46,257 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 18:17:46,257 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 18:17:46,257 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 18:17:46,257 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:17:42" (3/4) ... [2022-02-20 18:17:46,260 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 18:17:46,264 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sum [2022-02-20 18:17:46,267 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-02-20 18:17:46,267 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-02-20 18:17:46,267 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 18:17:46,267 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 18:17:46,289 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 18:17:46,289 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 18:17:46,290 INFO L158 Benchmark]: Toolchain (without parser) took 4382.47ms. Allocated memory was 100.7MB in the beginning and 174.1MB in the end (delta: 73.4MB). Free memory was 73.8MB in the beginning and 101.3MB in the end (delta: -27.5MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. [2022-02-20 18:17:46,291 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory was 60.3MB in the beginning and 60.2MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:17:46,291 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.82ms. Allocated memory was 100.7MB in the beginning and 174.1MB in the end (delta: 73.4MB). Free memory was 73.6MB in the beginning and 148.8MB in the end (delta: -75.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 18:17:46,292 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.39ms. Allocated memory is still 174.1MB. Free memory was 148.8MB in the beginning and 147.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:17:46,292 INFO L158 Benchmark]: Boogie Preprocessor took 20.00ms. Allocated memory is still 174.1MB. Free memory was 147.2MB in the beginning and 146.6MB in the end (delta: 669.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:17:46,292 INFO L158 Benchmark]: RCFGBuilder took 192.74ms. Allocated memory is still 174.1MB. Free memory was 146.3MB in the beginning and 137.3MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 18:17:46,293 INFO L158 Benchmark]: TraceAbstraction took 3848.34ms. Allocated memory is still 174.1MB. Free memory was 136.8MB in the beginning and 103.4MB in the end (delta: 33.4MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. [2022-02-20 18:17:46,293 INFO L158 Benchmark]: Witness Printer took 33.00ms. Allocated memory is still 174.1MB. Free memory was 103.4MB in the beginning and 101.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:17:46,295 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory was 60.3MB in the beginning and 60.2MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.82ms. Allocated memory was 100.7MB in the beginning and 174.1MB in the end (delta: 73.4MB). Free memory was 73.6MB in the beginning and 148.8MB in the end (delta: -75.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.39ms. Allocated memory is still 174.1MB. Free memory was 148.8MB in the beginning and 147.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.00ms. Allocated memory is still 174.1MB. Free memory was 147.2MB in the beginning and 146.6MB in the end (delta: 669.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 192.74ms. Allocated memory is still 174.1MB. Free memory was 146.3MB in the beginning and 137.3MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3848.34ms. Allocated memory is still 174.1MB. Free memory was 136.8MB in the beginning and 103.4MB in the end (delta: 33.4MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. * Witness Printer took 33.00ms. Allocated memory is still 174.1MB. Free memory was 103.4MB in the beginning and 101.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 100 IncrementalHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 18 mSDtfsCounter, 100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 5 PreInvPairs, 5 NumberOfFragments, 9 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 627 SizeOfPredicates, 8 NumberOfNonLiveVariables, 63 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 5/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 18:17:46,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE