./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/signedintegeroverflow-regression/PrefixIncrement_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_92222bed-faec-46e1-a6ab-92767d1b980c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_92222bed-faec-46e1-a6ab-92767d1b980c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_92222bed-faec-46e1-a6ab-92767d1b980c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_92222bed-faec-46e1-a6ab-92767d1b980c/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/signedintegeroverflow-regression/PrefixIncrement_false-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_92222bed-faec-46e1-a6ab-92767d1b980c/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_92222bed-faec-46e1-a6ab-92767d1b980c/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 458defa6989fd07c9ad90ba734f631bc16cdc88e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 02:38:12,148 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:38:12,149 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:38:12,157 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:38:12,157 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:38:12,158 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:38:12,159 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:38:12,161 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:38:12,162 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:38:12,163 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:38:12,164 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:38:12,164 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:38:12,165 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:38:12,166 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:38:12,167 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:38:12,168 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:38:12,169 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:38:12,170 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:38:12,172 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:38:12,174 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:38:12,175 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:38:12,176 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:38:12,178 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:38:12,178 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:38:12,178 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:38:12,179 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:38:12,181 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:38:12,181 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:38:12,182 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:38:12,183 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:38:12,183 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:38:12,184 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:38:12,184 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:38:12,185 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:38:12,185 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:38:12,186 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:38:12,186 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_92222bed-faec-46e1-a6ab-92767d1b980c/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-11-23 02:38:12,199 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:38:12,199 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:38:12,200 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:38:12,200 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:38:12,200 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 02:38:12,201 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 02:38:12,201 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 02:38:12,201 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 02:38:12,201 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 02:38:12,201 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 02:38:12,201 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 02:38:12,202 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 02:38:12,202 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 02:38:12,202 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:38:12,203 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 02:38:12,203 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:38:12,203 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:38:12,203 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:38:12,204 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:38:12,205 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:38:12,205 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 02:38:12,205 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:38:12,205 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:38:12,205 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:38:12,206 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:38:12,206 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:38:12,206 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:38:12,206 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:38:12,206 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:38:12,206 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:38:12,207 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:38:12,207 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:38:12,207 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 02:38:12,207 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:38:12,207 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:38:12,207 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 02:38:12,208 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_92222bed-faec-46e1-a6ab-92767d1b980c/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 -> 458defa6989fd07c9ad90ba734f631bc16cdc88e [2018-11-23 02:38:12,236 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:38:12,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:38:12,250 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:38:12,251 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:38:12,251 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:38:12,252 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_92222bed-faec-46e1-a6ab-92767d1b980c/bin-2019/utaipan/../../sv-benchmarks/c/signedintegeroverflow-regression/PrefixIncrement_false-no-overflow.c.i [2018-11-23 02:38:12,305 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_92222bed-faec-46e1-a6ab-92767d1b980c/bin-2019/utaipan/data/08cf33ae9/1280759520fd4eb785ed17d88dd32a3d/FLAG28b09a776 [2018-11-23 02:38:12,684 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:38:12,684 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_92222bed-faec-46e1-a6ab-92767d1b980c/sv-benchmarks/c/signedintegeroverflow-regression/PrefixIncrement_false-no-overflow.c.i [2018-11-23 02:38:12,692 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_92222bed-faec-46e1-a6ab-92767d1b980c/bin-2019/utaipan/data/08cf33ae9/1280759520fd4eb785ed17d88dd32a3d/FLAG28b09a776 [2018-11-23 02:38:12,706 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_92222bed-faec-46e1-a6ab-92767d1b980c/bin-2019/utaipan/data/08cf33ae9/1280759520fd4eb785ed17d88dd32a3d [2018-11-23 02:38:12,709 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:38:12,710 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:38:12,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:38:12,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:38:12,715 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:38:12,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:38:12" (1/1) ... [2018-11-23 02:38:12,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@133c7a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:12, skipping insertion in model container [2018-11-23 02:38:12,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:38:12" (1/1) ... [2018-11-23 02:38:12,729 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:38:12,760 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:38:12,988 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:38:12,995 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:38:13,022 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:38:13,104 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:38:13,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:13 WrapperNode [2018-11-23 02:38:13,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:38:13,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:38:13,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:38:13,106 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:38:13,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:13" (1/1) ... [2018-11-23 02:38:13,124 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:13" (1/1) ... [2018-11-23 02:38:13,130 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:38:13,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:38:13,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:38:13,131 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:38:13,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:13" (1/1) ... [2018-11-23 02:38:13,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:13" (1/1) ... [2018-11-23 02:38:13,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:13" (1/1) ... [2018-11-23 02:38:13,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:13" (1/1) ... [2018-11-23 02:38:13,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:13" (1/1) ... [2018-11-23 02:38:13,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:13" (1/1) ... [2018-11-23 02:38:13,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:13" (1/1) ... [2018-11-23 02:38:13,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:38:13,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:38:13,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:38:13,146 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:38:13,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_92222bed-faec-46e1-a6ab-92767d1b980c/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 02:38:13,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:38:13,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:38:13,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:38:13,202 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:38:13,202 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:38:13,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 02:38:13,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:38:13,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:38:13,342 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:38:13,342 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 02:38:13,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:38:13 BoogieIcfgContainer [2018-11-23 02:38:13,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:38:13,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:38:13,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:38:13,347 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:38:13,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:38:12" (1/3) ... [2018-11-23 02:38:13,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d08d0ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:38:13, skipping insertion in model container [2018-11-23 02:38:13,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:13" (2/3) ... [2018-11-23 02:38:13,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d08d0ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:38:13, skipping insertion in model container [2018-11-23 02:38:13,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:38:13" (3/3) ... [2018-11-23 02:38:13,350 INFO L112 eAbstractionObserver]: Analyzing ICFG PrefixIncrement_false-no-overflow.c.i [2018-11-23 02:38:13,360 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:38:13,367 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-11-23 02:38:13,383 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-11-23 02:38:13,409 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:38:13,409 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:38:13,409 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:38:13,409 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:38:13,409 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:38:13,409 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:38:13,410 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:38:13,410 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:38:13,422 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-11-23 02:38:13,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 02:38:13,427 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:38:13,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:38:13,429 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:38:13,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:38:13,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1378257395, now seen corresponding path program 1 times [2018-11-23 02:38:13,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:38:13,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:38:13,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:38:13,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:38:13,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:38:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:38:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:38:13,536 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=105, |#NULL.offset|=101, |#t~string30.base|=102, |#t~string30.offset|=103, |old(#NULL.base)|=105, |old(#NULL.offset)|=101, |old(#t~string30.base)|=102, |old(#t~string30.offset)|=103] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string30.base, #t~string30.offset := #Ultimate.alloc(4);call write~init~int(37, #t~string30.base, #t~string30.offset, 1);call write~init~int(100, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(10, #t~string30.base, 2 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 3 + #t~string30.offset, 1); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string30.base|=104, |#t~string30.offset|=0, |old(#NULL.base)|=105, |old(#NULL.offset)|=101, |old(#t~string30.base)|=102, |old(#t~string30.offset)|=103] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string30.base|=104, |#t~string30.offset|=0, |old(#NULL.base)|=105, |old(#NULL.offset)|=101, |old(#t~string30.base)|=102, |old(#t~string30.offset)|=103] [?] RET #12#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string30.base|=104, |#t~string30.offset|=0] [?] CALL call #t~ret31 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string30.base|=104, |#t~string30.offset|=0] [?] ~x~0 := 2147483647; VAL [main_~x~0=2147483647, |#NULL.base|=0, |#NULL.offset|=0, |#t~string30.base|=104, |#t~string30.offset|=0] [?] assume !(1 + ~x~0 <= 2147483647); VAL [main_~x~0=2147483647, |#NULL.base|=0, |#NULL.offset|=0, |#t~string30.base|=104, |#t~string30.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=105, #NULL.offset=101, #t~string30.base=102, #t~string30.offset=103, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string30.base)=102, old(#t~string30.offset)=103] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L334] call #t~string30.base, #t~string30.offset := #Ultimate.alloc(4); [L334] call write~init~int(37, #t~string30.base, #t~string30.offset, 1); [L334] call write~init~int(100, #t~string30.base, 1 + #t~string30.offset, 1); [L334] call write~init~int(10, #t~string30.base, 2 + #t~string30.offset, 1); [L334] call write~init~int(0, #t~string30.base, 3 + #t~string30.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~string30.base=104, #t~string30.offset=0, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string30.base)=102, old(#t~string30.offset)=103] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #t~string30.base=104, #t~string30.offset=0, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string30.base)=102, old(#t~string30.offset)=103] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, #t~string30.base=104, #t~string30.offset=0] [?] CALL call #t~ret31 := main(); VAL [#NULL.base=0, #NULL.offset=0, #t~string30.base=104, #t~string30.offset=0] [L332] ~x~0 := 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~string30.base=104, #t~string30.offset=0, ~x~0=2147483647] [L333] assert 1 + ~x~0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~string30.base=104, #t~string30.offset=0, ~x~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=105, #NULL.offset=101, #t~string30.base=102, #t~string30.offset=103, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string30.base)=102, old(#t~string30.offset)=103] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L334] call #t~string30.base, #t~string30.offset := #Ultimate.alloc(4); [L334] call write~init~int(37, #t~string30.base, #t~string30.offset, 1); [L334] call write~init~int(100, #t~string30.base, 1 + #t~string30.offset, 1); [L334] call write~init~int(10, #t~string30.base, 2 + #t~string30.offset, 1); [L334] call write~init~int(0, #t~string30.base, 3 + #t~string30.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~string30.base=104, #t~string30.offset=0, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string30.base)=102, old(#t~string30.offset)=103] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #t~string30.base=104, #t~string30.offset=0, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string30.base)=102, old(#t~string30.offset)=103] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, #t~string30.base=104, #t~string30.offset=0] [?] CALL call #t~ret31 := main(); VAL [#NULL.base=0, #NULL.offset=0, #t~string30.base=104, #t~string30.offset=0] [L332] ~x~0 := 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~string30.base=104, #t~string30.offset=0, ~x~0=2147483647] [L333] assert 1 + ~x~0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~string30.base=104, #t~string30.offset=0, ~x~0=2147483647] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=105, #NULL!offset=101, #t~string30!base=102, #t~string30!offset=103, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string30!base)=102, old(#t~string30!offset)=103] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L334] FCALL call #t~string30 := #Ultimate.alloc(4); [L334] FCALL call write~init~int(37, { base: #t~string30!base, offset: #t~string30!offset }, 1); [L334] FCALL call write~init~int(100, { base: #t~string30!base, offset: 1 + #t~string30!offset }, 1); [L334] FCALL call write~init~int(10, { base: #t~string30!base, offset: 2 + #t~string30!offset }, 1); [L334] FCALL call write~init~int(0, { base: #t~string30!base, offset: 3 + #t~string30!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string30!base)=102, old(#t~string30!offset)=103] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0] [?] CALL call #t~ret31 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0] [L332] ~x~0 := 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0, ~x~0=2147483647] [L333] assert 1 + ~x~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0, ~x~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=105, #NULL!offset=101, #t~string30!base=102, #t~string30!offset=103, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string30!base)=102, old(#t~string30!offset)=103] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L334] FCALL call #t~string30 := #Ultimate.alloc(4); [L334] FCALL call write~init~int(37, { base: #t~string30!base, offset: #t~string30!offset }, 1); [L334] FCALL call write~init~int(100, { base: #t~string30!base, offset: 1 + #t~string30!offset }, 1); [L334] FCALL call write~init~int(10, { base: #t~string30!base, offset: 2 + #t~string30!offset }, 1); [L334] FCALL call write~init~int(0, { base: #t~string30!base, offset: 3 + #t~string30!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string30!base)=102, old(#t~string30!offset)=103] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0] [?] CALL call #t~ret31 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0] [L332] ~x~0 := 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0, ~x~0=2147483647] [L333] assert 1 + ~x~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0, ~x~0=2147483647] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=105, #NULL!offset=101, #t~string30!base=102, #t~string30!offset=103, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string30!base)=102, old(#t~string30!offset)=103] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L334] FCALL call #t~string30 := #Ultimate.alloc(4); [L334] FCALL call write~init~int(37, { base: #t~string30!base, offset: #t~string30!offset }, 1); [L334] FCALL call write~init~int(100, { base: #t~string30!base, offset: 1 + #t~string30!offset }, 1); [L334] FCALL call write~init~int(10, { base: #t~string30!base, offset: 2 + #t~string30!offset }, 1); [L334] FCALL call write~init~int(0, { base: #t~string30!base, offset: 3 + #t~string30!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string30!base)=102, old(#t~string30!offset)=103] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0] [?] CALL call #t~ret31 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0] [L332] ~x~0 := 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0, ~x~0=2147483647] [L333] assert 1 + ~x~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0, ~x~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=105, #NULL!offset=101, #t~string30!base=102, #t~string30!offset=103, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string30!base)=102, old(#t~string30!offset)=103] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L334] FCALL call #t~string30 := #Ultimate.alloc(4); [L334] FCALL call write~init~int(37, { base: #t~string30!base, offset: #t~string30!offset }, 1); [L334] FCALL call write~init~int(100, { base: #t~string30!base, offset: 1 + #t~string30!offset }, 1); [L334] FCALL call write~init~int(10, { base: #t~string30!base, offset: 2 + #t~string30!offset }, 1); [L334] FCALL call write~init~int(0, { base: #t~string30!base, offset: 3 + #t~string30!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string30!base)=102, old(#t~string30!offset)=103] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0] [?] CALL call #t~ret31 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0] [L332] ~x~0 := 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0, ~x~0=2147483647] [L333] assert 1 + ~x~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0, ~x~0=2147483647] [L332] int x = 2147483647; VAL [x=2147483647] [L333] ++x VAL [x=2147483647] ----- [2018-11-23 02:38:13,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:38:13 BoogieIcfgContainer [2018-11-23 02:38:13,566 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:38:13,567 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:38:13,567 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:38:13,567 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:38:13,568 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:38:13" (3/4) ... [2018-11-23 02:38:13,569 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|=105, |#NULL.offset|=101, |#t~string30.base|=102, |#t~string30.offset|=103, |old(#NULL.base)|=105, |old(#NULL.offset)|=101, |old(#t~string30.base)|=102, |old(#t~string30.offset)|=103] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string30.base, #t~string30.offset := #Ultimate.alloc(4);call write~init~int(37, #t~string30.base, #t~string30.offset, 1);call write~init~int(100, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(10, #t~string30.base, 2 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 3 + #t~string30.offset, 1); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string30.base|=104, |#t~string30.offset|=0, |old(#NULL.base)|=105, |old(#NULL.offset)|=101, |old(#t~string30.base)|=102, |old(#t~string30.offset)|=103] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string30.base|=104, |#t~string30.offset|=0, |old(#NULL.base)|=105, |old(#NULL.offset)|=101, |old(#t~string30.base)|=102, |old(#t~string30.offset)|=103] [?] RET #12#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string30.base|=104, |#t~string30.offset|=0] [?] CALL call #t~ret31 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string30.base|=104, |#t~string30.offset|=0] [?] ~x~0 := 2147483647; VAL [main_~x~0=2147483647, |#NULL.base|=0, |#NULL.offset|=0, |#t~string30.base|=104, |#t~string30.offset|=0] [?] assume !(1 + ~x~0 <= 2147483647); VAL [main_~x~0=2147483647, |#NULL.base|=0, |#NULL.offset|=0, |#t~string30.base|=104, |#t~string30.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=105, #NULL.offset=101, #t~string30.base=102, #t~string30.offset=103, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string30.base)=102, old(#t~string30.offset)=103] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L334] call #t~string30.base, #t~string30.offset := #Ultimate.alloc(4); [L334] call write~init~int(37, #t~string30.base, #t~string30.offset, 1); [L334] call write~init~int(100, #t~string30.base, 1 + #t~string30.offset, 1); [L334] call write~init~int(10, #t~string30.base, 2 + #t~string30.offset, 1); [L334] call write~init~int(0, #t~string30.base, 3 + #t~string30.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~string30.base=104, #t~string30.offset=0, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string30.base)=102, old(#t~string30.offset)=103] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #t~string30.base=104, #t~string30.offset=0, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string30.base)=102, old(#t~string30.offset)=103] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, #t~string30.base=104, #t~string30.offset=0] [?] CALL call #t~ret31 := main(); VAL [#NULL.base=0, #NULL.offset=0, #t~string30.base=104, #t~string30.offset=0] [L332] ~x~0 := 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~string30.base=104, #t~string30.offset=0, ~x~0=2147483647] [L333] assert 1 + ~x~0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~string30.base=104, #t~string30.offset=0, ~x~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=105, #NULL.offset=101, #t~string30.base=102, #t~string30.offset=103, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string30.base)=102, old(#t~string30.offset)=103] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L334] call #t~string30.base, #t~string30.offset := #Ultimate.alloc(4); [L334] call write~init~int(37, #t~string30.base, #t~string30.offset, 1); [L334] call write~init~int(100, #t~string30.base, 1 + #t~string30.offset, 1); [L334] call write~init~int(10, #t~string30.base, 2 + #t~string30.offset, 1); [L334] call write~init~int(0, #t~string30.base, 3 + #t~string30.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~string30.base=104, #t~string30.offset=0, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string30.base)=102, old(#t~string30.offset)=103] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #t~string30.base=104, #t~string30.offset=0, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string30.base)=102, old(#t~string30.offset)=103] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, #t~string30.base=104, #t~string30.offset=0] [?] CALL call #t~ret31 := main(); VAL [#NULL.base=0, #NULL.offset=0, #t~string30.base=104, #t~string30.offset=0] [L332] ~x~0 := 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~string30.base=104, #t~string30.offset=0, ~x~0=2147483647] [L333] assert 1 + ~x~0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~string30.base=104, #t~string30.offset=0, ~x~0=2147483647] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=105, #NULL!offset=101, #t~string30!base=102, #t~string30!offset=103, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string30!base)=102, old(#t~string30!offset)=103] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L334] FCALL call #t~string30 := #Ultimate.alloc(4); [L334] FCALL call write~init~int(37, { base: #t~string30!base, offset: #t~string30!offset }, 1); [L334] FCALL call write~init~int(100, { base: #t~string30!base, offset: 1 + #t~string30!offset }, 1); [L334] FCALL call write~init~int(10, { base: #t~string30!base, offset: 2 + #t~string30!offset }, 1); [L334] FCALL call write~init~int(0, { base: #t~string30!base, offset: 3 + #t~string30!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string30!base)=102, old(#t~string30!offset)=103] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0] [?] CALL call #t~ret31 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0] [L332] ~x~0 := 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0, ~x~0=2147483647] [L333] assert 1 + ~x~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0, ~x~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=105, #NULL!offset=101, #t~string30!base=102, #t~string30!offset=103, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string30!base)=102, old(#t~string30!offset)=103] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L334] FCALL call #t~string30 := #Ultimate.alloc(4); [L334] FCALL call write~init~int(37, { base: #t~string30!base, offset: #t~string30!offset }, 1); [L334] FCALL call write~init~int(100, { base: #t~string30!base, offset: 1 + #t~string30!offset }, 1); [L334] FCALL call write~init~int(10, { base: #t~string30!base, offset: 2 + #t~string30!offset }, 1); [L334] FCALL call write~init~int(0, { base: #t~string30!base, offset: 3 + #t~string30!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string30!base)=102, old(#t~string30!offset)=103] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0] [?] CALL call #t~ret31 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0] [L332] ~x~0 := 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0, ~x~0=2147483647] [L333] assert 1 + ~x~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0, ~x~0=2147483647] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=105, #NULL!offset=101, #t~string30!base=102, #t~string30!offset=103, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string30!base)=102, old(#t~string30!offset)=103] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L334] FCALL call #t~string30 := #Ultimate.alloc(4); [L334] FCALL call write~init~int(37, { base: #t~string30!base, offset: #t~string30!offset }, 1); [L334] FCALL call write~init~int(100, { base: #t~string30!base, offset: 1 + #t~string30!offset }, 1); [L334] FCALL call write~init~int(10, { base: #t~string30!base, offset: 2 + #t~string30!offset }, 1); [L334] FCALL call write~init~int(0, { base: #t~string30!base, offset: 3 + #t~string30!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string30!base)=102, old(#t~string30!offset)=103] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0] [?] CALL call #t~ret31 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0] [L332] ~x~0 := 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0, ~x~0=2147483647] [L333] assert 1 + ~x~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0, ~x~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=105, #NULL!offset=101, #t~string30!base=102, #t~string30!offset=103, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string30!base)=102, old(#t~string30!offset)=103] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L334] FCALL call #t~string30 := #Ultimate.alloc(4); [L334] FCALL call write~init~int(37, { base: #t~string30!base, offset: #t~string30!offset }, 1); [L334] FCALL call write~init~int(100, { base: #t~string30!base, offset: 1 + #t~string30!offset }, 1); [L334] FCALL call write~init~int(10, { base: #t~string30!base, offset: 2 + #t~string30!offset }, 1); [L334] FCALL call write~init~int(0, { base: #t~string30!base, offset: 3 + #t~string30!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string30!base)=102, old(#t~string30!offset)=103] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0] [?] CALL call #t~ret31 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0] [L332] ~x~0 := 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0, ~x~0=2147483647] [L333] assert 1 + ~x~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string30!base=104, #t~string30!offset=0, ~x~0=2147483647] [L332] int x = 2147483647; VAL [x=2147483647] [L333] ++x VAL [x=2147483647] ----- [2018-11-23 02:38:13,606 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_92222bed-faec-46e1-a6ab-92767d1b980c/bin-2019/utaipan/witness.graphml [2018-11-23 02:38:13,607 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:38:13,607 INFO L168 Benchmark]: Toolchain (without parser) took 898.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.1 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-23 02:38:13,609 INFO L168 Benchmark]: CDTParser took 0.18 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 02:38:13,609 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.1 MB). Free memory was 957.5 MB in the beginning and 1.2 GB in the end (delta: -208.9 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-11-23 02:38:13,610 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-23 02:38:13,610 INFO L168 Benchmark]: Boogie Preprocessor took 14.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:38:13,611 INFO L168 Benchmark]: RCFGBuilder took 197.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:38:13,611 INFO L168 Benchmark]: TraceAbstraction took 222.35 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: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2018-11-23 02:38:13,612 INFO L168 Benchmark]: Witness Printer took 39.97 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-23 02:38:13,615 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.18 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 394.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.1 MB). Free memory was 957.5 MB in the beginning and 1.2 GB in the end (delta: -208.9 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 197.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 222.35 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: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * Witness Printer took 39.97 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: 3.2 MB). Peak memory consumption was 3.2 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 x = 2147483647; VAL [x=2147483647] [L333] ++x VAL [x=2147483647] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 14 locations, 2 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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...