./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/signedintegeroverflow-regression/AdditionIntMin_false-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7e2267ab-e659-4cf8-90f8-839996d92707/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7e2267ab-e659-4cf8-90f8-839996d92707/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7e2267ab-e659-4cf8-90f8-839996d92707/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7e2267ab-e659-4cf8-90f8-839996d92707/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/signedintegeroverflow-regression/AdditionIntMin_false-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7e2267ab-e659-4cf8-90f8-839996d92707/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7e2267ab-e659-4cf8-90f8-839996d92707/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8586441a08b46391c3ae26469a94ac820a4b60b0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:56:26,796 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:56:26,796 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:56:26,804 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:56:26,804 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:56:26,805 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:56:26,805 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:56:26,806 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:56:26,807 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:56:26,808 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:56:26,809 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:56:26,809 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:56:26,810 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:56:26,811 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:56:26,812 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:56:26,812 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:56:26,813 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:56:26,814 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:56:26,816 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:56:26,817 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:56:26,818 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:56:26,819 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:56:26,820 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:56:26,821 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:56:26,821 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:56:26,821 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:56:26,822 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:56:26,822 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:56:26,823 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:56:26,824 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:56:26,824 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:56:26,825 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:56:26,825 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:56:26,825 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:56:26,826 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:56:26,826 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:56:26,826 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7e2267ab-e659-4cf8-90f8-839996d92707/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-11-23 01:56:26,836 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:56:26,836 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:56:26,836 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:56:26,836 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 01:56:26,837 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 01:56:26,837 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 01:56:26,837 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 01:56:26,837 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 01:56:26,837 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 01:56:26,837 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 01:56:26,837 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 01:56:26,838 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 01:56:26,838 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 01:56:26,838 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:56:26,838 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 01:56:26,839 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:56:26,839 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:56:26,839 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 01:56:26,839 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:56:26,839 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 01:56:26,839 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 01:56:26,839 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:56:26,840 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:56:26,840 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 01:56:26,840 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:56:26,840 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:56:26,840 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:56:26,840 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 01:56:26,841 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:56:26,841 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:56:26,841 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:56:26,841 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 01:56:26,841 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 01:56:26,841 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:56:26,841 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 01:56:26,841 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 01:56:26,842 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_7e2267ab-e659-4cf8-90f8-839996d92707/bin-2019/utaipan 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8586441a08b46391c3ae26469a94ac820a4b60b0 [2018-11-23 01:56:26,864 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:56:26,872 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:56:26,873 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:56:26,874 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:56:26,875 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:56:26,875 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7e2267ab-e659-4cf8-90f8-839996d92707/bin-2019/utaipan/../../sv-benchmarks/c/signedintegeroverflow-regression/AdditionIntMin_false-no-overflow.c.i [2018-11-23 01:56:26,910 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7e2267ab-e659-4cf8-90f8-839996d92707/bin-2019/utaipan/data/5d9f87742/5d8da7358bf247398252213062c0b217/FLAGa369563f8 [2018-11-23 01:56:27,223 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:56:27,223 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7e2267ab-e659-4cf8-90f8-839996d92707/sv-benchmarks/c/signedintegeroverflow-regression/AdditionIntMin_false-no-overflow.c.i [2018-11-23 01:56:27,229 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7e2267ab-e659-4cf8-90f8-839996d92707/bin-2019/utaipan/data/5d9f87742/5d8da7358bf247398252213062c0b217/FLAGa369563f8 [2018-11-23 01:56:27,240 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7e2267ab-e659-4cf8-90f8-839996d92707/bin-2019/utaipan/data/5d9f87742/5d8da7358bf247398252213062c0b217 [2018-11-23 01:56:27,242 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:56:27,242 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:56:27,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:56:27,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:56:27,245 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:56:27,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:56:27" (1/1) ... [2018-11-23 01:56:27,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@725d32ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:27, skipping insertion in model container [2018-11-23 01:56:27,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:56:27" (1/1) ... [2018-11-23 01:56:27,253 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:56:27,276 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:56:27,435 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:56:27,441 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:56:27,505 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:56:27,528 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:56:27,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:27 WrapperNode [2018-11-23 01:56:27,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:56:27,529 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:56:27,529 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:56:27,529 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:56:27,535 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:56:27" (1/1) ... [2018-11-23 01:56:27,543 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:56:27" (1/1) ... [2018-11-23 01:56:27,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:56:27,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:56:27,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:56:27,549 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:56:27,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:27" (1/1) ... [2018-11-23 01:56:27,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:27" (1/1) ... [2018-11-23 01:56:27,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:27" (1/1) ... [2018-11-23 01:56:27,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:27" (1/1) ... [2018-11-23 01:56:27,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:27" (1/1) ... [2018-11-23 01:56:27,559 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:27" (1/1) ... [2018-11-23 01:56:27,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:27" (1/1) ... [2018-11-23 01:56:27,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:56:27,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:56:27,561 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:56:27,561 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:56:27,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e2267ab-e659-4cf8-90f8-839996d92707/bin-2019/utaipan/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:56:27,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:56:27,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 01:56:27,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 01:56:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 01:56:27,610 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 01:56:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 01:56:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:56:27,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:56:27,805 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:56:27,805 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 01:56:27,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:56:27 BoogieIcfgContainer [2018-11-23 01:56:27,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:56:27,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 01:56:27,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 01:56:27,809 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 01:56:27,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:56:27" (1/3) ... [2018-11-23 01:56:27,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd896ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:56:27, skipping insertion in model container [2018-11-23 01:56:27,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:27" (2/3) ... [2018-11-23 01:56:27,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd896ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:56:27, skipping insertion in model container [2018-11-23 01:56:27,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:56:27" (3/3) ... [2018-11-23 01:56:27,811 INFO L112 eAbstractionObserver]: Analyzing ICFG AdditionIntMin_false-no-overflow.c.i [2018-11-23 01:56:27,820 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 01:56:27,826 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-23 01:56:27,840 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-23 01:56:27,865 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 01:56:27,866 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 01:56:27,866 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 01:56:27,866 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:56:27,866 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:56:27,866 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 01:56:27,866 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:56:27,866 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 01:56:27,880 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-23 01:56:27,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 01:56:27,885 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:56:27,885 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:56:27,887 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 01:56:27,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:56:27,892 INFO L82 PathProgramCache]: Analyzing trace with hash -2123086959, now seen corresponding path program 1 times [2018-11-23 01:56:27,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:56:27,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:56:27,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:56:27,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:56:27,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:56:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:56:28,013 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:56:28,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:56:28,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:56:28,015 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:56:28,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:56:28,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:56:28,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:56:28,027 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-11-23 01:56:28,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:56:28,049 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2018-11-23 01:56:28,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:56:28,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 01:56:28,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:56:28,056 INFO L225 Difference]: With dead ends: 18 [2018-11-23 01:56:28,056 INFO L226 Difference]: Without dead ends: 9 [2018-11-23 01:56:28,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:56:28,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-11-23 01:56:28,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-11-23 01:56:28,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 01:56:28,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 8 transitions. [2018-11-23 01:56:28,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 8 transitions. Word has length 7 [2018-11-23 01:56:28,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:56:28,081 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 8 transitions. [2018-11-23 01:56:28,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:56:28,081 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions. [2018-11-23 01:56:28,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 01:56:28,082 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:56:28,082 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:56:28,082 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 01:56:28,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:56:28,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1391186250, now seen corresponding path program 1 times [2018-11-23 01:56:28,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:56:28,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:56:28,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:56:28,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:56:28,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:56:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:56:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:56:28,118 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=104, |#NULL.offset|=101, |#t~string29.base|=103, |#t~string29.offset|=102, |old(#NULL.base)|=104, |old(#NULL.offset)|=101, |old(#t~string29.base)|=103, |old(#t~string29.offset)|=102] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string29.base, #t~string29.offset := #Ultimate.alloc(4);call write~init~int(37, #t~string29.base, #t~string29.offset, 1);call write~init~int(100, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(10, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string29.base|=105, |#t~string29.offset|=0, |old(#NULL.base)|=104, |old(#NULL.offset)|=101, |old(#t~string29.base)|=103, |old(#t~string29.offset)|=102] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string29.base|=105, |#t~string29.offset|=0, |old(#NULL.base)|=104, |old(#NULL.offset)|=101, |old(#t~string29.base)|=103, |old(#t~string29.offset)|=102] [?] RET #16#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string29.base|=105, |#t~string29.offset|=0] [?] CALL call #t~ret30 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string29.base|=105, |#t~string29.offset|=0] [?] ~minInt~0 := -2147483648; VAL [main_~minInt~0=(- 2147483648), |#NULL.base|=0, |#NULL.offset|=0, |#t~string29.base|=105, |#t~string29.offset|=0] [?] assume -1 + ~minInt~0 <= 2147483647; VAL [main_~minInt~0=(- 2147483648), |#NULL.base|=0, |#NULL.offset|=0, |#t~string29.base|=105, |#t~string29.offset|=0] [?] assume !(-1 + ~minInt~0 >= -2147483648); VAL [main_~minInt~0=(- 2147483648), |#NULL.base|=0, |#NULL.offset|=0, |#t~string29.base|=105, |#t~string29.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=104, #NULL.offset=101, #t~string29.base=103, #t~string29.offset=102, old(#NULL.base)=104, old(#NULL.offset)=101, old(#t~string29.base)=103, old(#t~string29.offset)=102] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L334] call #t~string29.base, #t~string29.offset := #Ultimate.alloc(4); [L334] call write~init~int(37, #t~string29.base, #t~string29.offset, 1); [L334] call write~init~int(100, #t~string29.base, 1 + #t~string29.offset, 1); [L334] call write~init~int(10, #t~string29.base, 2 + #t~string29.offset, 1); [L334] call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, old(#NULL.base)=104, old(#NULL.offset)=101, old(#t~string29.base)=103, old(#t~string29.offset)=102] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, old(#NULL.base)=104, old(#NULL.offset)=101, old(#t~string29.base)=103, old(#t~string29.offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0] [?] CALL call #t~ret30 := main(); VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0] [L332] ~minInt~0 := -2147483648; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, ~minInt~0=-2147483648] [L333] assert -1 + ~minInt~0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, ~minInt~0=-2147483648] [L333] assert -1 + ~minInt~0 >= -2147483648; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, ~minInt~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=104, #NULL.offset=101, #t~string29.base=103, #t~string29.offset=102, old(#NULL.base)=104, old(#NULL.offset)=101, old(#t~string29.base)=103, old(#t~string29.offset)=102] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L334] call #t~string29.base, #t~string29.offset := #Ultimate.alloc(4); [L334] call write~init~int(37, #t~string29.base, #t~string29.offset, 1); [L334] call write~init~int(100, #t~string29.base, 1 + #t~string29.offset, 1); [L334] call write~init~int(10, #t~string29.base, 2 + #t~string29.offset, 1); [L334] call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, old(#NULL.base)=104, old(#NULL.offset)=101, old(#t~string29.base)=103, old(#t~string29.offset)=102] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, old(#NULL.base)=104, old(#NULL.offset)=101, old(#t~string29.base)=103, old(#t~string29.offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0] [?] CALL call #t~ret30 := main(); VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0] [L332] ~minInt~0 := -2147483648; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, ~minInt~0=-2147483648] [L333] assert -1 + ~minInt~0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, ~minInt~0=-2147483648] [L333] assert -1 + ~minInt~0 >= -2147483648; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, ~minInt~0=-2147483648] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=101, #t~string29!base=103, #t~string29!offset=102, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L334] FCALL call #t~string29 := #Ultimate.alloc(4); [L334] FCALL call write~init~int(37, { base: #t~string29!base, offset: #t~string29!offset }, 1); [L334] FCALL call write~init~int(100, { base: #t~string29!base, offset: 1 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(10, { base: #t~string29!base, offset: 2 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(0, { base: #t~string29!base, offset: 3 + #t~string29!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [?] CALL call #t~ret30 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [L332] ~minInt~0 := -2147483648; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L333] assert -1 + ~minInt~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L333] assert -1 + ~minInt~0 >= -2147483648; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=101, #t~string29!base=103, #t~string29!offset=102, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L334] FCALL call #t~string29 := #Ultimate.alloc(4); [L334] FCALL call write~init~int(37, { base: #t~string29!base, offset: #t~string29!offset }, 1); [L334] FCALL call write~init~int(100, { base: #t~string29!base, offset: 1 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(10, { base: #t~string29!base, offset: 2 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(0, { base: #t~string29!base, offset: 3 + #t~string29!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [?] CALL call #t~ret30 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [L332] ~minInt~0 := -2147483648; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L333] assert -1 + ~minInt~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L333] assert -1 + ~minInt~0 >= -2147483648; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=101, #t~string29!base=103, #t~string29!offset=102, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L334] FCALL call #t~string29 := #Ultimate.alloc(4); [L334] FCALL call write~init~int(37, { base: #t~string29!base, offset: #t~string29!offset }, 1); [L334] FCALL call write~init~int(100, { base: #t~string29!base, offset: 1 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(10, { base: #t~string29!base, offset: 2 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(0, { base: #t~string29!base, offset: 3 + #t~string29!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [?] CALL call #t~ret30 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [L332] ~minInt~0 := -2147483648; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L333] assert -1 + ~minInt~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L333] assert -1 + ~minInt~0 >= -2147483648; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=101, #t~string29!base=103, #t~string29!offset=102, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L334] FCALL call #t~string29 := #Ultimate.alloc(4); [L334] FCALL call write~init~int(37, { base: #t~string29!base, offset: #t~string29!offset }, 1); [L334] FCALL call write~init~int(100, { base: #t~string29!base, offset: 1 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(10, { base: #t~string29!base, offset: 2 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(0, { base: #t~string29!base, offset: 3 + #t~string29!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [?] CALL call #t~ret30 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [L332] ~minInt~0 := -2147483648; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L333] assert -1 + ~minInt~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L333] assert -1 + ~minInt~0 >= -2147483648; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L332] int minInt = -2147483647 - 1; VAL [minInt=-2147483648] [L333] minInt + -1 VAL [minInt=-2147483648] ----- [2018-11-23 01:56:28,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:56:28 BoogieIcfgContainer [2018-11-23 01:56:28,143 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 01:56:28,143 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:56:28,143 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:56:28,143 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:56:28,144 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:56:27" (3/4) ... [2018-11-23 01:56:28,146 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=104, |#NULL.offset|=101, |#t~string29.base|=103, |#t~string29.offset|=102, |old(#NULL.base)|=104, |old(#NULL.offset)|=101, |old(#t~string29.base)|=103, |old(#t~string29.offset)|=102] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string29.base, #t~string29.offset := #Ultimate.alloc(4);call write~init~int(37, #t~string29.base, #t~string29.offset, 1);call write~init~int(100, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(10, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string29.base|=105, |#t~string29.offset|=0, |old(#NULL.base)|=104, |old(#NULL.offset)|=101, |old(#t~string29.base)|=103, |old(#t~string29.offset)|=102] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string29.base|=105, |#t~string29.offset|=0, |old(#NULL.base)|=104, |old(#NULL.offset)|=101, |old(#t~string29.base)|=103, |old(#t~string29.offset)|=102] [?] RET #16#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string29.base|=105, |#t~string29.offset|=0] [?] CALL call #t~ret30 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string29.base|=105, |#t~string29.offset|=0] [?] ~minInt~0 := -2147483648; VAL [main_~minInt~0=(- 2147483648), |#NULL.base|=0, |#NULL.offset|=0, |#t~string29.base|=105, |#t~string29.offset|=0] [?] assume -1 + ~minInt~0 <= 2147483647; VAL [main_~minInt~0=(- 2147483648), |#NULL.base|=0, |#NULL.offset|=0, |#t~string29.base|=105, |#t~string29.offset|=0] [?] assume !(-1 + ~minInt~0 >= -2147483648); VAL [main_~minInt~0=(- 2147483648), |#NULL.base|=0, |#NULL.offset|=0, |#t~string29.base|=105, |#t~string29.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=104, #NULL.offset=101, #t~string29.base=103, #t~string29.offset=102, old(#NULL.base)=104, old(#NULL.offset)=101, old(#t~string29.base)=103, old(#t~string29.offset)=102] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L334] call #t~string29.base, #t~string29.offset := #Ultimate.alloc(4); [L334] call write~init~int(37, #t~string29.base, #t~string29.offset, 1); [L334] call write~init~int(100, #t~string29.base, 1 + #t~string29.offset, 1); [L334] call write~init~int(10, #t~string29.base, 2 + #t~string29.offset, 1); [L334] call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, old(#NULL.base)=104, old(#NULL.offset)=101, old(#t~string29.base)=103, old(#t~string29.offset)=102] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, old(#NULL.base)=104, old(#NULL.offset)=101, old(#t~string29.base)=103, old(#t~string29.offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0] [?] CALL call #t~ret30 := main(); VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0] [L332] ~minInt~0 := -2147483648; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, ~minInt~0=-2147483648] [L333] assert -1 + ~minInt~0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, ~minInt~0=-2147483648] [L333] assert -1 + ~minInt~0 >= -2147483648; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, ~minInt~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=104, #NULL.offset=101, #t~string29.base=103, #t~string29.offset=102, old(#NULL.base)=104, old(#NULL.offset)=101, old(#t~string29.base)=103, old(#t~string29.offset)=102] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L334] call #t~string29.base, #t~string29.offset := #Ultimate.alloc(4); [L334] call write~init~int(37, #t~string29.base, #t~string29.offset, 1); [L334] call write~init~int(100, #t~string29.base, 1 + #t~string29.offset, 1); [L334] call write~init~int(10, #t~string29.base, 2 + #t~string29.offset, 1); [L334] call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, old(#NULL.base)=104, old(#NULL.offset)=101, old(#t~string29.base)=103, old(#t~string29.offset)=102] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, old(#NULL.base)=104, old(#NULL.offset)=101, old(#t~string29.base)=103, old(#t~string29.offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0] [?] CALL call #t~ret30 := main(); VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0] [L332] ~minInt~0 := -2147483648; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, ~minInt~0=-2147483648] [L333] assert -1 + ~minInt~0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, ~minInt~0=-2147483648] [L333] assert -1 + ~minInt~0 >= -2147483648; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, ~minInt~0=-2147483648] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=101, #t~string29!base=103, #t~string29!offset=102, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L334] FCALL call #t~string29 := #Ultimate.alloc(4); [L334] FCALL call write~init~int(37, { base: #t~string29!base, offset: #t~string29!offset }, 1); [L334] FCALL call write~init~int(100, { base: #t~string29!base, offset: 1 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(10, { base: #t~string29!base, offset: 2 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(0, { base: #t~string29!base, offset: 3 + #t~string29!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [?] CALL call #t~ret30 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [L332] ~minInt~0 := -2147483648; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L333] assert -1 + ~minInt~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L333] assert -1 + ~minInt~0 >= -2147483648; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=101, #t~string29!base=103, #t~string29!offset=102, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L334] FCALL call #t~string29 := #Ultimate.alloc(4); [L334] FCALL call write~init~int(37, { base: #t~string29!base, offset: #t~string29!offset }, 1); [L334] FCALL call write~init~int(100, { base: #t~string29!base, offset: 1 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(10, { base: #t~string29!base, offset: 2 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(0, { base: #t~string29!base, offset: 3 + #t~string29!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [?] CALL call #t~ret30 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [L332] ~minInt~0 := -2147483648; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L333] assert -1 + ~minInt~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L333] assert -1 + ~minInt~0 >= -2147483648; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=101, #t~string29!base=103, #t~string29!offset=102, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L334] FCALL call #t~string29 := #Ultimate.alloc(4); [L334] FCALL call write~init~int(37, { base: #t~string29!base, offset: #t~string29!offset }, 1); [L334] FCALL call write~init~int(100, { base: #t~string29!base, offset: 1 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(10, { base: #t~string29!base, offset: 2 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(0, { base: #t~string29!base, offset: 3 + #t~string29!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [?] CALL call #t~ret30 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [L332] ~minInt~0 := -2147483648; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L333] assert -1 + ~minInt~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L333] assert -1 + ~minInt~0 >= -2147483648; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=101, #t~string29!base=103, #t~string29!offset=102, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L334] FCALL call #t~string29 := #Ultimate.alloc(4); [L334] FCALL call write~init~int(37, { base: #t~string29!base, offset: #t~string29!offset }, 1); [L334] FCALL call write~init~int(100, { base: #t~string29!base, offset: 1 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(10, { base: #t~string29!base, offset: 2 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(0, { base: #t~string29!base, offset: 3 + #t~string29!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [?] CALL call #t~ret30 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [L332] ~minInt~0 := -2147483648; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L333] assert -1 + ~minInt~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L333] assert -1 + ~minInt~0 >= -2147483648; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L332] int minInt = -2147483647 - 1; VAL [minInt=-2147483648] [L333] minInt + -1 VAL [minInt=-2147483648] ----- [2018-11-23 01:56:28,177 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7e2267ab-e659-4cf8-90f8-839996d92707/bin-2019/utaipan/witness.graphml [2018-11-23 01:56:28,177 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:56:28,178 INFO L168 Benchmark]: Toolchain (without parser) took 936.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -124.1 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-23 01:56:28,179 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:56:28,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2018-11-23 01:56:28,180 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:56:28,180 INFO L168 Benchmark]: Boogie Preprocessor took 11.64 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:56:28,180 INFO L168 Benchmark]: RCFGBuilder took 244.73 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 01:56:28,180 INFO L168 Benchmark]: TraceAbstraction took 337.16 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-11-23 01:56:28,181 INFO L168 Benchmark]: Witness Printer took 34.21 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:56:28,183 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 286.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.64 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. * RCFGBuilder took 244.73 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 337.16 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * Witness Printer took 34.21 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: 333]: integer overflow possible integer overflow possible We found a FailurePath: [L332] int minInt = -2147483647 - 1; VAL [minInt=-2147483648] [L333] minInt + -1 VAL [minInt=-2147483648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 18 locations, 4 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6 SDtfs, 2 SDslu, 5 SDs, 0 SdLazy, 2 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 60 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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...