./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursive-simple/sum_non_false-no-overflow.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_383bf8f9-b3da-4313-92d7-d698e8f4ccc5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_383bf8f9-b3da-4313-92d7-d698e8f4ccc5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_383bf8f9-b3da-4313-92d7-d698e8f4ccc5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_383bf8f9-b3da-4313-92d7-d698e8f4ccc5/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/sum_non_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_383bf8f9-b3da-4313-92d7-d698e8f4ccc5/bin-2019/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_383bf8f9-b3da-4313-92d7-d698e8f4ccc5/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d40444e4cd2a33c7365a8211a19737bb4f6f43ea ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 01:34:02,322 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:34:02,323 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:34:02,330 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:34:02,330 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:34:02,331 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:34:02,332 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:34:02,333 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:34:02,334 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:34:02,335 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:34:02,336 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:34:02,336 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:34:02,336 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:34:02,337 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:34:02,338 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:34:02,339 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:34:02,339 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:34:02,340 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:34:02,342 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:34:02,343 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:34:02,344 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:34:02,345 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:34:02,347 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:34:02,347 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:34:02,347 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:34:02,348 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:34:02,348 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:34:02,349 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:34:02,349 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:34:02,350 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:34:02,350 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:34:02,351 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:34:02,351 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:34:02,351 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:34:02,352 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:34:02,353 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:34:02,353 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_383bf8f9-b3da-4313-92d7-d698e8f4ccc5/bin-2019/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2018-11-23 01:34:02,361 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:34:02,361 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:34:02,361 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:34:02,361 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 01:34:02,362 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 01:34:02,362 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 01:34:02,362 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 01:34:02,362 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:34:02,362 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:34:02,362 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 01:34:02,362 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:34:02,362 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:34:02,362 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:34:02,363 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 01:34:02,363 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:34:02,363 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 01:34:02,363 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 01:34:02,363 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:34:02,363 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:34:02,363 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:34:02,364 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 01:34:02,364 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:34:02,364 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:34:02,364 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:34:02,364 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 01:34:02,364 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:34:02,364 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:34:02,365 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:34:02,365 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 01:34:02,365 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 01:34:02,365 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:34:02,365 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 01:34:02,365 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_383bf8f9-b3da-4313-92d7-d698e8f4ccc5/bin-2019/uautomizer 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 ! overflow) ) 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 -> d40444e4cd2a33c7365a8211a19737bb4f6f43ea [2018-11-23 01:34:02,389 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:34:02,398 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:34:02,400 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:34:02,401 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:34:02,402 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:34:02,402 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_383bf8f9-b3da-4313-92d7-d698e8f4ccc5/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/sum_non_false-no-overflow.c [2018-11-23 01:34:02,443 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_383bf8f9-b3da-4313-92d7-d698e8f4ccc5/bin-2019/uautomizer/data/7f825127f/9ed00f6307aa4ea18803aaaef06c1544/FLAGa89c2fa41 [2018-11-23 01:34:02,766 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:34:02,767 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_383bf8f9-b3da-4313-92d7-d698e8f4ccc5/sv-benchmarks/c/recursive-simple/sum_non_false-no-overflow.c [2018-11-23 01:34:02,770 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_383bf8f9-b3da-4313-92d7-d698e8f4ccc5/bin-2019/uautomizer/data/7f825127f/9ed00f6307aa4ea18803aaaef06c1544/FLAGa89c2fa41 [2018-11-23 01:34:02,780 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_383bf8f9-b3da-4313-92d7-d698e8f4ccc5/bin-2019/uautomizer/data/7f825127f/9ed00f6307aa4ea18803aaaef06c1544 [2018-11-23 01:34:02,783 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:34:02,784 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:34:02,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:34:02,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:34:02,787 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:34:02,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:34:02" (1/1) ... [2018-11-23 01:34:02,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@99c936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:02, skipping insertion in model container [2018-11-23 01:34:02,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:34:02" (1/1) ... [2018-11-23 01:34:02,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:34:02,807 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:34:02,916 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:34:02,918 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:34:02,928 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:34:02,937 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:34:02,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:02 WrapperNode [2018-11-23 01:34:02,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:34:02,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:34:02,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:34:02,938 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:34:02,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:02" (1/1) ... [2018-11-23 01:34:02,947 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:02" (1/1) ... [2018-11-23 01:34:02,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:34:02,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:34:02,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:34:02,951 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:34:02,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:02" (1/1) ... [2018-11-23 01:34:02,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:02" (1/1) ... [2018-11-23 01:34:02,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:02" (1/1) ... [2018-11-23 01:34:02,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:02" (1/1) ... [2018-11-23 01:34:02,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:02" (1/1) ... [2018-11-23 01:34:02,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:02" (1/1) ... [2018-11-23 01:34:02,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:02" (1/1) ... [2018-11-23 01:34:02,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:34:02,964 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:34:02,964 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:34:02,964 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:34:02,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_383bf8f9-b3da-4313-92d7-d698e8f4ccc5/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:34:03,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 01:34:03,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 01:34:03,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:34:03,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:34:03,044 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2018-11-23 01:34:03,044 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2018-11-23 01:34:03,044 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 01:34:03,044 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 01:34:03,157 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:34:03,157 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 01:34:03,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:34:03 BoogieIcfgContainer [2018-11-23 01:34:03,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:34:03,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 01:34:03,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 01:34:03,161 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 01:34:03,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:34:02" (1/3) ... [2018-11-23 01:34:03,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbc9ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:34:03, skipping insertion in model container [2018-11-23 01:34:03,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:02" (2/3) ... [2018-11-23 01:34:03,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbc9ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:34:03, skipping insertion in model container [2018-11-23 01:34:03,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:34:03" (3/3) ... [2018-11-23 01:34:03,164 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_non_false-no-overflow.c [2018-11-23 01:34:03,171 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 01:34:03,175 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-11-23 01:34:03,186 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-11-23 01:34:03,212 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 01:34:03,212 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 01:34:03,213 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 01:34:03,213 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 01:34:03,213 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:34:03,213 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:34:03,213 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 01:34:03,213 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:34:03,213 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 01:34:03,227 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-11-23 01:34:03,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 01:34:03,230 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:34:03,231 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:34:03,232 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 01:34:03,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:34:03,236 INFO L82 PathProgramCache]: Analyzing trace with hash -521339435, now seen corresponding path program 1 times [2018-11-23 01:34:03,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:34:03,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:34:03,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:03,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:34:03,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:34:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:34:03,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:34:03,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:34:03,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:34:03,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:34:03,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:34:03,377 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 6 states. [2018-11-23 01:34:03,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:34:03,530 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-11-23 01:34:03,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 01:34:03,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-11-23 01:34:03,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:34:03,538 INFO L225 Difference]: With dead ends: 61 [2018-11-23 01:34:03,538 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 01:34:03,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 01:34:03,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 01:34:03,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2018-11-23 01:34:03,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 01:34:03,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2018-11-23 01:34:03,569 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 9 [2018-11-23 01:34:03,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:34:03,569 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-11-23 01:34:03,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:34:03,570 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2018-11-23 01:34:03,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 01:34:03,570 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:34:03,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:34:03,571 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 01:34:03,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:34:03,571 INFO L82 PathProgramCache]: Analyzing trace with hash -521339275, now seen corresponding path program 1 times [2018-11-23 01:34:03,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:34:03,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:34:03,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:03,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:34:03,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:34:03,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:34:03,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:34:03,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 01:34:03,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:34:03,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:34:03,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:34:03,607 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 5 states. [2018-11-23 01:34:03,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:34:03,669 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-11-23 01:34:03,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 01:34:03,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-23 01:34:03,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:34:03,670 INFO L225 Difference]: With dead ends: 41 [2018-11-23 01:34:03,670 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 01:34:03,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:34:03,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 01:34:03,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 01:34:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 01:34:03,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-11-23 01:34:03,677 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 9 [2018-11-23 01:34:03,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:34:03,677 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-23 01:34:03,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:34:03,677 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-23 01:34:03,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 01:34:03,678 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:34:03,678 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:34:03,678 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 01:34:03,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:34:03,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1018346740, now seen corresponding path program 1 times [2018-11-23 01:34:03,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:34:03,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:34:03,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:03,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:34:03,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:34:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:34:03,711 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #41#return; [?] CALL call #t~ret4 := main(); [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~b~0 := #t~nondet2;havoc #t~nondet2; VAL [main_~a~0=(- 2147483648), main_~b~0=(- 1)] [?] CALL call #t~ret3 := sum(~a~0, ~b~0); VAL [|sum_#in~m|=(- 1), |sum_#in~n|=(- 2147483648)] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=(- 1), sum_~n=(- 2147483648), |sum_#in~m|=(- 1), |sum_#in~n|=(- 2147483648)] [?] assume ~n <= 0; VAL [sum_~m=(- 1), sum_~n=(- 2147483648), |sum_#in~m|=(- 1), |sum_#in~n|=(- 2147483648)] [?] assume ~m + ~n <= 2147483647; VAL [sum_~m=(- 1), sum_~n=(- 2147483648), |sum_#in~m|=(- 1), |sum_#in~n|=(- 2147483648)] [?] assume !(~m + ~n >= -2147483648); VAL [sum_~m=(- 1), sum_~n=(- 2147483648), |sum_#in~m|=(- 1), |sum_#in~n|=(- 2147483648)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~a~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L14] ~b~0 := #t~nondet2; [L14] havoc #t~nondet2; VAL [~a~0=-2147483648, ~b~0=-1] [L15] CALL call #t~ret3 := sum(~a~0, ~b~0); VAL [#in~m=-1, #in~n=-2147483648] [L4-L10] ~n := #in~n; [L4-L10] ~m := #in~m; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L5-L9] assume ~n <= 0; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L6] assert ~m + ~n <= 2147483647; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L6] assert ~m + ~n >= -2147483648; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~a~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L14] ~b~0 := #t~nondet2; [L14] havoc #t~nondet2; VAL [~a~0=-2147483648, ~b~0=-1] [L15] CALL call #t~ret3 := sum(~a~0, ~b~0); VAL [#in~m=-1, #in~n=-2147483648] [L4-L10] ~n := #in~n; [L4-L10] ~m := #in~m; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L5-L9] assume ~n <= 0; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L6] assert ~m + ~n <= 2147483647; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L6] assert ~m + ~n >= -2147483648; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~a~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L14] ~b~0 := #t~nondet2; [L14] havoc #t~nondet2; VAL [~a~0=-2147483648, ~b~0=-1] [L15] CALL call #t~ret3 := sum(~a~0, ~b~0); VAL [#in~m=-1, #in~n=-2147483648] [L4-L10] ~n := #in~n; [L4-L10] ~m := #in~m; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L5] COND TRUE ~n <= 0 VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L6] assert ~m + ~n <= 2147483647; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L6] assert ~m + ~n >= -2147483648; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~a~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L14] ~b~0 := #t~nondet2; [L14] havoc #t~nondet2; VAL [~a~0=-2147483648, ~b~0=-1] [L15] CALL call #t~ret3 := sum(~a~0, ~b~0); VAL [#in~m=-1, #in~n=-2147483648] [L4-L10] ~n := #in~n; [L4-L10] ~m := #in~m; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L5] COND TRUE ~n <= 0 VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L6] assert ~m + ~n <= 2147483647; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L6] assert ~m + ~n >= -2147483648; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~a~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L14] ~b~0 := #t~nondet2; [L14] havoc #t~nondet2; VAL [~a~0=-2147483648, ~b~0=-1] [L15] CALL call #t~ret3 := sum(~a~0, ~b~0); VAL [#in~m=-1, #in~n=-2147483648] [L4-L10] ~n := #in~n; [L4-L10] ~m := #in~m; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L5] COND TRUE ~n <= 0 VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L6] assert ~m + ~n <= 2147483647; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L6] assert ~m + ~n >= -2147483648; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~a~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L14] ~b~0 := #t~nondet2; [L14] havoc #t~nondet2; VAL [~a~0=-2147483648, ~b~0=-1] [L15] CALL call #t~ret3 := sum(~a~0, ~b~0); VAL [#in~m=-1, #in~n=-2147483648] [L4-L10] ~n := #in~n; [L4-L10] ~m := #in~m; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L5] COND TRUE ~n <= 0 VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L6] assert ~m + ~n <= 2147483647; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L6] assert ~m + ~n >= -2147483648; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L13] int a = __VERIFIER_nondet_int(); [L14] int b = __VERIFIER_nondet_int(); [L15] CALL sum(a, b) VAL [\old(m)=-1, \old(n)=-2147483648] [L5] COND TRUE n <= 0 VAL [\old(m)=-1, \old(n)=-2147483648, m=-1, n=-2147483648] [L6] m + n VAL [\old(m)=-1, \old(n)=-2147483648, m=-1, n=-2147483648] ----- [2018-11-23 01:34:03,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:34:03 BoogieIcfgContainer [2018-11-23 01:34:03,739 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 01:34:03,739 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:34:03,739 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:34:03,740 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:34:03,740 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:34:03" (3/4) ... [2018-11-23 01:34:03,742 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #41#return; [?] CALL call #t~ret4 := main(); [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~b~0 := #t~nondet2;havoc #t~nondet2; VAL [main_~a~0=(- 2147483648), main_~b~0=(- 1)] [?] CALL call #t~ret3 := sum(~a~0, ~b~0); VAL [|sum_#in~m|=(- 1), |sum_#in~n|=(- 2147483648)] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=(- 1), sum_~n=(- 2147483648), |sum_#in~m|=(- 1), |sum_#in~n|=(- 2147483648)] [?] assume ~n <= 0; VAL [sum_~m=(- 1), sum_~n=(- 2147483648), |sum_#in~m|=(- 1), |sum_#in~n|=(- 2147483648)] [?] assume ~m + ~n <= 2147483647; VAL [sum_~m=(- 1), sum_~n=(- 2147483648), |sum_#in~m|=(- 1), |sum_#in~n|=(- 2147483648)] [?] assume !(~m + ~n >= -2147483648); VAL [sum_~m=(- 1), sum_~n=(- 2147483648), |sum_#in~m|=(- 1), |sum_#in~n|=(- 2147483648)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~a~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L14] ~b~0 := #t~nondet2; [L14] havoc #t~nondet2; VAL [~a~0=-2147483648, ~b~0=-1] [L15] CALL call #t~ret3 := sum(~a~0, ~b~0); VAL [#in~m=-1, #in~n=-2147483648] [L4-L10] ~n := #in~n; [L4-L10] ~m := #in~m; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L5-L9] assume ~n <= 0; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L6] assert ~m + ~n <= 2147483647; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L6] assert ~m + ~n >= -2147483648; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~a~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L14] ~b~0 := #t~nondet2; [L14] havoc #t~nondet2; VAL [~a~0=-2147483648, ~b~0=-1] [L15] CALL call #t~ret3 := sum(~a~0, ~b~0); VAL [#in~m=-1, #in~n=-2147483648] [L4-L10] ~n := #in~n; [L4-L10] ~m := #in~m; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L5-L9] assume ~n <= 0; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L6] assert ~m + ~n <= 2147483647; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L6] assert ~m + ~n >= -2147483648; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~a~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L14] ~b~0 := #t~nondet2; [L14] havoc #t~nondet2; VAL [~a~0=-2147483648, ~b~0=-1] [L15] CALL call #t~ret3 := sum(~a~0, ~b~0); VAL [#in~m=-1, #in~n=-2147483648] [L4-L10] ~n := #in~n; [L4-L10] ~m := #in~m; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L5] COND TRUE ~n <= 0 VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L6] assert ~m + ~n <= 2147483647; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L6] assert ~m + ~n >= -2147483648; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~a~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L14] ~b~0 := #t~nondet2; [L14] havoc #t~nondet2; VAL [~a~0=-2147483648, ~b~0=-1] [L15] CALL call #t~ret3 := sum(~a~0, ~b~0); VAL [#in~m=-1, #in~n=-2147483648] [L4-L10] ~n := #in~n; [L4-L10] ~m := #in~m; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L5] COND TRUE ~n <= 0 VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L6] assert ~m + ~n <= 2147483647; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L6] assert ~m + ~n >= -2147483648; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~a~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L14] ~b~0 := #t~nondet2; [L14] havoc #t~nondet2; VAL [~a~0=-2147483648, ~b~0=-1] [L15] CALL call #t~ret3 := sum(~a~0, ~b~0); VAL [#in~m=-1, #in~n=-2147483648] [L4-L10] ~n := #in~n; [L4-L10] ~m := #in~m; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L5] COND TRUE ~n <= 0 VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L6] assert ~m + ~n <= 2147483647; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L6] assert ~m + ~n >= -2147483648; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~a~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L14] ~b~0 := #t~nondet2; [L14] havoc #t~nondet2; VAL [~a~0=-2147483648, ~b~0=-1] [L15] CALL call #t~ret3 := sum(~a~0, ~b~0); VAL [#in~m=-1, #in~n=-2147483648] [L4-L10] ~n := #in~n; [L4-L10] ~m := #in~m; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L5] COND TRUE ~n <= 0 VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L6] assert ~m + ~n <= 2147483647; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L6] assert ~m + ~n >= -2147483648; VAL [#in~m=-1, #in~n=-2147483648, ~m=-1, ~n=-2147483648] [L13] int a = __VERIFIER_nondet_int(); [L14] int b = __VERIFIER_nondet_int(); [L15] CALL sum(a, b) VAL [\old(m)=-1, \old(n)=-2147483648] [L5] COND TRUE n <= 0 VAL [\old(m)=-1, \old(n)=-2147483648, m=-1, n=-2147483648] [L6] m + n VAL [\old(m)=-1, \old(n)=-2147483648, m=-1, n=-2147483648] ----- [2018-11-23 01:34:03,769 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_383bf8f9-b3da-4313-92d7-d698e8f4ccc5/bin-2019/uautomizer/witness.graphml [2018-11-23 01:34:03,770 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:34:03,770 INFO L168 Benchmark]: Toolchain (without parser) took 986.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 959.3 MB in the beginning and 1.1 GB in the end (delta: -93.2 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:34:03,771 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:34:03,772 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.69 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:34:03,772 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.35 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:34:03,772 INFO L168 Benchmark]: Boogie Preprocessor took 12.58 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:34:03,772 INFO L168 Benchmark]: RCFGBuilder took 193.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 01:34:03,773 INFO L168 Benchmark]: TraceAbstraction took 580.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. [2018-11-23 01:34:03,773 INFO L168 Benchmark]: Witness Printer took 30.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:34:03,776 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 152.69 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.35 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.58 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 193.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 580.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. * Witness Printer took 30.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: integer overflow possible integer overflow possible We found a FailurePath: [L13] int a = __VERIFIER_nondet_int(); [L14] int b = __VERIFIER_nondet_int(); [L15] CALL sum(a, b) VAL [\old(m)=-1, \old(n)=-2147483648] [L5] COND TRUE n <= 0 VAL [\old(m)=-1, \old(n)=-2147483648, m=-1, n=-2147483648] [L6] m + n VAL [\old(m)=-1, \old(n)=-2147483648, m=-1, n=-2147483648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 35 locations, 8 error locations. UNSAFE Result, 0.5s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 38 SDtfs, 86 SDslu, 97 SDs, 0 SdLazy, 111 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 272 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...