./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/GulwaniJainKoskinen-PLDI2009-Fig1_false-no-overflow.c --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_d25558c3-4126-40ac-a730-be87c8ef5772/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d25558c3-4126-40ac-a730-be87c8ef5772/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d25558c3-4126-40ac-a730-be87c8ef5772/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d25558c3-4126-40ac-a730-be87c8ef5772/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/GulwaniJainKoskinen-PLDI2009-Fig1_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d25558c3-4126-40ac-a730-be87c8ef5772/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d25558c3-4126-40ac-a730-be87c8ef5772/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 d7d414d68736ab19121f0afd030fc9c628e90ba4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 00:44:46,891 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:44:46,892 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:44:46,899 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:44:46,899 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:44:46,900 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:44:46,901 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:44:46,902 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:44:46,903 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:44:46,904 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:44:46,904 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:44:46,904 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:44:46,905 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:44:46,906 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:44:46,906 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:44:46,907 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:44:46,907 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:44:46,909 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:44:46,910 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:44:46,911 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:44:46,912 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:44:46,912 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:44:46,914 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:44:46,914 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:44:46,914 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:44:46,915 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:44:46,916 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:44:46,916 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:44:46,917 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:44:46,918 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:44:46,918 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:44:46,918 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:44:46,918 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:44:46,918 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:44:46,919 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:44:46,919 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:44:46,919 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d25558c3-4126-40ac-a730-be87c8ef5772/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-11-23 00:44:46,929 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:44:46,929 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:44:46,930 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:44:46,930 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:44:46,930 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 00:44:46,930 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 00:44:46,930 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 00:44:46,930 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 00:44:46,930 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 00:44:46,930 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 00:44:46,931 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 00:44:46,931 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 00:44:46,931 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 00:44:46,931 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:44:46,931 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 00:44:46,931 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:44:46,931 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:44:46,932 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:44:46,932 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:44:46,932 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:44:46,932 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 00:44:46,932 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:44:46,932 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:44:46,932 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:44:46,933 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:44:46,933 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:44:46,933 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:44:46,933 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:44:46,933 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:44:46,933 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:44:46,933 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:44:46,933 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:44:46,933 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 00:44:46,933 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:44:46,934 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 00:44:46,934 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 00:44:46,934 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_d25558c3-4126-40ac-a730-be87c8ef5772/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 -> d7d414d68736ab19121f0afd030fc9c628e90ba4 [2018-11-23 00:44:46,955 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:44:46,963 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:44:46,965 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:44:46,966 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:44:46,966 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:44:46,966 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d25558c3-4126-40ac-a730-be87c8ef5772/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted-lit/GulwaniJainKoskinen-PLDI2009-Fig1_false-no-overflow.c [2018-11-23 00:44:47,006 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d25558c3-4126-40ac-a730-be87c8ef5772/bin-2019/utaipan/data/3d0aa2b23/a380b0eef04a40178393cf2822137448/FLAG9c5246152 [2018-11-23 00:44:47,338 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:44:47,339 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d25558c3-4126-40ac-a730-be87c8ef5772/sv-benchmarks/c/termination-crafted-lit/GulwaniJainKoskinen-PLDI2009-Fig1_false-no-overflow.c [2018-11-23 00:44:47,344 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d25558c3-4126-40ac-a730-be87c8ef5772/bin-2019/utaipan/data/3d0aa2b23/a380b0eef04a40178393cf2822137448/FLAG9c5246152 [2018-11-23 00:44:47,773 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d25558c3-4126-40ac-a730-be87c8ef5772/bin-2019/utaipan/data/3d0aa2b23/a380b0eef04a40178393cf2822137448 [2018-11-23 00:44:47,776 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:44:47,777 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:44:47,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:44:47,777 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:44:47,779 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:44:47,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:44:47" (1/1) ... [2018-11-23 00:44:47,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a6f6b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:44:47, skipping insertion in model container [2018-11-23 00:44:47,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:44:47" (1/1) ... [2018-11-23 00:44:47,788 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:44:47,799 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:44:47,900 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:44:47,902 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:44:47,913 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:44:47,921 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:44:47,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:44:47 WrapperNode [2018-11-23 00:44:47,921 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:44:47,922 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:44:47,922 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:44:47,922 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:44:47,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:44:47" (1/1) ... [2018-11-23 00:44:47,930 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:44:47" (1/1) ... [2018-11-23 00:44:47,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:44:47,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:44:47,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:44:47,934 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:44:47,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:44:47" (1/1) ... [2018-11-23 00:44:47,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:44:47" (1/1) ... [2018-11-23 00:44:47,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:44:47" (1/1) ... [2018-11-23 00:44:47,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:44:47" (1/1) ... [2018-11-23 00:44:47,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:44:47" (1/1) ... [2018-11-23 00:44:47,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:44:47" (1/1) ... [2018-11-23 00:44:47,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:44:47" (1/1) ... [2018-11-23 00:44:47,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:44:47,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:44:47,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:44:47,946 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:44:47,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:44:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d25558c3-4126-40ac-a730-be87c8ef5772/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 00:44:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:44:48,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:44:48,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:44:48,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:44:48,021 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:44:48,021 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:44:48,120 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:44:48,121 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 00:44:48,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:44:48 BoogieIcfgContainer [2018-11-23 00:44:48,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:44:48,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:44:48,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:44:48,123 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:44:48,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:44:47" (1/3) ... [2018-11-23 00:44:48,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e99e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:44:48, skipping insertion in model container [2018-11-23 00:44:48,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:44:47" (2/3) ... [2018-11-23 00:44:48,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e99e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:44:48, skipping insertion in model container [2018-11-23 00:44:48,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:44:48" (3/3) ... [2018-11-23 00:44:48,126 INFO L112 eAbstractionObserver]: Analyzing ICFG GulwaniJainKoskinen-PLDI2009-Fig1_false-no-overflow.c [2018-11-23 00:44:48,132 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:44:48,137 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-23 00:44:48,146 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-23 00:44:48,165 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:44:48,165 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 00:44:48,166 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:44:48,166 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:44:48,166 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:44:48,166 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:44:48,166 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:44:48,166 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:44:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 00:44:48,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 00:44:48,181 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:44:48,182 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:44:48,184 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 00:44:48,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:44:48,188 INFO L82 PathProgramCache]: Analyzing trace with hash -336853775, now seen corresponding path program 1 times [2018-11-23 00:44:48,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:44:48,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:44:48,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:44:48,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:44:48,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:44:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:44:48,282 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 00:44:48,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:44:48,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:44:48,284 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:44:48,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:44:48,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:44:48,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:44:48,296 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 4 states. [2018-11-23 00:44:48,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:44:48,358 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-23 00:44:48,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:44:48,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-11-23 00:44:48,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:44:48,367 INFO L225 Difference]: With dead ends: 31 [2018-11-23 00:44:48,367 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 00:44:48,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:44:48,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 00:44:48,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 00:44:48,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 00:44:48,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-23 00:44:48,391 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 7 [2018-11-23 00:44:48,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:44:48,391 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-23 00:44:48,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:44:48,391 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-23 00:44:48,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 00:44:48,392 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:44:48,392 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:44:48,392 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 00:44:48,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:44:48,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1852532392, now seen corresponding path program 1 times [2018-11-23 00:44:48,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:44:48,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:44:48,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:44:48,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:44:48,394 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:44:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:44:48,415 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 00:44:48,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:44:48,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:44:48,415 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:44:48,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:44:48,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:44:48,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:44:48,417 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2018-11-23 00:44:48,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:44:48,425 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-11-23 00:44:48,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:44:48,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 00:44:48,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:44:48,426 INFO L225 Difference]: With dead ends: 17 [2018-11-23 00:44:48,426 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 00:44:48,426 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 00:44:48,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 00:44:48,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 00:44:48,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 00:44:48,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-11-23 00:44:48,429 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 8 [2018-11-23 00:44:48,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:44:48,429 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-23 00:44:48,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:44:48,429 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 00:44:48,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 00:44:48,430 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:44:48,430 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:44:48,430 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 00:44:48,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:44:48,430 INFO L82 PathProgramCache]: Analyzing trace with hash -114500992, now seen corresponding path program 1 times [2018-11-23 00:44:48,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:44:48,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:44:48,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:44:48,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:44:48,432 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:44:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:44:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:44:48,458 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #47#return; [?] CALL call #t~ret4 := main(); [?] havoc ~id~0;havoc ~maxId~0;havoc ~tmp~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~id~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~maxId~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~id~0=2147483646, main_~maxId~0=2147483647] [?] assume 0 <= ~id~0 && ~id~0 < ~maxId~0; VAL [main_~id~0=2147483646, main_~maxId~0=2147483647] [?] assume 1 + ~id~0 <= 2147483647; VAL [main_~id~0=2147483646, main_~maxId~0=2147483647] [?] assume 1 + ~id~0 >= -2147483648;~tmp~0 := 1 + ~id~0; VAL [main_~id~0=2147483646, main_~maxId~0=2147483647, main_~tmp~0=2147483647] [?] #t~short3 := ~tmp~0 != ~id~0; VAL [main_~id~0=2147483646, main_~maxId~0=2147483647, main_~tmp~0=2147483647, |main_#t~short3|=true] [?] assume #t~short3;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;#t~short3 := 0 != #t~nondet2; VAL [main_~id~0=2147483646, main_~maxId~0=2147483647, main_~tmp~0=2147483647, |main_#t~nondet2|=1, |main_#t~short3|=true] [?] assume !!#t~short3;havoc #t~nondet2;havoc #t~short3; VAL [main_~id~0=2147483646, main_~maxId~0=2147483647, main_~tmp~0=2147483647] [?] assume ~tmp~0 <= ~maxId~0; VAL [main_~id~0=2147483646, main_~maxId~0=2147483647, main_~tmp~0=2147483647] [?] assume !(1 + ~tmp~0 <= 2147483647); VAL [main_~id~0=2147483646, main_~maxId~0=2147483647, main_~tmp~0=2147483647] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] havoc ~id~0; [L16] havoc ~maxId~0; [L16] havoc ~tmp~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~id~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~maxId~0 := #t~nondet1; [L18] havoc #t~nondet1; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L21-L30] assume 0 <= ~id~0 && ~id~0 < ~maxId~0; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L22] assert 1 + ~id~0 <= 2147483647; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L22] assert 1 + ~id~0 >= -2147483648; [L22] ~tmp~0 := 1 + ~id~0; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23] #t~short3 := ~tmp~0 != ~id~0; VAL [#t~short3=true, ~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23] assume #t~short3; [L23] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L23] #t~short3 := 0 != #t~nondet2; VAL [#t~nondet2=1, #t~short3=true, ~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23-L29] assume !!#t~short3; [L23] havoc #t~nondet2; [L23] havoc #t~short3; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L24-L28] assume ~tmp~0 <= ~maxId~0; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L25] assert 1 + ~tmp~0 <= 2147483647; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] havoc ~id~0; [L16] havoc ~maxId~0; [L16] havoc ~tmp~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~id~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~maxId~0 := #t~nondet1; [L18] havoc #t~nondet1; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L21-L30] assume 0 <= ~id~0 && ~id~0 < ~maxId~0; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L22] assert 1 + ~id~0 <= 2147483647; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L22] assert 1 + ~id~0 >= -2147483648; [L22] ~tmp~0 := 1 + ~id~0; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23] #t~short3 := ~tmp~0 != ~id~0; VAL [#t~short3=true, ~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23] assume #t~short3; [L23] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L23] #t~short3 := 0 != #t~nondet2; VAL [#t~nondet2=1, #t~short3=true, ~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23-L29] assume !!#t~short3; [L23] havoc #t~nondet2; [L23] havoc #t~short3; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L24-L28] assume ~tmp~0 <= ~maxId~0; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L25] assert 1 + ~tmp~0 <= 2147483647; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] havoc ~id~0; [L16] havoc ~maxId~0; [L16] havoc ~tmp~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~id~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~maxId~0 := #t~nondet1; [L18] havoc #t~nondet1; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L21] COND TRUE 0 <= ~id~0 && ~id~0 < ~maxId~0 VAL [~id~0=2147483646, ~maxId~0=2147483647] [L22] assert 1 + ~id~0 <= 2147483647; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L22] assert 1 + ~id~0 >= -2147483648; [L22] ~tmp~0 := 1 + ~id~0; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23] #t~short3 := ~tmp~0 != ~id~0; VAL [#t~short3=true, ~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23] COND TRUE #t~short3 [L23] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L23] #t~short3 := 0 != #t~nondet2; VAL [#t~nondet2=1, #t~short3=true, ~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23-L29] COND FALSE !(!#t~short3) [L23] havoc #t~nondet2; [L23] havoc #t~short3; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L24] COND TRUE ~tmp~0 <= ~maxId~0 VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L25] assert 1 + ~tmp~0 <= 2147483647; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] havoc ~id~0; [L16] havoc ~maxId~0; [L16] havoc ~tmp~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~id~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~maxId~0 := #t~nondet1; [L18] havoc #t~nondet1; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L21] COND TRUE 0 <= ~id~0 && ~id~0 < ~maxId~0 VAL [~id~0=2147483646, ~maxId~0=2147483647] [L22] assert 1 + ~id~0 <= 2147483647; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L22] assert 1 + ~id~0 >= -2147483648; [L22] ~tmp~0 := 1 + ~id~0; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23] #t~short3 := ~tmp~0 != ~id~0; VAL [#t~short3=true, ~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23] COND TRUE #t~short3 [L23] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L23] #t~short3 := 0 != #t~nondet2; VAL [#t~nondet2=1, #t~short3=true, ~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23-L29] COND FALSE !(!#t~short3) [L23] havoc #t~nondet2; [L23] havoc #t~short3; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L24] COND TRUE ~tmp~0 <= ~maxId~0 VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L25] assert 1 + ~tmp~0 <= 2147483647; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] havoc ~id~0; [L16] havoc ~maxId~0; [L16] havoc ~tmp~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~id~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~maxId~0 := #t~nondet1; [L18] havoc #t~nondet1; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L21] COND TRUE 0 <= ~id~0 && ~id~0 < ~maxId~0 VAL [~id~0=2147483646, ~maxId~0=2147483647] [L22] assert 1 + ~id~0 <= 2147483647; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L22] assert 1 + ~id~0 >= -2147483648; [L22] ~tmp~0 := 1 + ~id~0; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23] #t~short3 := ~tmp~0 != ~id~0; VAL [#t~short3=true, ~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23] COND TRUE #t~short3 [L23] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L23] #t~short3 := 0 != #t~nondet2; VAL [#t~nondet2=1, #t~short3=true, ~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23-L29] COND FALSE !(!#t~short3) [L23] havoc #t~nondet2; [L23] havoc #t~short3; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L24] COND TRUE ~tmp~0 <= ~maxId~0 VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L25] assert 1 + ~tmp~0 <= 2147483647; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] havoc ~id~0; [L16] havoc ~maxId~0; [L16] havoc ~tmp~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~id~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~maxId~0 := #t~nondet1; [L18] havoc #t~nondet1; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L21] COND TRUE 0 <= ~id~0 && ~id~0 < ~maxId~0 VAL [~id~0=2147483646, ~maxId~0=2147483647] [L22] assert 1 + ~id~0 <= 2147483647; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L22] assert 1 + ~id~0 >= -2147483648; [L22] ~tmp~0 := 1 + ~id~0; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23] #t~short3 := ~tmp~0 != ~id~0; VAL [#t~short3=true, ~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23] COND TRUE #t~short3 [L23] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L23] #t~short3 := 0 != #t~nondet2; VAL [#t~nondet2=1, #t~short3=true, ~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23-L29] COND FALSE !(!#t~short3) [L23] havoc #t~nondet2; [L23] havoc #t~short3; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L24] COND TRUE ~tmp~0 <= ~maxId~0 VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L25] assert 1 + ~tmp~0 <= 2147483647; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L16] int id, maxId, tmp; [L17] id = __VERIFIER_nondet_int() [L18] maxId = __VERIFIER_nondet_int() [L21] COND TRUE 0 <= id && id < maxId VAL [id=2147483646, maxId=2147483647] [L22] EXPR id+1 [L22] tmp = id+1 VAL [id=2147483646, maxId=2147483647, tmp=2147483647] [L23] tmp!=id && __VERIFIER_nondet_int() != 0 [L23] tmp!=id && __VERIFIER_nondet_int() != 0 VAL [__VERIFIER_nondet_int()=1, id=2147483646, maxId=2147483647, tmp=2147483647, tmp!=id && __VERIFIER_nondet_int() != 0=1] [L23] COND TRUE tmp!=id && __VERIFIER_nondet_int() != 0 [L24] COND TRUE tmp <= maxId VAL [id=2147483646, maxId=2147483647, tmp=2147483647] [L25] tmp + 1 VAL [id=2147483646, maxId=2147483647, tmp=2147483647] ----- [2018-11-23 00:44:48,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:44:48 BoogieIcfgContainer [2018-11-23 00:44:48,483 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 00:44:48,484 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:44:48,484 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:44:48,484 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:44:48,484 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:44:48" (3/4) ... [2018-11-23 00:44:48,486 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 #47#return; [?] CALL call #t~ret4 := main(); [?] havoc ~id~0;havoc ~maxId~0;havoc ~tmp~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~id~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~maxId~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~id~0=2147483646, main_~maxId~0=2147483647] [?] assume 0 <= ~id~0 && ~id~0 < ~maxId~0; VAL [main_~id~0=2147483646, main_~maxId~0=2147483647] [?] assume 1 + ~id~0 <= 2147483647; VAL [main_~id~0=2147483646, main_~maxId~0=2147483647] [?] assume 1 + ~id~0 >= -2147483648;~tmp~0 := 1 + ~id~0; VAL [main_~id~0=2147483646, main_~maxId~0=2147483647, main_~tmp~0=2147483647] [?] #t~short3 := ~tmp~0 != ~id~0; VAL [main_~id~0=2147483646, main_~maxId~0=2147483647, main_~tmp~0=2147483647, |main_#t~short3|=true] [?] assume #t~short3;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;#t~short3 := 0 != #t~nondet2; VAL [main_~id~0=2147483646, main_~maxId~0=2147483647, main_~tmp~0=2147483647, |main_#t~nondet2|=1, |main_#t~short3|=true] [?] assume !!#t~short3;havoc #t~nondet2;havoc #t~short3; VAL [main_~id~0=2147483646, main_~maxId~0=2147483647, main_~tmp~0=2147483647] [?] assume ~tmp~0 <= ~maxId~0; VAL [main_~id~0=2147483646, main_~maxId~0=2147483647, main_~tmp~0=2147483647] [?] assume !(1 + ~tmp~0 <= 2147483647); VAL [main_~id~0=2147483646, main_~maxId~0=2147483647, main_~tmp~0=2147483647] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] havoc ~id~0; [L16] havoc ~maxId~0; [L16] havoc ~tmp~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~id~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~maxId~0 := #t~nondet1; [L18] havoc #t~nondet1; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L21-L30] assume 0 <= ~id~0 && ~id~0 < ~maxId~0; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L22] assert 1 + ~id~0 <= 2147483647; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L22] assert 1 + ~id~0 >= -2147483648; [L22] ~tmp~0 := 1 + ~id~0; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23] #t~short3 := ~tmp~0 != ~id~0; VAL [#t~short3=true, ~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23] assume #t~short3; [L23] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L23] #t~short3 := 0 != #t~nondet2; VAL [#t~nondet2=1, #t~short3=true, ~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23-L29] assume !!#t~short3; [L23] havoc #t~nondet2; [L23] havoc #t~short3; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L24-L28] assume ~tmp~0 <= ~maxId~0; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L25] assert 1 + ~tmp~0 <= 2147483647; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] havoc ~id~0; [L16] havoc ~maxId~0; [L16] havoc ~tmp~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~id~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~maxId~0 := #t~nondet1; [L18] havoc #t~nondet1; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L21-L30] assume 0 <= ~id~0 && ~id~0 < ~maxId~0; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L22] assert 1 + ~id~0 <= 2147483647; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L22] assert 1 + ~id~0 >= -2147483648; [L22] ~tmp~0 := 1 + ~id~0; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23] #t~short3 := ~tmp~0 != ~id~0; VAL [#t~short3=true, ~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23] assume #t~short3; [L23] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L23] #t~short3 := 0 != #t~nondet2; VAL [#t~nondet2=1, #t~short3=true, ~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23-L29] assume !!#t~short3; [L23] havoc #t~nondet2; [L23] havoc #t~short3; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L24-L28] assume ~tmp~0 <= ~maxId~0; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L25] assert 1 + ~tmp~0 <= 2147483647; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] havoc ~id~0; [L16] havoc ~maxId~0; [L16] havoc ~tmp~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~id~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~maxId~0 := #t~nondet1; [L18] havoc #t~nondet1; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L21] COND TRUE 0 <= ~id~0 && ~id~0 < ~maxId~0 VAL [~id~0=2147483646, ~maxId~0=2147483647] [L22] assert 1 + ~id~0 <= 2147483647; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L22] assert 1 + ~id~0 >= -2147483648; [L22] ~tmp~0 := 1 + ~id~0; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23] #t~short3 := ~tmp~0 != ~id~0; VAL [#t~short3=true, ~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23] COND TRUE #t~short3 [L23] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L23] #t~short3 := 0 != #t~nondet2; VAL [#t~nondet2=1, #t~short3=true, ~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23-L29] COND FALSE !(!#t~short3) [L23] havoc #t~nondet2; [L23] havoc #t~short3; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L24] COND TRUE ~tmp~0 <= ~maxId~0 VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L25] assert 1 + ~tmp~0 <= 2147483647; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] havoc ~id~0; [L16] havoc ~maxId~0; [L16] havoc ~tmp~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~id~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~maxId~0 := #t~nondet1; [L18] havoc #t~nondet1; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L21] COND TRUE 0 <= ~id~0 && ~id~0 < ~maxId~0 VAL [~id~0=2147483646, ~maxId~0=2147483647] [L22] assert 1 + ~id~0 <= 2147483647; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L22] assert 1 + ~id~0 >= -2147483648; [L22] ~tmp~0 := 1 + ~id~0; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23] #t~short3 := ~tmp~0 != ~id~0; VAL [#t~short3=true, ~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23] COND TRUE #t~short3 [L23] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L23] #t~short3 := 0 != #t~nondet2; VAL [#t~nondet2=1, #t~short3=true, ~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23-L29] COND FALSE !(!#t~short3) [L23] havoc #t~nondet2; [L23] havoc #t~short3; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L24] COND TRUE ~tmp~0 <= ~maxId~0 VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L25] assert 1 + ~tmp~0 <= 2147483647; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] havoc ~id~0; [L16] havoc ~maxId~0; [L16] havoc ~tmp~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~id~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~maxId~0 := #t~nondet1; [L18] havoc #t~nondet1; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L21] COND TRUE 0 <= ~id~0 && ~id~0 < ~maxId~0 VAL [~id~0=2147483646, ~maxId~0=2147483647] [L22] assert 1 + ~id~0 <= 2147483647; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L22] assert 1 + ~id~0 >= -2147483648; [L22] ~tmp~0 := 1 + ~id~0; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23] #t~short3 := ~tmp~0 != ~id~0; VAL [#t~short3=true, ~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23] COND TRUE #t~short3 [L23] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L23] #t~short3 := 0 != #t~nondet2; VAL [#t~nondet2=1, #t~short3=true, ~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23-L29] COND FALSE !(!#t~short3) [L23] havoc #t~nondet2; [L23] havoc #t~short3; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L24] COND TRUE ~tmp~0 <= ~maxId~0 VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L25] assert 1 + ~tmp~0 <= 2147483647; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] havoc ~id~0; [L16] havoc ~maxId~0; [L16] havoc ~tmp~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~id~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~maxId~0 := #t~nondet1; [L18] havoc #t~nondet1; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L21] COND TRUE 0 <= ~id~0 && ~id~0 < ~maxId~0 VAL [~id~0=2147483646, ~maxId~0=2147483647] [L22] assert 1 + ~id~0 <= 2147483647; VAL [~id~0=2147483646, ~maxId~0=2147483647] [L22] assert 1 + ~id~0 >= -2147483648; [L22] ~tmp~0 := 1 + ~id~0; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23] #t~short3 := ~tmp~0 != ~id~0; VAL [#t~short3=true, ~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23] COND TRUE #t~short3 [L23] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L23] #t~short3 := 0 != #t~nondet2; VAL [#t~nondet2=1, #t~short3=true, ~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L23-L29] COND FALSE !(!#t~short3) [L23] havoc #t~nondet2; [L23] havoc #t~short3; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L24] COND TRUE ~tmp~0 <= ~maxId~0 VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L25] assert 1 + ~tmp~0 <= 2147483647; VAL [~id~0=2147483646, ~maxId~0=2147483647, ~tmp~0=2147483647] [L16] int id, maxId, tmp; [L17] id = __VERIFIER_nondet_int() [L18] maxId = __VERIFIER_nondet_int() [L21] COND TRUE 0 <= id && id < maxId VAL [id=2147483646, maxId=2147483647] [L22] EXPR id+1 [L22] tmp = id+1 VAL [id=2147483646, maxId=2147483647, tmp=2147483647] [L23] tmp!=id && __VERIFIER_nondet_int() != 0 [L23] tmp!=id && __VERIFIER_nondet_int() != 0 VAL [__VERIFIER_nondet_int()=1, id=2147483646, maxId=2147483647, tmp=2147483647, tmp!=id && __VERIFIER_nondet_int() != 0=1] [L23] COND TRUE tmp!=id && __VERIFIER_nondet_int() != 0 [L24] COND TRUE tmp <= maxId VAL [id=2147483646, maxId=2147483647, tmp=2147483647] [L25] tmp + 1 VAL [id=2147483646, maxId=2147483647, tmp=2147483647] ----- [2018-11-23 00:44:48,520 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d25558c3-4126-40ac-a730-be87c8ef5772/bin-2019/utaipan/witness.graphml [2018-11-23 00:44:48,521 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:44:48,521 INFO L168 Benchmark]: Toolchain (without parser) took 745.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 960.8 MB in the beginning and 1.1 GB in the end (delta: -118.1 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-23 00:44:48,522 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:44:48,522 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.58 ms. Allocated memory is still 1.0 GB. Free memory was 960.8 MB in the beginning and 950.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:44:48,523 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.18 ms. Allocated memory is still 1.0 GB. Free memory was 950.1 MB in the beginning and 944.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:44:48,523 INFO L168 Benchmark]: Boogie Preprocessor took 11.58 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:44:48,523 INFO L168 Benchmark]: RCFGBuilder took 175.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-23 00:44:48,524 INFO L168 Benchmark]: TraceAbstraction took 361.92 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: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-23 00:44:48,524 INFO L168 Benchmark]: Witness Printer took 36.99 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 00:44:48,526 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 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 144.58 ms. Allocated memory is still 1.0 GB. Free memory was 960.8 MB in the beginning and 950.1 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 12.18 ms. Allocated memory is still 1.0 GB. Free memory was 950.1 MB in the beginning and 944.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.58 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 175.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 361.92 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: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Witness Printer took 36.99 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 25]: integer overflow possible integer overflow possible We found a FailurePath: [L16] int id, maxId, tmp; [L17] id = __VERIFIER_nondet_int() [L18] maxId = __VERIFIER_nondet_int() [L21] COND TRUE 0 <= id && id < maxId VAL [id=2147483646, maxId=2147483647] [L22] EXPR id+1 [L22] tmp = id+1 VAL [id=2147483646, maxId=2147483647, tmp=2147483647] [L23] tmp!=id && __VERIFIER_nondet_int() != 0 [L23] tmp!=id && __VERIFIER_nondet_int() != 0 VAL [__VERIFIER_nondet_int()=1, id=2147483646, maxId=2147483647, tmp=2147483647, tmp!=id && __VERIFIER_nondet_int() != 0=1] [L23] COND TRUE tmp!=id && __VERIFIER_nondet_int() != 0 [L24] COND TRUE tmp <= maxId VAL [id=2147483646, maxId=2147483647, tmp=2147483647] [L25] tmp + 1 VAL [id=2147483646, maxId=2147483647, tmp=2147483647] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 23 locations, 4 error locations. UNSAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 35 SDtfs, 45 SDslu, 20 SDs, 0 SdLazy, 14 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 137 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...