./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/cstrncmp_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_f9ff375b-e388-43eb-99e3-fa6285484cde/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f9ff375b-e388-43eb-99e3-fa6285484cde/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f9ff375b-e388-43eb-99e3-fa6285484cde/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f9ff375b-e388-43eb-99e3-fa6285484cde/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/cstrncmp_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f9ff375b-e388-43eb-99e3-fa6285484cde/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f9ff375b-e388-43eb-99e3-fa6285484cde/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 01bf3c13fb8dbd0777aa4be7a3e595427bd1de37 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-22 22:29:39,616 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:29:39,618 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:29:39,627 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:29:39,628 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:29:39,628 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:29:39,629 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:29:39,631 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:29:39,632 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:29:39,632 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:29:39,633 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:29:39,633 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:29:39,634 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:29:39,635 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:29:39,636 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:29:39,636 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:29:39,637 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:29:39,638 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:29:39,639 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:29:39,640 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:29:39,641 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:29:39,642 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:29:39,643 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:29:39,644 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:29:39,644 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:29:39,644 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:29:39,645 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:29:39,646 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:29:39,646 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:29:39,647 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:29:39,647 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:29:39,648 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:29:39,648 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:29:39,648 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:29:39,649 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:29:39,649 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:29:39,650 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f9ff375b-e388-43eb-99e3-fa6285484cde/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-22 22:29:39,659 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:29:39,660 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:29:39,660 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 22:29:39,660 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 22:29:39,661 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:29:39,661 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:29:39,661 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 22:29:39,661 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:29:39,662 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 22:29:39,662 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:29:39,662 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:29:39,662 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 22:29:39,662 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 22:29:39,662 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 22:29:39,662 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-22 22:29:39,663 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:29:39,663 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:29:39,663 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 22:29:39,663 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:29:39,663 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:29:39,663 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 22:29:39,663 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 22:29:39,663 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 22:29:39,664 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:29:39,664 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 22:29:39,664 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 22:29:39,664 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 22:29:39,664 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 22:29:39,664 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 22:29:39,664 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_f9ff375b-e388-43eb-99e3-fa6285484cde/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 01bf3c13fb8dbd0777aa4be7a3e595427bd1de37 [2018-11-22 22:29:39,693 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:29:39,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:29:39,705 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:29:39,706 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:29:39,707 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:29:39,707 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f9ff375b-e388-43eb-99e3-fa6285484cde/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/cstrncmp_false-no-overflow.c [2018-11-22 22:29:39,744 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f9ff375b-e388-43eb-99e3-fa6285484cde/bin-2019/uautomizer/data/bf6c5f98d/73b186fb6bb04ac19e012cca8adbf510/FLAG42833f4e9 [2018-11-22 22:29:40,148 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:29:40,148 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f9ff375b-e388-43eb-99e3-fa6285484cde/sv-benchmarks/c/termination-crafted-lit/cstrncmp_false-no-overflow.c [2018-11-22 22:29:40,152 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f9ff375b-e388-43eb-99e3-fa6285484cde/bin-2019/uautomizer/data/bf6c5f98d/73b186fb6bb04ac19e012cca8adbf510/FLAG42833f4e9 [2018-11-22 22:29:40,160 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f9ff375b-e388-43eb-99e3-fa6285484cde/bin-2019/uautomizer/data/bf6c5f98d/73b186fb6bb04ac19e012cca8adbf510 [2018-11-22 22:29:40,162 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:29:40,163 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:29:40,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:29:40,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:29:40,167 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:29:40,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:29:40" (1/1) ... [2018-11-22 22:29:40,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c2c4690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:40, skipping insertion in model container [2018-11-22 22:29:40,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:29:40" (1/1) ... [2018-11-22 22:29:40,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:29:40,192 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:29:40,311 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:29:40,317 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:29:40,330 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:29:40,339 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:29:40,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:40 WrapperNode [2018-11-22 22:29:40,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:29:40,340 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:29:40,340 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:29:40,340 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:29:40,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:40" (1/1) ... [2018-11-22 22:29:40,351 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:40" (1/1) ... [2018-11-22 22:29:40,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:29:40,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:29:40,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:29:40,355 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:29:40,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:40" (1/1) ... [2018-11-22 22:29:40,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:40" (1/1) ... [2018-11-22 22:29:40,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:40" (1/1) ... [2018-11-22 22:29:40,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:40" (1/1) ... [2018-11-22 22:29:40,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:40" (1/1) ... [2018-11-22 22:29:40,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:40" (1/1) ... [2018-11-22 22:29:40,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:40" (1/1) ... [2018-11-22 22:29:40,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:29:40,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:29:40,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:29:40,409 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:29:40,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9ff375b-e388-43eb-99e3-fa6285484cde/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 22:29:40,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 22:29:40,443 INFO L130 BoogieDeclarations]: Found specification of procedure build_nondet_String [2018-11-22 22:29:40,443 INFO L138 BoogieDeclarations]: Found implementation of procedure build_nondet_String [2018-11-22 22:29:40,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 22:29:40,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 22:29:40,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 22:29:40,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:29:40,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:29:40,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 22:29:40,443 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 22:29:40,443 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 22:29:40,443 INFO L130 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-11-22 22:29:40,443 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-11-22 22:29:40,600 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:29:40,600 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-22 22:29:40,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:29:40 BoogieIcfgContainer [2018-11-22 22:29:40,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:29:40,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 22:29:40,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 22:29:40,603 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 22:29:40,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:29:40" (1/3) ... [2018-11-22 22:29:40,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4eeb06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:29:40, skipping insertion in model container [2018-11-22 22:29:40,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:40" (2/3) ... [2018-11-22 22:29:40,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4eeb06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:29:40, skipping insertion in model container [2018-11-22 22:29:40,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:29:40" (3/3) ... [2018-11-22 22:29:40,606 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrncmp_false-no-overflow.c [2018-11-22 22:29:40,612 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 22:29:40,616 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-22 22:29:40,629 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-22 22:29:40,647 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:29:40,648 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 22:29:40,648 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 22:29:40,648 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 22:29:40,648 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:29:40,648 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:29:40,648 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 22:29:40,648 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:29:40,648 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 22:29:40,660 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-22 22:29:40,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-22 22:29:40,664 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:29:40,664 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:29:40,666 INFO L423 AbstractCegarLoop]: === Iteration 1 === [build_nondet_StringErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, build_nondet_StringErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, build_nondet_StringErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, build_nondet_StringErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, cstrncmpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, cstrncmpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:29:40,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:29:40,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1438395105, now seen corresponding path program 1 times [2018-11-22 22:29:40,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:29:40,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:29:40,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:29:40,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:29:40,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:29:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:29:40,775 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-22 22:29:40,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:29:40,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:29:40,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:29:40,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:29:40,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:29:40,790 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-11-22 22:29:40,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:29:40,834 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-11-22 22:29:40,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:29:40,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-22 22:29:40,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:29:40,842 INFO L225 Difference]: With dead ends: 60 [2018-11-22 22:29:40,842 INFO L226 Difference]: Without dead ends: 38 [2018-11-22 22:29:40,844 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-22 22:29:40,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-22 22:29:40,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-11-22 22:29:40,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-22 22:29:40,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-11-22 22:29:40,869 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 9 [2018-11-22 22:29:40,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:29:40,870 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-22 22:29:40,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:29:40,870 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-11-22 22:29:40,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-22 22:29:40,870 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:29:40,870 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:29:40,870 INFO L423 AbstractCegarLoop]: === Iteration 2 === [build_nondet_StringErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, build_nondet_StringErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, build_nondet_StringErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, build_nondet_StringErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, cstrncmpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, cstrncmpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:29:40,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:29:40,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1438395167, now seen corresponding path program 1 times [2018-11-22 22:29:40,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:29:40,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:29:40,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:29:40,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:29:40,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:29:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:29:40,895 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-22 22:29:40,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:29:40,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:29:40,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:29:40,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:29:40,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:29:40,897 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 3 states. [2018-11-22 22:29:40,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:29:40,919 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-22 22:29:40,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:29:40,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-22 22:29:40,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:29:40,921 INFO L225 Difference]: With dead ends: 35 [2018-11-22 22:29:40,921 INFO L226 Difference]: Without dead ends: 33 [2018-11-22 22:29:40,922 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-22 22:29:40,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-22 22:29:40,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-11-22 22:29:40,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-22 22:29:40,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-22 22:29:40,926 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 9 [2018-11-22 22:29:40,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:29:40,927 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-22 22:29:40,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:29:40,927 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-22 22:29:40,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-22 22:29:40,927 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:29:40,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:29:40,928 INFO L423 AbstractCegarLoop]: === Iteration 3 === [build_nondet_StringErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, build_nondet_StringErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, build_nondet_StringErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, build_nondet_StringErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, cstrncmpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, cstrncmpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:29:40,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:29:40,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1640575335, now seen corresponding path program 1 times [2018-11-22 22:29:40,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:29:40,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:29:40,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:29:40,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:29:40,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:29:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:29:40,951 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-22 22:29:40,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:29:40,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:29:40,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:29:40,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:29:40,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:29:40,953 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 3 states. [2018-11-22 22:29:40,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:29:40,973 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-22 22:29:40,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:29:40,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-22 22:29:40,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:29:40,975 INFO L225 Difference]: With dead ends: 30 [2018-11-22 22:29:40,975 INFO L226 Difference]: Without dead ends: 28 [2018-11-22 22:29:40,975 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-22 22:29:40,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-22 22:29:40,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-22 22:29:40,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-22 22:29:40,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-22 22:29:40,980 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 10 [2018-11-22 22:29:40,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:29:40,980 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-22 22:29:40,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:29:40,980 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-22 22:29:40,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-22 22:29:40,981 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:29:40,981 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:29:40,982 INFO L423 AbstractCegarLoop]: === Iteration 4 === [build_nondet_StringErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, build_nondet_StringErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, build_nondet_StringErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, build_nondet_StringErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, cstrncmpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, cstrncmpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:29:40,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:29:40,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1712546513, now seen corresponding path program 1 times [2018-11-22 22:29:40,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:29:40,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:29:40,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:29:40,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:29:40,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:29:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:29:41,070 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-22 22:29:41,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:29:41,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 22:29:41,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 22:29:41,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 22:29:41,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:29:41,072 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2018-11-22 22:29:41,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:29:41,120 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-22 22:29:41,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 22:29:41,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-11-22 22:29:41,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:29:41,122 INFO L225 Difference]: With dead ends: 28 [2018-11-22 22:29:41,122 INFO L226 Difference]: Without dead ends: 27 [2018-11-22 22:29:41,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-22 22:29:41,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-22 22:29:41,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-22 22:29:41,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-22 22:29:41,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-22 22:29:41,127 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 29 [2018-11-22 22:29:41,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:29:41,128 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-22 22:29:41,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 22:29:41,128 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-22 22:29:41,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-22 22:29:41,128 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:29:41,128 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:29:41,129 INFO L423 AbstractCegarLoop]: === Iteration 5 === [build_nondet_StringErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, build_nondet_StringErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, build_nondet_StringErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, build_nondet_StringErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, cstrncmpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, cstrncmpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:29:41,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:29:41,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1549334281, now seen corresponding path program 1 times [2018-11-22 22:29:41,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:29:41,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:29:41,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:29:41,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:29:41,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:29:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:29:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:29:41,179 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=5, |#NULL.offset|=2, |old(#NULL.base)|=5, |old(#NULL.offset)|=2] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=5, |old(#NULL.offset)|=2] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=5, |old(#NULL.offset)|=2] [?] RET #75#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret17 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret13.base, #t~ret13.offset := build_nondet_String(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~length~0 := #t~nondet0;havoc #t~nondet0; VAL [build_nondet_String_~length~0=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume ~length~0 < 1;~length~0 := 1; VAL [build_nondet_String_~length~0=1, |#NULL.base|=0, |#NULL.offset|=0] [?] assume ~length~0 <= 2147483647; VAL [build_nondet_String_~length~0=1, |#NULL.base|=0, |#NULL.offset|=0] [?] assume ~length~0 >= -2147483648;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(~length~0);~nondetString~0.base, ~nondetString~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [build_nondet_String_~length~0=1, build_nondet_String_~nondetString~0.base=3, build_nondet_String_~nondetString~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |build_nondet_String_#t~malloc1.base|=3, |build_nondet_String_#t~malloc1.offset|=0] [?] assume ~length~0 - 1 <= 2147483647; VAL [build_nondet_String_~length~0=1, build_nondet_String_~nondetString~0.base=3, build_nondet_String_~nondetString~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |build_nondet_String_#t~malloc1.base|=3, |build_nondet_String_#t~malloc1.offset|=0] [?] assume ~length~0 - 1 >= -2147483648;call write~int(0, ~nondetString~0.base, ~nondetString~0.offset + (~length~0 - 1), 1);#res.base, #res.offset := ~nondetString~0.base, ~nondetString~0.offset; VAL [build_nondet_String_~length~0=1, build_nondet_String_~nondetString~0.base=3, build_nondet_String_~nondetString~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |build_nondet_String_#res.base|=3, |build_nondet_String_#res.offset|=0, |build_nondet_String_#t~malloc1.base|=3, |build_nondet_String_#t~malloc1.offset|=0] [?] assume true; VAL [build_nondet_String_~length~0=1, build_nondet_String_~nondetString~0.base=3, build_nondet_String_~nondetString~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |build_nondet_String_#res.base|=3, |build_nondet_String_#res.offset|=0, |build_nondet_String_#t~malloc1.base|=3, |build_nondet_String_#t~malloc1.offset|=0] [?] RET #79#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret13.base|=3, |main_#t~ret13.offset|=0] [?] CALL call #t~ret14.base, #t~ret14.offset := build_nondet_String(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~length~0 := #t~nondet0;havoc #t~nondet0; VAL [build_nondet_String_~length~0=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume ~length~0 < 1;~length~0 := 1; VAL [build_nondet_String_~length~0=1, |#NULL.base|=0, |#NULL.offset|=0] [?] assume ~length~0 <= 2147483647; VAL [build_nondet_String_~length~0=1, |#NULL.base|=0, |#NULL.offset|=0] [?] assume ~length~0 >= -2147483648;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(~length~0);~nondetString~0.base, ~nondetString~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [build_nondet_String_~length~0=1, build_nondet_String_~nondetString~0.base=4, build_nondet_String_~nondetString~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |build_nondet_String_#t~malloc1.base|=4, |build_nondet_String_#t~malloc1.offset|=0] [?] assume ~length~0 - 1 <= 2147483647; VAL [build_nondet_String_~length~0=1, build_nondet_String_~nondetString~0.base=4, build_nondet_String_~nondetString~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |build_nondet_String_#t~malloc1.base|=4, |build_nondet_String_#t~malloc1.offset|=0] [?] assume ~length~0 - 1 >= -2147483648;call write~int(0, ~nondetString~0.base, ~nondetString~0.offset + (~length~0 - 1), 1);#res.base, #res.offset := ~nondetString~0.base, ~nondetString~0.offset; VAL [build_nondet_String_~length~0=1, build_nondet_String_~nondetString~0.base=4, build_nondet_String_~nondetString~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |build_nondet_String_#res.base|=4, |build_nondet_String_#res.offset|=0, |build_nondet_String_#t~malloc1.base|=4, |build_nondet_String_#t~malloc1.offset|=0] [?] assume true; VAL [build_nondet_String_~length~0=1, build_nondet_String_~nondetString~0.base=4, build_nondet_String_~nondetString~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |build_nondet_String_#res.base|=4, |build_nondet_String_#res.offset|=0, |build_nondet_String_#t~malloc1.base|=4, |build_nondet_String_#t~malloc1.offset|=0] [?] RET #81#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret13.base|=3, |main_#t~ret13.offset|=0, |main_#t~ret14.base|=4, |main_#t~ret14.offset|=0] [?] assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~nondet15|=(- 2147483648), |main_#t~ret13.base|=3, |main_#t~ret13.offset|=0, |main_#t~ret14.base|=4, |main_#t~ret14.offset|=0] [?] CALL call #t~ret16 := cstrncmp(#t~ret13.base, #t~ret13.offset, #t~ret14.base, #t~ret14.offset, #t~nondet15); VAL [|#NULL.base|=0, |#NULL.offset|=0, |cstrncmp_#in~n|=(- 2147483648), |cstrncmp_#in~s1.base|=3, |cstrncmp_#in~s1.offset|=0, |cstrncmp_#in~s2.base|=4, |cstrncmp_#in~s2.offset|=0] [?] ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~s2.base, ~s2.offset := #in~s2.base, #in~s2.offset;~n := #in~n;havoc ~uc1~0;havoc ~uc2~0; VAL [cstrncmp_~n=(- 2147483648), cstrncmp_~s1.base=3, cstrncmp_~s1.offset=0, cstrncmp_~s2.base=4, cstrncmp_~s2.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |cstrncmp_#in~n|=(- 2147483648), |cstrncmp_#in~s1.base|=3, |cstrncmp_#in~s1.offset|=0, |cstrncmp_#in~s2.base|=4, |cstrncmp_#in~s2.offset|=0] [?] assume !(0 == ~n); VAL [cstrncmp_~n=(- 2147483648), cstrncmp_~s1.base=3, cstrncmp_~s1.offset=0, cstrncmp_~s2.base=4, cstrncmp_~s2.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |cstrncmp_#in~n|=(- 2147483648), |cstrncmp_#in~s1.base|=3, |cstrncmp_#in~s1.offset|=0, |cstrncmp_#in~s2.base|=4, |cstrncmp_#in~s2.offset|=0] [?] #t~post2 := ~n; VAL [cstrncmp_~n=(- 2147483648), cstrncmp_~s1.base=3, cstrncmp_~s1.offset=0, cstrncmp_~s2.base=4, cstrncmp_~s2.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |cstrncmp_#in~n|=(- 2147483648), |cstrncmp_#in~s1.base|=3, |cstrncmp_#in~s1.offset|=0, |cstrncmp_#in~s2.base|=4, |cstrncmp_#in~s2.offset|=0, |cstrncmp_#t~post2|=(- 2147483648)] [?] assume #t~post2 - 1 <= 2147483647; VAL [cstrncmp_~n=(- 2147483648), cstrncmp_~s1.base=3, cstrncmp_~s1.offset=0, cstrncmp_~s2.base=4, cstrncmp_~s2.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |cstrncmp_#in~n|=(- 2147483648), |cstrncmp_#in~s1.base|=3, |cstrncmp_#in~s1.offset|=0, |cstrncmp_#in~s2.base|=4, |cstrncmp_#in~s2.offset|=0, |cstrncmp_#t~post2|=(- 2147483648)] [?] assume !(#t~post2 - 1 >= -2147483648); VAL [cstrncmp_~n=(- 2147483648), cstrncmp_~s1.base=3, cstrncmp_~s1.offset=0, cstrncmp_~s2.base=4, cstrncmp_~s2.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |cstrncmp_#in~n|=(- 2147483648), |cstrncmp_#in~s1.base|=3, |cstrncmp_#in~s1.offset|=0, |cstrncmp_#in~s2.base|=4, |cstrncmp_#in~s2.offset|=0, |cstrncmp_#t~post2|=(- 2147483648)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5, #NULL.offset=2, old(#NULL.base)=5, old(#NULL.offset)=2] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=2] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L47] CALL call #t~ret13.base, #t~ret13.offset := build_nondet_String(); VAL [#NULL.base=0, #NULL.offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~length~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, ~length~0=0] [L14-L16] assume ~length~0 < 1; [L15] ~length~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, ~length~0=1] [L17] assert ~length~0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, ~length~0=1] [L17] assert ~length~0 >= -2147483648; [L17] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(~length~0); [L17] ~nondetString~0.base, ~nondetString~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=3, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=3, ~nondetString~0.offset=0] [L18] assert ~length~0 - 1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=3, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=3, ~nondetString~0.offset=0] [L18] assert ~length~0 - 1 >= -2147483648; [L18] call write~int(0, ~nondetString~0.base, ~nondetString~0.offset + (~length~0 - 1), 1); [L19] #res.base, #res.offset := ~nondetString~0.base, ~nondetString~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=3, #res.offset=0, #t~malloc1.base=3, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=3, ~nondetString~0.offset=0] [L12-L20] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=3, #res.offset=0, #t~malloc1.base=3, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=3, ~nondetString~0.offset=0] [L47] RET call #t~ret13.base, #t~ret13.offset := build_nondet_String(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret13.base=3, #t~ret13.offset=0] [L47] CALL call #t~ret14.base, #t~ret14.offset := build_nondet_String(); VAL [#NULL.base=0, #NULL.offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~length~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, ~length~0=0] [L14-L16] assume ~length~0 < 1; [L15] ~length~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, ~length~0=1] [L17] assert ~length~0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, ~length~0=1] [L17] assert ~length~0 >= -2147483648; [L17] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(~length~0); [L17] ~nondetString~0.base, ~nondetString~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=4, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=4, ~nondetString~0.offset=0] [L18] assert ~length~0 - 1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=4, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=4, ~nondetString~0.offset=0] [L18] assert ~length~0 - 1 >= -2147483648; [L18] call write~int(0, ~nondetString~0.base, ~nondetString~0.offset + (~length~0 - 1), 1); [L19] #res.base, #res.offset := ~nondetString~0.base, ~nondetString~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=4, #res.offset=0, #t~malloc1.base=4, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=4, ~nondetString~0.offset=0] [L12-L20] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=4, #res.offset=0, #t~malloc1.base=4, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=4, ~nondetString~0.offset=0] [L47] RET call #t~ret14.base, #t~ret14.offset := build_nondet_String(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret13.base=3, #t~ret13.offset=0, #t~ret14.base=4, #t~ret14.offset=0] [L47] assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet15=-2147483648, #t~ret13.base=3, #t~ret13.offset=0, #t~ret14.base=4, #t~ret14.offset=0] [L47] CALL call #t~ret16 := cstrncmp(#t~ret13.base, #t~ret13.offset, #t~ret14.base, #t~ret14.offset, #t~nondet15); VAL [#in~n=-2147483648, #in~s1.base=3, #in~s1.offset=0, #in~s2.base=4, #in~s2.offset=0, #NULL.base=0, #NULL.offset=0] [L26-L44] ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset; [L26-L44] ~s2.base, ~s2.offset := #in~s2.base, #in~s2.offset; [L26-L44] ~n := #in~n; [L28] havoc ~uc1~0; [L28] havoc ~uc2~0; VAL [#in~n=-2147483648, #in~s1.base=3, #in~s1.offset=0, #in~s2.base=4, #in~s2.offset=0, #NULL.base=0, #NULL.offset=0, ~n=-2147483648, ~s1.base=3, ~s1.offset=0, ~s2.base=4, ~s2.offset=0] [L30-L31] assume !(0 == ~n); VAL [#in~n=-2147483648, #in~s1.base=3, #in~s1.offset=0, #in~s2.base=4, #in~s2.offset=0, #NULL.base=0, #NULL.offset=0, ~n=-2147483648, ~s1.base=3, ~s1.offset=0, ~s2.base=4, ~s2.offset=0] [L33] #t~post2 := ~n; VAL [#in~n=-2147483648, #in~s1.base=3, #in~s1.offset=0, #in~s2.base=4, #in~s2.offset=0, #NULL.base=0, #NULL.offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1.base=3, ~s1.offset=0, ~s2.base=4, ~s2.offset=0] [L33] assert #t~post2 - 1 <= 2147483647; VAL [#in~n=-2147483648, #in~s1.base=3, #in~s1.offset=0, #in~s2.base=4, #in~s2.offset=0, #NULL.base=0, #NULL.offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1.base=3, ~s1.offset=0, ~s2.base=4, ~s2.offset=0] [L33] assert #t~post2 - 1 >= -2147483648; VAL [#in~n=-2147483648, #in~s1.base=3, #in~s1.offset=0, #in~s2.base=4, #in~s2.offset=0, #NULL.base=0, #NULL.offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1.base=3, ~s1.offset=0, ~s2.base=4, ~s2.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5, #NULL.offset=2, old(#NULL.base)=5, old(#NULL.offset)=2] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=2] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L47] CALL call #t~ret13.base, #t~ret13.offset := build_nondet_String(); VAL [#NULL.base=0, #NULL.offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~length~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, ~length~0=0] [L14-L16] assume ~length~0 < 1; [L15] ~length~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, ~length~0=1] [L17] assert ~length~0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, ~length~0=1] [L17] assert ~length~0 >= -2147483648; [L17] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(~length~0); [L17] ~nondetString~0.base, ~nondetString~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=3, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=3, ~nondetString~0.offset=0] [L18] assert ~length~0 - 1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=3, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=3, ~nondetString~0.offset=0] [L18] assert ~length~0 - 1 >= -2147483648; [L18] call write~int(0, ~nondetString~0.base, ~nondetString~0.offset + (~length~0 - 1), 1); [L19] #res.base, #res.offset := ~nondetString~0.base, ~nondetString~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=3, #res.offset=0, #t~malloc1.base=3, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=3, ~nondetString~0.offset=0] [L12-L20] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=3, #res.offset=0, #t~malloc1.base=3, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=3, ~nondetString~0.offset=0] [L47] RET call #t~ret13.base, #t~ret13.offset := build_nondet_String(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret13.base=3, #t~ret13.offset=0] [L47] CALL call #t~ret14.base, #t~ret14.offset := build_nondet_String(); VAL [#NULL.base=0, #NULL.offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~length~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, ~length~0=0] [L14-L16] assume ~length~0 < 1; [L15] ~length~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, ~length~0=1] [L17] assert ~length~0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, ~length~0=1] [L17] assert ~length~0 >= -2147483648; [L17] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(~length~0); [L17] ~nondetString~0.base, ~nondetString~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=4, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=4, ~nondetString~0.offset=0] [L18] assert ~length~0 - 1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=4, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=4, ~nondetString~0.offset=0] [L18] assert ~length~0 - 1 >= -2147483648; [L18] call write~int(0, ~nondetString~0.base, ~nondetString~0.offset + (~length~0 - 1), 1); [L19] #res.base, #res.offset := ~nondetString~0.base, ~nondetString~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=4, #res.offset=0, #t~malloc1.base=4, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=4, ~nondetString~0.offset=0] [L12-L20] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=4, #res.offset=0, #t~malloc1.base=4, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=4, ~nondetString~0.offset=0] [L47] RET call #t~ret14.base, #t~ret14.offset := build_nondet_String(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret13.base=3, #t~ret13.offset=0, #t~ret14.base=4, #t~ret14.offset=0] [L47] assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet15=-2147483648, #t~ret13.base=3, #t~ret13.offset=0, #t~ret14.base=4, #t~ret14.offset=0] [L47] CALL call #t~ret16 := cstrncmp(#t~ret13.base, #t~ret13.offset, #t~ret14.base, #t~ret14.offset, #t~nondet15); VAL [#in~n=-2147483648, #in~s1.base=3, #in~s1.offset=0, #in~s2.base=4, #in~s2.offset=0, #NULL.base=0, #NULL.offset=0] [L26-L44] ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset; [L26-L44] ~s2.base, ~s2.offset := #in~s2.base, #in~s2.offset; [L26-L44] ~n := #in~n; [L28] havoc ~uc1~0; [L28] havoc ~uc2~0; VAL [#in~n=-2147483648, #in~s1.base=3, #in~s1.offset=0, #in~s2.base=4, #in~s2.offset=0, #NULL.base=0, #NULL.offset=0, ~n=-2147483648, ~s1.base=3, ~s1.offset=0, ~s2.base=4, ~s2.offset=0] [L30-L31] assume !(0 == ~n); VAL [#in~n=-2147483648, #in~s1.base=3, #in~s1.offset=0, #in~s2.base=4, #in~s2.offset=0, #NULL.base=0, #NULL.offset=0, ~n=-2147483648, ~s1.base=3, ~s1.offset=0, ~s2.base=4, ~s2.offset=0] [L33] #t~post2 := ~n; VAL [#in~n=-2147483648, #in~s1.base=3, #in~s1.offset=0, #in~s2.base=4, #in~s2.offset=0, #NULL.base=0, #NULL.offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1.base=3, ~s1.offset=0, ~s2.base=4, ~s2.offset=0] [L33] assert #t~post2 - 1 <= 2147483647; VAL [#in~n=-2147483648, #in~s1.base=3, #in~s1.offset=0, #in~s2.base=4, #in~s2.offset=0, #NULL.base=0, #NULL.offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1.base=3, ~s1.offset=0, ~s2.base=4, ~s2.offset=0] [L33] assert #t~post2 - 1 >= -2147483648; VAL [#in~n=-2147483648, #in~s1.base=3, #in~s1.offset=0, #in~s2.base=4, #in~s2.offset=0, #NULL.base=0, #NULL.offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1.base=3, ~s1.offset=0, ~s2.base=4, ~s2.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=2, old(#NULL!base)=5, old(#NULL!offset)=2] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L47] CALL call #t~ret13 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~length~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=0] [L14] COND TRUE ~length~0 < 1 [L15] ~length~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 >= -2147483648; [L17] FCALL call #t~malloc1 := #Ultimate.alloc(~length~0); [L17] ~nondetString~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=3, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=3, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=3, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=3, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 >= -2147483648; [L18] FCALL call write~int(0, { base: ~nondetString~0!base, offset: ~nondetString~0!offset + (~length~0 - 1) }, 1); [L19] #res := ~nondetString~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=3, #res!offset=0, #t~malloc1!base=3, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=3, ~nondetString~0!offset=0] [L47] RET call #t~ret13 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret13!base=3, #t~ret13!offset=0] [L47] CALL call #t~ret14 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~length~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=0] [L14] COND TRUE ~length~0 < 1 [L15] ~length~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 >= -2147483648; [L17] FCALL call #t~malloc1 := #Ultimate.alloc(~length~0); [L17] ~nondetString~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=4, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=4, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=4, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=4, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 >= -2147483648; [L18] FCALL call write~int(0, { base: ~nondetString~0!base, offset: ~nondetString~0!offset + (~length~0 - 1) }, 1); [L19] #res := ~nondetString~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=4, #res!offset=0, #t~malloc1!base=4, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=4, ~nondetString~0!offset=0] [L47] RET call #t~ret14 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret13!base=3, #t~ret13!offset=0, #t~ret14!base=4, #t~ret14!offset=0] [L47] assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet15=-2147483648, #t~ret13!base=3, #t~ret13!offset=0, #t~ret14!base=4, #t~ret14!offset=0] [L47] CALL call #t~ret16 := cstrncmp(#t~ret13, #t~ret14, #t~nondet15); VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0] [L26-L44] ~s1 := #in~s1; [L26-L44] ~s2 := #in~s2; [L26-L44] ~n := #in~n; [L28] havoc ~uc1~0; [L28] havoc ~uc2~0; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L30] COND FALSE !(0 == ~n) VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L33] #t~post2 := ~n; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L33] assert #t~post2 - 1 <= 2147483647; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L33] assert #t~post2 - 1 >= -2147483648; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=2, old(#NULL!base)=5, old(#NULL!offset)=2] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L47] CALL call #t~ret13 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~length~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=0] [L14] COND TRUE ~length~0 < 1 [L15] ~length~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 >= -2147483648; [L17] FCALL call #t~malloc1 := #Ultimate.alloc(~length~0); [L17] ~nondetString~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=3, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=3, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=3, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=3, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 >= -2147483648; [L18] FCALL call write~int(0, { base: ~nondetString~0!base, offset: ~nondetString~0!offset + (~length~0 - 1) }, 1); [L19] #res := ~nondetString~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=3, #res!offset=0, #t~malloc1!base=3, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=3, ~nondetString~0!offset=0] [L47] RET call #t~ret13 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret13!base=3, #t~ret13!offset=0] [L47] CALL call #t~ret14 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~length~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=0] [L14] COND TRUE ~length~0 < 1 [L15] ~length~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 >= -2147483648; [L17] FCALL call #t~malloc1 := #Ultimate.alloc(~length~0); [L17] ~nondetString~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=4, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=4, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=4, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=4, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 >= -2147483648; [L18] FCALL call write~int(0, { base: ~nondetString~0!base, offset: ~nondetString~0!offset + (~length~0 - 1) }, 1); [L19] #res := ~nondetString~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=4, #res!offset=0, #t~malloc1!base=4, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=4, ~nondetString~0!offset=0] [L47] RET call #t~ret14 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret13!base=3, #t~ret13!offset=0, #t~ret14!base=4, #t~ret14!offset=0] [L47] assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet15=-2147483648, #t~ret13!base=3, #t~ret13!offset=0, #t~ret14!base=4, #t~ret14!offset=0] [L47] CALL call #t~ret16 := cstrncmp(#t~ret13, #t~ret14, #t~nondet15); VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0] [L26-L44] ~s1 := #in~s1; [L26-L44] ~s2 := #in~s2; [L26-L44] ~n := #in~n; [L28] havoc ~uc1~0; [L28] havoc ~uc2~0; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L30] COND FALSE !(0 == ~n) VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L33] #t~post2 := ~n; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L33] assert #t~post2 - 1 <= 2147483647; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L33] assert #t~post2 - 1 >= -2147483648; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=2, old(#NULL!base)=5, old(#NULL!offset)=2] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L47] CALL call #t~ret13 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~length~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=0] [L14] COND TRUE ~length~0 < 1 [L15] ~length~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 >= -2147483648; [L17] FCALL call #t~malloc1 := #Ultimate.alloc(~length~0); [L17] ~nondetString~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=3, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=3, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=3, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=3, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 >= -2147483648; [L18] FCALL call write~int(0, { base: ~nondetString~0!base, offset: ~nondetString~0!offset + (~length~0 - 1) }, 1); [L19] #res := ~nondetString~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=3, #res!offset=0, #t~malloc1!base=3, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=3, ~nondetString~0!offset=0] [L47] RET call #t~ret13 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret13!base=3, #t~ret13!offset=0] [L47] CALL call #t~ret14 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~length~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=0] [L14] COND TRUE ~length~0 < 1 [L15] ~length~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 >= -2147483648; [L17] FCALL call #t~malloc1 := #Ultimate.alloc(~length~0); [L17] ~nondetString~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=4, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=4, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=4, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=4, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 >= -2147483648; [L18] FCALL call write~int(0, { base: ~nondetString~0!base, offset: ~nondetString~0!offset + (~length~0 - 1) }, 1); [L19] #res := ~nondetString~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=4, #res!offset=0, #t~malloc1!base=4, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=4, ~nondetString~0!offset=0] [L47] RET call #t~ret14 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret13!base=3, #t~ret13!offset=0, #t~ret14!base=4, #t~ret14!offset=0] [L47] assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet15=-2147483648, #t~ret13!base=3, #t~ret13!offset=0, #t~ret14!base=4, #t~ret14!offset=0] [L47] CALL call #t~ret16 := cstrncmp(#t~ret13, #t~ret14, #t~nondet15); VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0] [L26-L44] ~s1 := #in~s1; [L26-L44] ~s2 := #in~s2; [L26-L44] ~n := #in~n; [L28] havoc ~uc1~0; [L28] havoc ~uc2~0; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L30] COND FALSE !(0 == ~n) VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L33] #t~post2 := ~n; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L33] assert #t~post2 - 1 <= 2147483647; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L33] assert #t~post2 - 1 >= -2147483648; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=2, old(#NULL!base)=5, old(#NULL!offset)=2] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L47] CALL call #t~ret13 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~length~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=0] [L14] COND TRUE ~length~0 < 1 [L15] ~length~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 >= -2147483648; [L17] FCALL call #t~malloc1 := #Ultimate.alloc(~length~0); [L17] ~nondetString~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=3, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=3, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=3, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=3, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 >= -2147483648; [L18] FCALL call write~int(0, { base: ~nondetString~0!base, offset: ~nondetString~0!offset + (~length~0 - 1) }, 1); [L19] #res := ~nondetString~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=3, #res!offset=0, #t~malloc1!base=3, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=3, ~nondetString~0!offset=0] [L47] RET call #t~ret13 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret13!base=3, #t~ret13!offset=0] [L47] CALL call #t~ret14 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~length~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=0] [L14] COND TRUE ~length~0 < 1 [L15] ~length~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 >= -2147483648; [L17] FCALL call #t~malloc1 := #Ultimate.alloc(~length~0); [L17] ~nondetString~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=4, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=4, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=4, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=4, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 >= -2147483648; [L18] FCALL call write~int(0, { base: ~nondetString~0!base, offset: ~nondetString~0!offset + (~length~0 - 1) }, 1); [L19] #res := ~nondetString~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=4, #res!offset=0, #t~malloc1!base=4, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=4, ~nondetString~0!offset=0] [L47] RET call #t~ret14 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret13!base=3, #t~ret13!offset=0, #t~ret14!base=4, #t~ret14!offset=0] [L47] assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet15=-2147483648, #t~ret13!base=3, #t~ret13!offset=0, #t~ret14!base=4, #t~ret14!offset=0] [L47] CALL call #t~ret16 := cstrncmp(#t~ret13, #t~ret14, #t~nondet15); VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0] [L26-L44] ~s1 := #in~s1; [L26-L44] ~s2 := #in~s2; [L26-L44] ~n := #in~n; [L28] havoc ~uc1~0; [L28] havoc ~uc2~0; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L30] COND FALSE !(0 == ~n) VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L33] #t~post2 := ~n; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L33] assert #t~post2 - 1 <= 2147483647; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L33] assert #t~post2 - 1 >= -2147483648; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L47] CALL, EXPR build_nondet_String() [L13] int length = __VERIFIER_nondet_int(); [L14] COND TRUE length < 1 [L15] length = 1 VAL [length=1] [L17] EXPR length * sizeof(char) [L17] char* nondetString = (char*) malloc(length * sizeof(char)); VAL [length=1, malloc(length * sizeof(char))={3:0}, nondetString={3:0}] [L18] EXPR length-1 [L18] nondetString[length-1] = '\0' [L19] return nondetString; VAL [\result={3:0}, length=1, malloc(length * sizeof(char))={3:0}, nondetString={3:0}] [L47] RET, EXPR build_nondet_String() VAL [build_nondet_String()={3:0}] [L47] CALL, EXPR build_nondet_String() [L13] int length = __VERIFIER_nondet_int(); [L14] COND TRUE length < 1 [L15] length = 1 VAL [length=1] [L17] EXPR length * sizeof(char) [L17] char* nondetString = (char*) malloc(length * sizeof(char)); VAL [length=1, malloc(length * sizeof(char))={4:0}, nondetString={4:0}] [L18] EXPR length-1 [L18] nondetString[length-1] = '\0' [L19] return nondetString; VAL [\result={4:0}, length=1, malloc(length * sizeof(char))={4:0}, nondetString={4:0}] [L47] RET, EXPR build_nondet_String() VAL [build_nondet_String()={3:0}, build_nondet_String()={4:0}] [L47] CALL cstrncmp(build_nondet_String(),build_nondet_String(),__VERIFIER_nondet_int()) VAL [\old(n)=-2147483648, s1={3:0}, s2={4:0}] [L28] unsigned char uc1, uc2; VAL [\old(n)=-2147483648, n=-2147483648, s1={3:0}, s1={3:0}, s2={4:0}, s2={4:0}] [L30] COND FALSE !(n == 0) VAL [\old(n)=-2147483648, n=-2147483648, s1={3:0}, s1={3:0}, s2={4:0}, s2={4:0}] [L33] n-- VAL [\old(n)=-2147483648, n=-2147483648, n--=-2147483648, s1={3:0}, s1={3:0}, s2={4:0}, s2={4:0}] ----- [2018-11-22 22:29:41,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:29:41 BoogieIcfgContainer [2018-11-22 22:29:41,217 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 22:29:41,218 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:29:41,218 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:29:41,218 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:29:41,218 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:29:40" (3/4) ... [2018-11-22 22:29:41,220 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|=5, |#NULL.offset|=2, |old(#NULL.base)|=5, |old(#NULL.offset)|=2] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=5, |old(#NULL.offset)|=2] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=5, |old(#NULL.offset)|=2] [?] RET #75#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret17 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret13.base, #t~ret13.offset := build_nondet_String(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~length~0 := #t~nondet0;havoc #t~nondet0; VAL [build_nondet_String_~length~0=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume ~length~0 < 1;~length~0 := 1; VAL [build_nondet_String_~length~0=1, |#NULL.base|=0, |#NULL.offset|=0] [?] assume ~length~0 <= 2147483647; VAL [build_nondet_String_~length~0=1, |#NULL.base|=0, |#NULL.offset|=0] [?] assume ~length~0 >= -2147483648;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(~length~0);~nondetString~0.base, ~nondetString~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [build_nondet_String_~length~0=1, build_nondet_String_~nondetString~0.base=3, build_nondet_String_~nondetString~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |build_nondet_String_#t~malloc1.base|=3, |build_nondet_String_#t~malloc1.offset|=0] [?] assume ~length~0 - 1 <= 2147483647; VAL [build_nondet_String_~length~0=1, build_nondet_String_~nondetString~0.base=3, build_nondet_String_~nondetString~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |build_nondet_String_#t~malloc1.base|=3, |build_nondet_String_#t~malloc1.offset|=0] [?] assume ~length~0 - 1 >= -2147483648;call write~int(0, ~nondetString~0.base, ~nondetString~0.offset + (~length~0 - 1), 1);#res.base, #res.offset := ~nondetString~0.base, ~nondetString~0.offset; VAL [build_nondet_String_~length~0=1, build_nondet_String_~nondetString~0.base=3, build_nondet_String_~nondetString~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |build_nondet_String_#res.base|=3, |build_nondet_String_#res.offset|=0, |build_nondet_String_#t~malloc1.base|=3, |build_nondet_String_#t~malloc1.offset|=0] [?] assume true; VAL [build_nondet_String_~length~0=1, build_nondet_String_~nondetString~0.base=3, build_nondet_String_~nondetString~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |build_nondet_String_#res.base|=3, |build_nondet_String_#res.offset|=0, |build_nondet_String_#t~malloc1.base|=3, |build_nondet_String_#t~malloc1.offset|=0] [?] RET #79#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret13.base|=3, |main_#t~ret13.offset|=0] [?] CALL call #t~ret14.base, #t~ret14.offset := build_nondet_String(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~length~0 := #t~nondet0;havoc #t~nondet0; VAL [build_nondet_String_~length~0=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume ~length~0 < 1;~length~0 := 1; VAL [build_nondet_String_~length~0=1, |#NULL.base|=0, |#NULL.offset|=0] [?] assume ~length~0 <= 2147483647; VAL [build_nondet_String_~length~0=1, |#NULL.base|=0, |#NULL.offset|=0] [?] assume ~length~0 >= -2147483648;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(~length~0);~nondetString~0.base, ~nondetString~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [build_nondet_String_~length~0=1, build_nondet_String_~nondetString~0.base=4, build_nondet_String_~nondetString~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |build_nondet_String_#t~malloc1.base|=4, |build_nondet_String_#t~malloc1.offset|=0] [?] assume ~length~0 - 1 <= 2147483647; VAL [build_nondet_String_~length~0=1, build_nondet_String_~nondetString~0.base=4, build_nondet_String_~nondetString~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |build_nondet_String_#t~malloc1.base|=4, |build_nondet_String_#t~malloc1.offset|=0] [?] assume ~length~0 - 1 >= -2147483648;call write~int(0, ~nondetString~0.base, ~nondetString~0.offset + (~length~0 - 1), 1);#res.base, #res.offset := ~nondetString~0.base, ~nondetString~0.offset; VAL [build_nondet_String_~length~0=1, build_nondet_String_~nondetString~0.base=4, build_nondet_String_~nondetString~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |build_nondet_String_#res.base|=4, |build_nondet_String_#res.offset|=0, |build_nondet_String_#t~malloc1.base|=4, |build_nondet_String_#t~malloc1.offset|=0] [?] assume true; VAL [build_nondet_String_~length~0=1, build_nondet_String_~nondetString~0.base=4, build_nondet_String_~nondetString~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |build_nondet_String_#res.base|=4, |build_nondet_String_#res.offset|=0, |build_nondet_String_#t~malloc1.base|=4, |build_nondet_String_#t~malloc1.offset|=0] [?] RET #81#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret13.base|=3, |main_#t~ret13.offset|=0, |main_#t~ret14.base|=4, |main_#t~ret14.offset|=0] [?] assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~nondet15|=(- 2147483648), |main_#t~ret13.base|=3, |main_#t~ret13.offset|=0, |main_#t~ret14.base|=4, |main_#t~ret14.offset|=0] [?] CALL call #t~ret16 := cstrncmp(#t~ret13.base, #t~ret13.offset, #t~ret14.base, #t~ret14.offset, #t~nondet15); VAL [|#NULL.base|=0, |#NULL.offset|=0, |cstrncmp_#in~n|=(- 2147483648), |cstrncmp_#in~s1.base|=3, |cstrncmp_#in~s1.offset|=0, |cstrncmp_#in~s2.base|=4, |cstrncmp_#in~s2.offset|=0] [?] ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~s2.base, ~s2.offset := #in~s2.base, #in~s2.offset;~n := #in~n;havoc ~uc1~0;havoc ~uc2~0; VAL [cstrncmp_~n=(- 2147483648), cstrncmp_~s1.base=3, cstrncmp_~s1.offset=0, cstrncmp_~s2.base=4, cstrncmp_~s2.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |cstrncmp_#in~n|=(- 2147483648), |cstrncmp_#in~s1.base|=3, |cstrncmp_#in~s1.offset|=0, |cstrncmp_#in~s2.base|=4, |cstrncmp_#in~s2.offset|=0] [?] assume !(0 == ~n); VAL [cstrncmp_~n=(- 2147483648), cstrncmp_~s1.base=3, cstrncmp_~s1.offset=0, cstrncmp_~s2.base=4, cstrncmp_~s2.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |cstrncmp_#in~n|=(- 2147483648), |cstrncmp_#in~s1.base|=3, |cstrncmp_#in~s1.offset|=0, |cstrncmp_#in~s2.base|=4, |cstrncmp_#in~s2.offset|=0] [?] #t~post2 := ~n; VAL [cstrncmp_~n=(- 2147483648), cstrncmp_~s1.base=3, cstrncmp_~s1.offset=0, cstrncmp_~s2.base=4, cstrncmp_~s2.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |cstrncmp_#in~n|=(- 2147483648), |cstrncmp_#in~s1.base|=3, |cstrncmp_#in~s1.offset|=0, |cstrncmp_#in~s2.base|=4, |cstrncmp_#in~s2.offset|=0, |cstrncmp_#t~post2|=(- 2147483648)] [?] assume #t~post2 - 1 <= 2147483647; VAL [cstrncmp_~n=(- 2147483648), cstrncmp_~s1.base=3, cstrncmp_~s1.offset=0, cstrncmp_~s2.base=4, cstrncmp_~s2.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |cstrncmp_#in~n|=(- 2147483648), |cstrncmp_#in~s1.base|=3, |cstrncmp_#in~s1.offset|=0, |cstrncmp_#in~s2.base|=4, |cstrncmp_#in~s2.offset|=0, |cstrncmp_#t~post2|=(- 2147483648)] [?] assume !(#t~post2 - 1 >= -2147483648); VAL [cstrncmp_~n=(- 2147483648), cstrncmp_~s1.base=3, cstrncmp_~s1.offset=0, cstrncmp_~s2.base=4, cstrncmp_~s2.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |cstrncmp_#in~n|=(- 2147483648), |cstrncmp_#in~s1.base|=3, |cstrncmp_#in~s1.offset|=0, |cstrncmp_#in~s2.base|=4, |cstrncmp_#in~s2.offset|=0, |cstrncmp_#t~post2|=(- 2147483648)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5, #NULL.offset=2, old(#NULL.base)=5, old(#NULL.offset)=2] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=2] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L47] CALL call #t~ret13.base, #t~ret13.offset := build_nondet_String(); VAL [#NULL.base=0, #NULL.offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~length~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, ~length~0=0] [L14-L16] assume ~length~0 < 1; [L15] ~length~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, ~length~0=1] [L17] assert ~length~0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, ~length~0=1] [L17] assert ~length~0 >= -2147483648; [L17] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(~length~0); [L17] ~nondetString~0.base, ~nondetString~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=3, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=3, ~nondetString~0.offset=0] [L18] assert ~length~0 - 1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=3, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=3, ~nondetString~0.offset=0] [L18] assert ~length~0 - 1 >= -2147483648; [L18] call write~int(0, ~nondetString~0.base, ~nondetString~0.offset + (~length~0 - 1), 1); [L19] #res.base, #res.offset := ~nondetString~0.base, ~nondetString~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=3, #res.offset=0, #t~malloc1.base=3, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=3, ~nondetString~0.offset=0] [L12-L20] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=3, #res.offset=0, #t~malloc1.base=3, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=3, ~nondetString~0.offset=0] [L47] RET call #t~ret13.base, #t~ret13.offset := build_nondet_String(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret13.base=3, #t~ret13.offset=0] [L47] CALL call #t~ret14.base, #t~ret14.offset := build_nondet_String(); VAL [#NULL.base=0, #NULL.offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~length~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, ~length~0=0] [L14-L16] assume ~length~0 < 1; [L15] ~length~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, ~length~0=1] [L17] assert ~length~0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, ~length~0=1] [L17] assert ~length~0 >= -2147483648; [L17] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(~length~0); [L17] ~nondetString~0.base, ~nondetString~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=4, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=4, ~nondetString~0.offset=0] [L18] assert ~length~0 - 1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=4, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=4, ~nondetString~0.offset=0] [L18] assert ~length~0 - 1 >= -2147483648; [L18] call write~int(0, ~nondetString~0.base, ~nondetString~0.offset + (~length~0 - 1), 1); [L19] #res.base, #res.offset := ~nondetString~0.base, ~nondetString~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=4, #res.offset=0, #t~malloc1.base=4, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=4, ~nondetString~0.offset=0] [L12-L20] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=4, #res.offset=0, #t~malloc1.base=4, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=4, ~nondetString~0.offset=0] [L47] RET call #t~ret14.base, #t~ret14.offset := build_nondet_String(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret13.base=3, #t~ret13.offset=0, #t~ret14.base=4, #t~ret14.offset=0] [L47] assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet15=-2147483648, #t~ret13.base=3, #t~ret13.offset=0, #t~ret14.base=4, #t~ret14.offset=0] [L47] CALL call #t~ret16 := cstrncmp(#t~ret13.base, #t~ret13.offset, #t~ret14.base, #t~ret14.offset, #t~nondet15); VAL [#in~n=-2147483648, #in~s1.base=3, #in~s1.offset=0, #in~s2.base=4, #in~s2.offset=0, #NULL.base=0, #NULL.offset=0] [L26-L44] ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset; [L26-L44] ~s2.base, ~s2.offset := #in~s2.base, #in~s2.offset; [L26-L44] ~n := #in~n; [L28] havoc ~uc1~0; [L28] havoc ~uc2~0; VAL [#in~n=-2147483648, #in~s1.base=3, #in~s1.offset=0, #in~s2.base=4, #in~s2.offset=0, #NULL.base=0, #NULL.offset=0, ~n=-2147483648, ~s1.base=3, ~s1.offset=0, ~s2.base=4, ~s2.offset=0] [L30-L31] assume !(0 == ~n); VAL [#in~n=-2147483648, #in~s1.base=3, #in~s1.offset=0, #in~s2.base=4, #in~s2.offset=0, #NULL.base=0, #NULL.offset=0, ~n=-2147483648, ~s1.base=3, ~s1.offset=0, ~s2.base=4, ~s2.offset=0] [L33] #t~post2 := ~n; VAL [#in~n=-2147483648, #in~s1.base=3, #in~s1.offset=0, #in~s2.base=4, #in~s2.offset=0, #NULL.base=0, #NULL.offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1.base=3, ~s1.offset=0, ~s2.base=4, ~s2.offset=0] [L33] assert #t~post2 - 1 <= 2147483647; VAL [#in~n=-2147483648, #in~s1.base=3, #in~s1.offset=0, #in~s2.base=4, #in~s2.offset=0, #NULL.base=0, #NULL.offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1.base=3, ~s1.offset=0, ~s2.base=4, ~s2.offset=0] [L33] assert #t~post2 - 1 >= -2147483648; VAL [#in~n=-2147483648, #in~s1.base=3, #in~s1.offset=0, #in~s2.base=4, #in~s2.offset=0, #NULL.base=0, #NULL.offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1.base=3, ~s1.offset=0, ~s2.base=4, ~s2.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5, #NULL.offset=2, old(#NULL.base)=5, old(#NULL.offset)=2] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=2] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L47] CALL call #t~ret13.base, #t~ret13.offset := build_nondet_String(); VAL [#NULL.base=0, #NULL.offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~length~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, ~length~0=0] [L14-L16] assume ~length~0 < 1; [L15] ~length~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, ~length~0=1] [L17] assert ~length~0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, ~length~0=1] [L17] assert ~length~0 >= -2147483648; [L17] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(~length~0); [L17] ~nondetString~0.base, ~nondetString~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=3, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=3, ~nondetString~0.offset=0] [L18] assert ~length~0 - 1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=3, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=3, ~nondetString~0.offset=0] [L18] assert ~length~0 - 1 >= -2147483648; [L18] call write~int(0, ~nondetString~0.base, ~nondetString~0.offset + (~length~0 - 1), 1); [L19] #res.base, #res.offset := ~nondetString~0.base, ~nondetString~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=3, #res.offset=0, #t~malloc1.base=3, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=3, ~nondetString~0.offset=0] [L12-L20] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=3, #res.offset=0, #t~malloc1.base=3, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=3, ~nondetString~0.offset=0] [L47] RET call #t~ret13.base, #t~ret13.offset := build_nondet_String(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret13.base=3, #t~ret13.offset=0] [L47] CALL call #t~ret14.base, #t~ret14.offset := build_nondet_String(); VAL [#NULL.base=0, #NULL.offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~length~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, ~length~0=0] [L14-L16] assume ~length~0 < 1; [L15] ~length~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, ~length~0=1] [L17] assert ~length~0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, ~length~0=1] [L17] assert ~length~0 >= -2147483648; [L17] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(~length~0); [L17] ~nondetString~0.base, ~nondetString~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=4, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=4, ~nondetString~0.offset=0] [L18] assert ~length~0 - 1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=4, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=4, ~nondetString~0.offset=0] [L18] assert ~length~0 - 1 >= -2147483648; [L18] call write~int(0, ~nondetString~0.base, ~nondetString~0.offset + (~length~0 - 1), 1); [L19] #res.base, #res.offset := ~nondetString~0.base, ~nondetString~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=4, #res.offset=0, #t~malloc1.base=4, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=4, ~nondetString~0.offset=0] [L12-L20] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=4, #res.offset=0, #t~malloc1.base=4, #t~malloc1.offset=0, ~length~0=1, ~nondetString~0.base=4, ~nondetString~0.offset=0] [L47] RET call #t~ret14.base, #t~ret14.offset := build_nondet_String(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret13.base=3, #t~ret13.offset=0, #t~ret14.base=4, #t~ret14.offset=0] [L47] assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet15=-2147483648, #t~ret13.base=3, #t~ret13.offset=0, #t~ret14.base=4, #t~ret14.offset=0] [L47] CALL call #t~ret16 := cstrncmp(#t~ret13.base, #t~ret13.offset, #t~ret14.base, #t~ret14.offset, #t~nondet15); VAL [#in~n=-2147483648, #in~s1.base=3, #in~s1.offset=0, #in~s2.base=4, #in~s2.offset=0, #NULL.base=0, #NULL.offset=0] [L26-L44] ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset; [L26-L44] ~s2.base, ~s2.offset := #in~s2.base, #in~s2.offset; [L26-L44] ~n := #in~n; [L28] havoc ~uc1~0; [L28] havoc ~uc2~0; VAL [#in~n=-2147483648, #in~s1.base=3, #in~s1.offset=0, #in~s2.base=4, #in~s2.offset=0, #NULL.base=0, #NULL.offset=0, ~n=-2147483648, ~s1.base=3, ~s1.offset=0, ~s2.base=4, ~s2.offset=0] [L30-L31] assume !(0 == ~n); VAL [#in~n=-2147483648, #in~s1.base=3, #in~s1.offset=0, #in~s2.base=4, #in~s2.offset=0, #NULL.base=0, #NULL.offset=0, ~n=-2147483648, ~s1.base=3, ~s1.offset=0, ~s2.base=4, ~s2.offset=0] [L33] #t~post2 := ~n; VAL [#in~n=-2147483648, #in~s1.base=3, #in~s1.offset=0, #in~s2.base=4, #in~s2.offset=0, #NULL.base=0, #NULL.offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1.base=3, ~s1.offset=0, ~s2.base=4, ~s2.offset=0] [L33] assert #t~post2 - 1 <= 2147483647; VAL [#in~n=-2147483648, #in~s1.base=3, #in~s1.offset=0, #in~s2.base=4, #in~s2.offset=0, #NULL.base=0, #NULL.offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1.base=3, ~s1.offset=0, ~s2.base=4, ~s2.offset=0] [L33] assert #t~post2 - 1 >= -2147483648; VAL [#in~n=-2147483648, #in~s1.base=3, #in~s1.offset=0, #in~s2.base=4, #in~s2.offset=0, #NULL.base=0, #NULL.offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1.base=3, ~s1.offset=0, ~s2.base=4, ~s2.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=2, old(#NULL!base)=5, old(#NULL!offset)=2] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L47] CALL call #t~ret13 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~length~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=0] [L14] COND TRUE ~length~0 < 1 [L15] ~length~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 >= -2147483648; [L17] FCALL call #t~malloc1 := #Ultimate.alloc(~length~0); [L17] ~nondetString~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=3, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=3, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=3, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=3, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 >= -2147483648; [L18] FCALL call write~int(0, { base: ~nondetString~0!base, offset: ~nondetString~0!offset + (~length~0 - 1) }, 1); [L19] #res := ~nondetString~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=3, #res!offset=0, #t~malloc1!base=3, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=3, ~nondetString~0!offset=0] [L47] RET call #t~ret13 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret13!base=3, #t~ret13!offset=0] [L47] CALL call #t~ret14 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~length~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=0] [L14] COND TRUE ~length~0 < 1 [L15] ~length~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 >= -2147483648; [L17] FCALL call #t~malloc1 := #Ultimate.alloc(~length~0); [L17] ~nondetString~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=4, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=4, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=4, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=4, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 >= -2147483648; [L18] FCALL call write~int(0, { base: ~nondetString~0!base, offset: ~nondetString~0!offset + (~length~0 - 1) }, 1); [L19] #res := ~nondetString~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=4, #res!offset=0, #t~malloc1!base=4, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=4, ~nondetString~0!offset=0] [L47] RET call #t~ret14 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret13!base=3, #t~ret13!offset=0, #t~ret14!base=4, #t~ret14!offset=0] [L47] assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet15=-2147483648, #t~ret13!base=3, #t~ret13!offset=0, #t~ret14!base=4, #t~ret14!offset=0] [L47] CALL call #t~ret16 := cstrncmp(#t~ret13, #t~ret14, #t~nondet15); VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0] [L26-L44] ~s1 := #in~s1; [L26-L44] ~s2 := #in~s2; [L26-L44] ~n := #in~n; [L28] havoc ~uc1~0; [L28] havoc ~uc2~0; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L30] COND FALSE !(0 == ~n) VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L33] #t~post2 := ~n; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L33] assert #t~post2 - 1 <= 2147483647; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L33] assert #t~post2 - 1 >= -2147483648; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=2, old(#NULL!base)=5, old(#NULL!offset)=2] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L47] CALL call #t~ret13 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~length~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=0] [L14] COND TRUE ~length~0 < 1 [L15] ~length~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 >= -2147483648; [L17] FCALL call #t~malloc1 := #Ultimate.alloc(~length~0); [L17] ~nondetString~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=3, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=3, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=3, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=3, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 >= -2147483648; [L18] FCALL call write~int(0, { base: ~nondetString~0!base, offset: ~nondetString~0!offset + (~length~0 - 1) }, 1); [L19] #res := ~nondetString~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=3, #res!offset=0, #t~malloc1!base=3, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=3, ~nondetString~0!offset=0] [L47] RET call #t~ret13 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret13!base=3, #t~ret13!offset=0] [L47] CALL call #t~ret14 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~length~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=0] [L14] COND TRUE ~length~0 < 1 [L15] ~length~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 >= -2147483648; [L17] FCALL call #t~malloc1 := #Ultimate.alloc(~length~0); [L17] ~nondetString~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=4, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=4, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=4, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=4, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 >= -2147483648; [L18] FCALL call write~int(0, { base: ~nondetString~0!base, offset: ~nondetString~0!offset + (~length~0 - 1) }, 1); [L19] #res := ~nondetString~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=4, #res!offset=0, #t~malloc1!base=4, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=4, ~nondetString~0!offset=0] [L47] RET call #t~ret14 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret13!base=3, #t~ret13!offset=0, #t~ret14!base=4, #t~ret14!offset=0] [L47] assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet15=-2147483648, #t~ret13!base=3, #t~ret13!offset=0, #t~ret14!base=4, #t~ret14!offset=0] [L47] CALL call #t~ret16 := cstrncmp(#t~ret13, #t~ret14, #t~nondet15); VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0] [L26-L44] ~s1 := #in~s1; [L26-L44] ~s2 := #in~s2; [L26-L44] ~n := #in~n; [L28] havoc ~uc1~0; [L28] havoc ~uc2~0; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L30] COND FALSE !(0 == ~n) VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L33] #t~post2 := ~n; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L33] assert #t~post2 - 1 <= 2147483647; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L33] assert #t~post2 - 1 >= -2147483648; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=2, old(#NULL!base)=5, old(#NULL!offset)=2] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L47] CALL call #t~ret13 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~length~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=0] [L14] COND TRUE ~length~0 < 1 [L15] ~length~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 >= -2147483648; [L17] FCALL call #t~malloc1 := #Ultimate.alloc(~length~0); [L17] ~nondetString~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=3, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=3, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=3, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=3, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 >= -2147483648; [L18] FCALL call write~int(0, { base: ~nondetString~0!base, offset: ~nondetString~0!offset + (~length~0 - 1) }, 1); [L19] #res := ~nondetString~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=3, #res!offset=0, #t~malloc1!base=3, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=3, ~nondetString~0!offset=0] [L47] RET call #t~ret13 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret13!base=3, #t~ret13!offset=0] [L47] CALL call #t~ret14 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~length~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=0] [L14] COND TRUE ~length~0 < 1 [L15] ~length~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 >= -2147483648; [L17] FCALL call #t~malloc1 := #Ultimate.alloc(~length~0); [L17] ~nondetString~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=4, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=4, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=4, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=4, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 >= -2147483648; [L18] FCALL call write~int(0, { base: ~nondetString~0!base, offset: ~nondetString~0!offset + (~length~0 - 1) }, 1); [L19] #res := ~nondetString~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=4, #res!offset=0, #t~malloc1!base=4, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=4, ~nondetString~0!offset=0] [L47] RET call #t~ret14 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret13!base=3, #t~ret13!offset=0, #t~ret14!base=4, #t~ret14!offset=0] [L47] assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet15=-2147483648, #t~ret13!base=3, #t~ret13!offset=0, #t~ret14!base=4, #t~ret14!offset=0] [L47] CALL call #t~ret16 := cstrncmp(#t~ret13, #t~ret14, #t~nondet15); VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0] [L26-L44] ~s1 := #in~s1; [L26-L44] ~s2 := #in~s2; [L26-L44] ~n := #in~n; [L28] havoc ~uc1~0; [L28] havoc ~uc2~0; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L30] COND FALSE !(0 == ~n) VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L33] #t~post2 := ~n; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L33] assert #t~post2 - 1 <= 2147483647; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L33] assert #t~post2 - 1 >= -2147483648; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=2, old(#NULL!base)=5, old(#NULL!offset)=2] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L47] CALL call #t~ret13 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~length~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=0] [L14] COND TRUE ~length~0 < 1 [L15] ~length~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 >= -2147483648; [L17] FCALL call #t~malloc1 := #Ultimate.alloc(~length~0); [L17] ~nondetString~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=3, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=3, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=3, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=3, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 >= -2147483648; [L18] FCALL call write~int(0, { base: ~nondetString~0!base, offset: ~nondetString~0!offset + (~length~0 - 1) }, 1); [L19] #res := ~nondetString~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=3, #res!offset=0, #t~malloc1!base=3, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=3, ~nondetString~0!offset=0] [L47] RET call #t~ret13 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret13!base=3, #t~ret13!offset=0] [L47] CALL call #t~ret14 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~length~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=0] [L14] COND TRUE ~length~0 < 1 [L15] ~length~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~length~0=1] [L17] assert ~length~0 >= -2147483648; [L17] FCALL call #t~malloc1 := #Ultimate.alloc(~length~0); [L17] ~nondetString~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=4, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=4, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=4, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=4, ~nondetString~0!offset=0] [L18] assert ~length~0 - 1 >= -2147483648; [L18] FCALL call write~int(0, { base: ~nondetString~0!base, offset: ~nondetString~0!offset + (~length~0 - 1) }, 1); [L19] #res := ~nondetString~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=4, #res!offset=0, #t~malloc1!base=4, #t~malloc1!offset=0, ~length~0=1, ~nondetString~0!base=4, ~nondetString~0!offset=0] [L47] RET call #t~ret14 := build_nondet_String(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret13!base=3, #t~ret13!offset=0, #t~ret14!base=4, #t~ret14!offset=0] [L47] assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet15=-2147483648, #t~ret13!base=3, #t~ret13!offset=0, #t~ret14!base=4, #t~ret14!offset=0] [L47] CALL call #t~ret16 := cstrncmp(#t~ret13, #t~ret14, #t~nondet15); VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0] [L26-L44] ~s1 := #in~s1; [L26-L44] ~s2 := #in~s2; [L26-L44] ~n := #in~n; [L28] havoc ~uc1~0; [L28] havoc ~uc2~0; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L30] COND FALSE !(0 == ~n) VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L33] #t~post2 := ~n; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L33] assert #t~post2 - 1 <= 2147483647; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L33] assert #t~post2 - 1 >= -2147483648; VAL [#in~n=-2147483648, #in~s1!base=3, #in~s1!offset=0, #in~s2!base=4, #in~s2!offset=0, #NULL!base=0, #NULL!offset=0, #t~post2=-2147483648, ~n=-2147483648, ~s1!base=3, ~s1!offset=0, ~s2!base=4, ~s2!offset=0] [L47] CALL, EXPR build_nondet_String() [L13] int length = __VERIFIER_nondet_int(); [L14] COND TRUE length < 1 [L15] length = 1 VAL [length=1] [L17] EXPR length * sizeof(char) [L17] char* nondetString = (char*) malloc(length * sizeof(char)); VAL [length=1, malloc(length * sizeof(char))={3:0}, nondetString={3:0}] [L18] EXPR length-1 [L18] nondetString[length-1] = '\0' [L19] return nondetString; VAL [\result={3:0}, length=1, malloc(length * sizeof(char))={3:0}, nondetString={3:0}] [L47] RET, EXPR build_nondet_String() VAL [build_nondet_String()={3:0}] [L47] CALL, EXPR build_nondet_String() [L13] int length = __VERIFIER_nondet_int(); [L14] COND TRUE length < 1 [L15] length = 1 VAL [length=1] [L17] EXPR length * sizeof(char) [L17] char* nondetString = (char*) malloc(length * sizeof(char)); VAL [length=1, malloc(length * sizeof(char))={4:0}, nondetString={4:0}] [L18] EXPR length-1 [L18] nondetString[length-1] = '\0' [L19] return nondetString; VAL [\result={4:0}, length=1, malloc(length * sizeof(char))={4:0}, nondetString={4:0}] [L47] RET, EXPR build_nondet_String() VAL [build_nondet_String()={3:0}, build_nondet_String()={4:0}] [L47] CALL cstrncmp(build_nondet_String(),build_nondet_String(),__VERIFIER_nondet_int()) VAL [\old(n)=-2147483648, s1={3:0}, s2={4:0}] [L28] unsigned char uc1, uc2; VAL [\old(n)=-2147483648, n=-2147483648, s1={3:0}, s1={3:0}, s2={4:0}, s2={4:0}] [L30] COND FALSE !(n == 0) VAL [\old(n)=-2147483648, n=-2147483648, s1={3:0}, s1={3:0}, s2={4:0}, s2={4:0}] [L33] n-- VAL [\old(n)=-2147483648, n=-2147483648, n--=-2147483648, s1={3:0}, s1={3:0}, s2={4:0}, s2={4:0}] ----- [2018-11-22 22:29:41,283 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f9ff375b-e388-43eb-99e3-fa6285484cde/bin-2019/uautomizer/witness.graphml [2018-11-22 22:29:41,284 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:29:41,284 INFO L168 Benchmark]: Toolchain (without parser) took 1121.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.7 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -125.3 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:29:41,286 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:29:41,286 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.86 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 948.4 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-22 22:29:41,286 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.42 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:29:41,287 INFO L168 Benchmark]: Boogie Preprocessor took 53.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.7 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -229.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:29:41,287 INFO L168 Benchmark]: RCFGBuilder took 191.72 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: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2018-11-22 22:29:41,288 INFO L168 Benchmark]: TraceAbstraction took 616.44 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: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:29:41,288 INFO L168 Benchmark]: Witness Printer took 65.98 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2018-11-22 22:29:41,290 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 175.86 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 948.4 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.42 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.7 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -229.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 191.72 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: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 616.44 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: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. * Witness Printer took 65.98 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 33]: integer overflow possible integer overflow possible We found a FailurePath: [L47] CALL, EXPR build_nondet_String() [L13] int length = __VERIFIER_nondet_int(); [L14] COND TRUE length < 1 [L15] length = 1 VAL [length=1] [L17] EXPR length * sizeof(char) [L17] char* nondetString = (char*) malloc(length * sizeof(char)); VAL [length=1, malloc(length * sizeof(char))={3:0}, nondetString={3:0}] [L18] EXPR length-1 [L18] nondetString[length-1] = '\0' [L19] return nondetString; VAL [\result={3:0}, length=1, malloc(length * sizeof(char))={3:0}, nondetString={3:0}] [L47] RET, EXPR build_nondet_String() VAL [build_nondet_String()={3:0}] [L47] CALL, EXPR build_nondet_String() [L13] int length = __VERIFIER_nondet_int(); [L14] COND TRUE length < 1 [L15] length = 1 VAL [length=1] [L17] EXPR length * sizeof(char) [L17] char* nondetString = (char*) malloc(length * sizeof(char)); VAL [length=1, malloc(length * sizeof(char))={4:0}, nondetString={4:0}] [L18] EXPR length-1 [L18] nondetString[length-1] = '\0' [L19] return nondetString; VAL [\result={4:0}, length=1, malloc(length * sizeof(char))={4:0}, nondetString={4:0}] [L47] RET, EXPR build_nondet_String() VAL [build_nondet_String()={3:0}, build_nondet_String()={4:0}] [L47] CALL cstrncmp(build_nondet_String(),build_nondet_String(),__VERIFIER_nondet_int()) VAL [\old(n)=-2147483648, s1={3:0}, s2={4:0}] [L28] unsigned char uc1, uc2; VAL [\old(n)=-2147483648, n=-2147483648, s1={3:0}, s1={3:0}, s2={4:0}, s2={4:0}] [L30] COND FALSE !(n == 0) VAL [\old(n)=-2147483648, n=-2147483648, s1={3:0}, s1={3:0}, s2={4:0}, s2={4:0}] [L33] n-- VAL [\old(n)=-2147483648, n=-2147483648, n--=-2147483648, s1={3:0}, s1={3:0}, s2={4:0}, s2={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 42 locations, 6 error locations. UNSAFE Result, 0.5s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 121 SDtfs, 40 SDslu, 168 SDs, 0 SdLazy, 44 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred 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, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 1357 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 8/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...