./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted/Binary_Search_false-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_611d9611-f465-4e6c-8bb4-4c415009fe4d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_611d9611-f465-4e6c-8bb4-4c415009fe4d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_611d9611-f465-4e6c-8bb4-4c415009fe4d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_611d9611-f465-4e6c-8bb4-4c415009fe4d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/Binary_Search_false-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_611d9611-f465-4e6c-8bb4-4c415009fe4d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_611d9611-f465-4e6c-8bb4-4c415009fe4d/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c82b80ee1d840c8880cc584253dffda998627af8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 07:01:55,373 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:01:55,374 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:01:55,383 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:01:55,383 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:01:55,384 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:01:55,384 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:01:55,386 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:01:55,387 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:01:55,387 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:01:55,388 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:01:55,388 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:01:55,389 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:01:55,389 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:01:55,390 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:01:55,391 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:01:55,392 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:01:55,393 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:01:55,394 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:01:55,395 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:01:55,396 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:01:55,397 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:01:55,398 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:01:55,398 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:01:55,398 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:01:55,399 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:01:55,400 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:01:55,400 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:01:55,401 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:01:55,402 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:01:55,402 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:01:55,402 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:01:55,402 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:01:55,403 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:01:55,403 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:01:55,404 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:01:55,404 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_611d9611-f465-4e6c-8bb4-4c415009fe4d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 07:01:55,414 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:01:55,414 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:01:55,415 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:01:55,415 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:01:55,416 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 07:01:55,416 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 07:01:55,416 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 07:01:55,416 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 07:01:55,416 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 07:01:55,416 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 07:01:55,416 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 07:01:55,417 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:01:55,417 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 07:01:55,417 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:01:55,417 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:01:55,417 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 07:01:55,417 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 07:01:55,417 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 07:01:55,418 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:01:55,418 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 07:01:55,418 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:01:55,418 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 07:01:55,418 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:01:55,418 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 07:01:55,419 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 07:01:55,419 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:01:55,419 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 07:01:55,419 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 07:01:55,420 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 07:01:55,420 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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_611d9611-f465-4e6c-8bb4-4c415009fe4d/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(F end) ) 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 -> c82b80ee1d840c8880cc584253dffda998627af8 [2018-11-23 07:01:55,443 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:01:55,452 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:01:55,455 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:01:55,456 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:01:55,456 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:01:55,457 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_611d9611-f465-4e6c-8bb4-4c415009fe4d/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/Binary_Search_false-termination_true-valid-memsafety.c [2018-11-23 07:01:55,500 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_611d9611-f465-4e6c-8bb4-4c415009fe4d/bin-2019/uautomizer/data/2f292a2e6/aa71f096bff54b2d93c5bf9692a1befc/FLAG824baea43 [2018-11-23 07:01:55,842 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:01:55,842 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_611d9611-f465-4e6c-8bb4-4c415009fe4d/sv-benchmarks/c/termination-crafted/Binary_Search_false-termination_true-valid-memsafety.c [2018-11-23 07:01:55,847 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_611d9611-f465-4e6c-8bb4-4c415009fe4d/bin-2019/uautomizer/data/2f292a2e6/aa71f096bff54b2d93c5bf9692a1befc/FLAG824baea43 [2018-11-23 07:01:56,260 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_611d9611-f465-4e6c-8bb4-4c415009fe4d/bin-2019/uautomizer/data/2f292a2e6/aa71f096bff54b2d93c5bf9692a1befc [2018-11-23 07:01:56,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:01:56,263 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:01:56,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:01:56,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:01:56,266 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:01:56,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:01:56" (1/1) ... [2018-11-23 07:01:56,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ee9d804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:01:56, skipping insertion in model container [2018-11-23 07:01:56,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:01:56" (1/1) ... [2018-11-23 07:01:56,274 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:01:56,286 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:01:56,387 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:01:56,390 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:01:56,399 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:01:56,407 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:01:56,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:01:56 WrapperNode [2018-11-23 07:01:56,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:01:56,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:01:56,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:01:56,408 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:01:56,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:01:56" (1/1) ... [2018-11-23 07:01:56,416 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:01:56" (1/1) ... [2018-11-23 07:01:56,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:01:56,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:01:56,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:01:56,427 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:01:56,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:01:56" (1/1) ... [2018-11-23 07:01:56,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:01:56" (1/1) ... [2018-11-23 07:01:56,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:01:56" (1/1) ... [2018-11-23 07:01:56,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:01:56" (1/1) ... [2018-11-23 07:01:56,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:01:56" (1/1) ... [2018-11-23 07:01:56,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:01:56" (1/1) ... [2018-11-23 07:01:56,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:01:56" (1/1) ... [2018-11-23 07:01:56,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:01:56,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:01:56,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:01:56,437 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:01:56,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:01:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_611d9611-f465-4e6c-8bb4-4c415009fe4d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:01:56,506 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-23 07:01:56,506 INFO L138 BoogieDeclarations]: Found implementation of procedure bsearch [2018-11-23 07:01:56,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:01:56,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:01:56,610 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:01:56,610 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 07:01:56,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:01:56 BoogieIcfgContainer [2018-11-23 07:01:56,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:01:56,611 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 07:01:56,611 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 07:01:56,614 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 07:01:56,615 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:01:56,615 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 07:01:56" (1/3) ... [2018-11-23 07:01:56,616 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6004c993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 07:01:56, skipping insertion in model container [2018-11-23 07:01:56,616 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:01:56,616 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:01:56" (2/3) ... [2018-11-23 07:01:56,616 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6004c993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 07:01:56, skipping insertion in model container [2018-11-23 07:01:56,616 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:01:56,617 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:01:56" (3/3) ... [2018-11-23 07:01:56,618 INFO L375 chiAutomizerObserver]: Analyzing ICFG Binary_Search_false-termination_true-valid-memsafety.c [2018-11-23 07:01:56,665 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 07:01:56,665 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 07:01:56,665 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 07:01:56,666 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 07:01:56,666 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 07:01:56,666 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 07:01:56,666 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 07:01:56,666 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 07:01:56,666 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 07:01:56,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-23 07:01:56,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 07:01:56,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:01:56,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:01:56,707 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 07:01:56,707 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 07:01:56,707 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 07:01:56,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-23 07:01:56,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 07:01:56,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:01:56,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:01:56,709 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 07:01:56,710 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 07:01:56,718 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 10#L22true assume !!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823); 11#L23true assume !!(-1073741823 <= main_~y~0 && main_~y~0 <= 1073741823); 16#L24true call main_#t~ret5 := bsearch(main_~x~0, main_~y~0);< 14#bsearchENTRYtrue [2018-11-23 07:01:56,718 INFO L796 eck$LassoCheckResult]: Loop: 14#bsearchENTRYtrue ~i := #in~i;~j := #in~j; 6#L10true assume !(~i >= ~j);~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); 3#L12true assume 0 != #t~nondet0;havoc #t~nondet0; 18#L13true call #t~ret1 := bsearch(~i, ~mid~0);< 14#bsearchENTRYtrue [2018-11-23 07:01:56,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:01:56,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1390416, now seen corresponding path program 1 times [2018-11-23 07:01:56,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:01:56,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:01:56,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:56,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:01:56,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:01:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:01:56,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:01:56,789 INFO L82 PathProgramCache]: Analyzing trace with hash 927613, now seen corresponding path program 1 times [2018-11-23 07:01:56,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:01:56,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:01:56,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:56,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:01:56,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:01:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:01:56,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:01:56,812 INFO L82 PathProgramCache]: Analyzing trace with hash -116842676, now seen corresponding path program 1 times [2018-11-23 07:01:56,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:01:56,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:01:56,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:56,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:01:56,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:01:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; [?] assume !!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823); [?] assume !!(-1073741823 <= main_~y~0 && main_~y~0 <= 1073741823); [?] CALL call main_#t~ret5 := bsearch(main_~x~0, main_~y~0); [?] havoc main_#res; [?] havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~x~0, main_~y~0; [L19] main_~x~0 := main_#t~nondet3; [L19] havoc main_#t~nondet3; [L20] main_~y~0 := main_#t~nondet4; [L20] havoc main_#t~nondet4; [L22] assume !!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823); [L23] assume !!(-1073741823 <= main_~y~0 && main_~y~0 <= 1073741823); [L24] CALL call main_#t~ret5 := bsearch(main_~x~0, main_~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~x~0, main_~y~0; [L19] main_~x~0 := main_#t~nondet3; [L19] havoc main_#t~nondet3; [L20] main_~y~0 := main_#t~nondet4; [L20] havoc main_#t~nondet4; [L22] assume !!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823); [L23] assume !!(-1073741823 <= main_~y~0 && main_~y~0 <= 1073741823); [L24] CALL call main_#t~ret5 := bsearch(main_~x~0, main_~y~0); [?] havoc main_#res; [?] havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~x~0, main_~y~0; [L19] main_~x~0 := main_#t~nondet3; [L19] havoc main_#t~nondet3; [L20] main_~y~0 := main_#t~nondet4; [L20] havoc main_#t~nondet4; [L22] COND FALSE !(!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823)) [L23] COND FALSE !(!(-1073741823 <= main_~y~0 && main_~y~0 <= 1073741823)) [L24] CALL call main_#t~ret5 := bsearch(main_~x~0, main_~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~x~0, main_~y~0; [L19] main_~x~0 := main_#t~nondet3; [L19] havoc main_#t~nondet3; [L20] main_~y~0 := main_#t~nondet4; [L20] havoc main_#t~nondet4; [L22] COND FALSE !(!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823)) [L23] COND FALSE !(!(-1073741823 <= main_~y~0 && main_~y~0 <= 1073741823)) [L24] CALL call main_#t~ret5 := bsearch(main_~x~0, main_~y~0); [L19] ~x~0 := #t~nondet3; [L19] havoc #t~nondet3; [L20] ~y~0 := #t~nondet4; [L20] havoc #t~nondet4; [L22] COND FALSE !(!(-1073741823 <= ~x~0 && ~x~0 <= 1073741823)) [L23] COND FALSE !(!(-1073741823 <= ~y~0 && ~y~0 <= 1073741823)) [L24] CALL call #t~ret5 := bsearch(~x~0, ~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L19] ~x~0 := #t~nondet3; [L19] havoc #t~nondet3; [L20] ~y~0 := #t~nondet4; [L20] havoc #t~nondet4; [L22] COND FALSE !(!(-1073741823 <= ~x~0 && ~x~0 <= 1073741823)) [L23] COND FALSE !(!(-1073741823 <= ~y~0 && ~y~0 <= 1073741823)) [L24] CALL call #t~ret5 := bsearch(~x~0, ~y~0); [L19] int x = __VERIFIER_nondet_int(); [L20] int y = __VERIFIER_nondet_int(); [L22] COND FALSE !(!(-1073741823<=x && x<=1073741823)) [L23] COND FALSE !(!(-1073741823<=y && y<=1073741823)) [L24] CALL bsearch(x, y) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~i := #in~i;~j := #in~j; [?] assume !(~i >= ~j);~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [?] assume 0 != #t~nondet0;havoc #t~nondet0; [?] CALL call #t~ret1 := bsearch(~i, ~mid~0); [L8-L15] ~i := #in~i; [L8-L15] ~j := #in~j; [L10] assume !(~i >= ~j); [L11] ~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [L12-L13] assume 0 != #t~nondet0; [L12] havoc #t~nondet0; [L13] CALL call #t~ret1 := bsearch(~i, ~mid~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L8-L15] ~i := #in~i; [L8-L15] ~j := #in~j; [L10] assume !(~i >= ~j); [L11] ~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [L12-L13] assume 0 != #t~nondet0; [L12] havoc #t~nondet0; [L13] CALL call #t~ret1 := bsearch(~i, ~mid~0); [L8-L15] ~i := #in~i; [L8-L15] ~j := #in~j; [L10] COND FALSE !(~i >= ~j) [L11] ~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [L12-L13] COND TRUE 0 != #t~nondet0 [L12] havoc #t~nondet0; [L13] CALL call #t~ret1 := bsearch(~i, ~mid~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L8-L15] ~i := #in~i; [L8-L15] ~j := #in~j; [L10] COND FALSE !(~i >= ~j) [L11] ~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [L12-L13] COND TRUE 0 != #t~nondet0 [L12] havoc #t~nondet0; [L13] CALL call #t~ret1 := bsearch(~i, ~mid~0); [L8-L15] ~i := #in~i; [L8-L15] ~j := #in~j; [L10] COND FALSE !(~i >= ~j) [L11] ~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [L12-L13] COND TRUE 0 != #t~nondet0 [L12] havoc #t~nondet0; [L13] CALL call #t~ret1 := bsearch(~i, ~mid~0); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L8-L15] ~i := #in~i; [L8-L15] ~j := #in~j; [L10] COND FALSE !(~i >= ~j) [L11] ~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [L12-L13] COND TRUE 0 != #t~nondet0 [L12] havoc #t~nondet0; [L13] CALL call #t~ret1 := bsearch(~i, ~mid~0); [L10] COND FALSE !(i>=j) [L11] int mid = (i+j)/2; [L12] COND TRUE __VERIFIER_nondet_int() [L13] CALL bsearch(i,mid) ----- [2018-11-23 07:01:57,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 07:01:57 BoogieIcfgContainer [2018-11-23 07:01:57,064 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 07:01:57,064 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:01:57,064 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:01:57,064 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:01:57,065 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:01:56" (3/4) ... [2018-11-23 07:01:57,067 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; [?] assume !!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823); [?] assume !!(-1073741823 <= main_~y~0 && main_~y~0 <= 1073741823); [?] CALL call main_#t~ret5 := bsearch(main_~x~0, main_~y~0); [?] havoc main_#res; [?] havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~x~0, main_~y~0; [L19] main_~x~0 := main_#t~nondet3; [L19] havoc main_#t~nondet3; [L20] main_~y~0 := main_#t~nondet4; [L20] havoc main_#t~nondet4; [L22] assume !!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823); [L23] assume !!(-1073741823 <= main_~y~0 && main_~y~0 <= 1073741823); [L24] CALL call main_#t~ret5 := bsearch(main_~x~0, main_~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~x~0, main_~y~0; [L19] main_~x~0 := main_#t~nondet3; [L19] havoc main_#t~nondet3; [L20] main_~y~0 := main_#t~nondet4; [L20] havoc main_#t~nondet4; [L22] assume !!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823); [L23] assume !!(-1073741823 <= main_~y~0 && main_~y~0 <= 1073741823); [L24] CALL call main_#t~ret5 := bsearch(main_~x~0, main_~y~0); [?] havoc main_#res; [?] havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~x~0, main_~y~0; [L19] main_~x~0 := main_#t~nondet3; [L19] havoc main_#t~nondet3; [L20] main_~y~0 := main_#t~nondet4; [L20] havoc main_#t~nondet4; [L22] COND FALSE !(!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823)) [L23] COND FALSE !(!(-1073741823 <= main_~y~0 && main_~y~0 <= 1073741823)) [L24] CALL call main_#t~ret5 := bsearch(main_~x~0, main_~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~x~0, main_~y~0; [L19] main_~x~0 := main_#t~nondet3; [L19] havoc main_#t~nondet3; [L20] main_~y~0 := main_#t~nondet4; [L20] havoc main_#t~nondet4; [L22] COND FALSE !(!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823)) [L23] COND FALSE !(!(-1073741823 <= main_~y~0 && main_~y~0 <= 1073741823)) [L24] CALL call main_#t~ret5 := bsearch(main_~x~0, main_~y~0); [L19] ~x~0 := #t~nondet3; [L19] havoc #t~nondet3; [L20] ~y~0 := #t~nondet4; [L20] havoc #t~nondet4; [L22] COND FALSE !(!(-1073741823 <= ~x~0 && ~x~0 <= 1073741823)) [L23] COND FALSE !(!(-1073741823 <= ~y~0 && ~y~0 <= 1073741823)) [L24] CALL call #t~ret5 := bsearch(~x~0, ~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L19] ~x~0 := #t~nondet3; [L19] havoc #t~nondet3; [L20] ~y~0 := #t~nondet4; [L20] havoc #t~nondet4; [L22] COND FALSE !(!(-1073741823 <= ~x~0 && ~x~0 <= 1073741823)) [L23] COND FALSE !(!(-1073741823 <= ~y~0 && ~y~0 <= 1073741823)) [L24] CALL call #t~ret5 := bsearch(~x~0, ~y~0); [L19] int x = __VERIFIER_nondet_int(); [L20] int y = __VERIFIER_nondet_int(); [L22] COND FALSE !(!(-1073741823<=x && x<=1073741823)) [L23] COND FALSE !(!(-1073741823<=y && y<=1073741823)) [L24] CALL bsearch(x, y) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~i := #in~i;~j := #in~j; [?] assume !(~i >= ~j);~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [?] assume 0 != #t~nondet0;havoc #t~nondet0; [?] CALL call #t~ret1 := bsearch(~i, ~mid~0); [L8-L15] ~i := #in~i; [L8-L15] ~j := #in~j; [L10] assume !(~i >= ~j); [L11] ~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [L12-L13] assume 0 != #t~nondet0; [L12] havoc #t~nondet0; [L13] CALL call #t~ret1 := bsearch(~i, ~mid~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L8-L15] ~i := #in~i; [L8-L15] ~j := #in~j; [L10] assume !(~i >= ~j); [L11] ~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [L12-L13] assume 0 != #t~nondet0; [L12] havoc #t~nondet0; [L13] CALL call #t~ret1 := bsearch(~i, ~mid~0); [L8-L15] ~i := #in~i; [L8-L15] ~j := #in~j; [L10] COND FALSE !(~i >= ~j) [L11] ~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [L12-L13] COND TRUE 0 != #t~nondet0 [L12] havoc #t~nondet0; [L13] CALL call #t~ret1 := bsearch(~i, ~mid~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L8-L15] ~i := #in~i; [L8-L15] ~j := #in~j; [L10] COND FALSE !(~i >= ~j) [L11] ~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [L12-L13] COND TRUE 0 != #t~nondet0 [L12] havoc #t~nondet0; [L13] CALL call #t~ret1 := bsearch(~i, ~mid~0); [L8-L15] ~i := #in~i; [L8-L15] ~j := #in~j; [L10] COND FALSE !(~i >= ~j) [L11] ~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [L12-L13] COND TRUE 0 != #t~nondet0 [L12] havoc #t~nondet0; [L13] CALL call #t~ret1 := bsearch(~i, ~mid~0); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L8-L15] ~i := #in~i; [L8-L15] ~j := #in~j; [L10] COND FALSE !(~i >= ~j) [L11] ~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [L12-L13] COND TRUE 0 != #t~nondet0 [L12] havoc #t~nondet0; [L13] CALL call #t~ret1 := bsearch(~i, ~mid~0); [L10] COND FALSE !(i>=j) [L11] int mid = (i+j)/2; [L12] COND TRUE __VERIFIER_nondet_int() [L13] CALL bsearch(i,mid) ----- [2018-11-23 07:01:57,098 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_611d9611-f465-4e6c-8bb4-4c415009fe4d/bin-2019/uautomizer/witness.graphml [2018-11-23 07:01:57,098 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:01:57,099 INFO L168 Benchmark]: Toolchain (without parser) took 836.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 953.8 MB in the beginning and 1.0 GB in the end (delta: -85.4 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:01:57,100 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:01:57,100 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.29 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:01:57,101 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.28 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:01:57,101 INFO L168 Benchmark]: Boogie Preprocessor took 10.30 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:01:57,102 INFO L168 Benchmark]: RCFGBuilder took 173.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -139.1 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-23 07:01:57,102 INFO L168 Benchmark]: BuchiAutomizer took 452.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 36.9 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. [2018-11-23 07:01:57,103 INFO L168 Benchmark]: Witness Printer took 34.37 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:01:57,105 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 144.29 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.28 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.30 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 173.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -139.1 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 452.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 36.9 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. * Witness Printer took 34.37 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Trivial decomposition into one nonterminating module. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.4s and 1 iterations. TraceHistogramMax:1. Analysis of lassos took 0.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: No data available LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 8]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {\old(j)=0, \result=0, \result=0, \old(i)=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@79adbf14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@76b6278b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@509bfcec=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@412fcbce=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3d7a0d65=0, NULL=0, i=0, mid=0, j=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@102210c6=5, x=0, y=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 8]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; [?] assume !!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823); [?] assume !!(-1073741823 <= main_~y~0 && main_~y~0 <= 1073741823); [?] CALL call main_#t~ret5 := bsearch(main_~x~0, main_~y~0); [?] havoc main_#res; [?] havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~x~0, main_~y~0; [L19] main_~x~0 := main_#t~nondet3; [L19] havoc main_#t~nondet3; [L20] main_~y~0 := main_#t~nondet4; [L20] havoc main_#t~nondet4; [L22] assume !!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823); [L23] assume !!(-1073741823 <= main_~y~0 && main_~y~0 <= 1073741823); [L24] CALL call main_#t~ret5 := bsearch(main_~x~0, main_~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~x~0, main_~y~0; [L19] main_~x~0 := main_#t~nondet3; [L19] havoc main_#t~nondet3; [L20] main_~y~0 := main_#t~nondet4; [L20] havoc main_#t~nondet4; [L22] assume !!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823); [L23] assume !!(-1073741823 <= main_~y~0 && main_~y~0 <= 1073741823); [L24] CALL call main_#t~ret5 := bsearch(main_~x~0, main_~y~0); [?] havoc main_#res; [?] havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~x~0, main_~y~0; [L19] main_~x~0 := main_#t~nondet3; [L19] havoc main_#t~nondet3; [L20] main_~y~0 := main_#t~nondet4; [L20] havoc main_#t~nondet4; [L22] COND FALSE !(!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823)) [L23] COND FALSE !(!(-1073741823 <= main_~y~0 && main_~y~0 <= 1073741823)) [L24] CALL call main_#t~ret5 := bsearch(main_~x~0, main_~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~x~0, main_~y~0; [L19] main_~x~0 := main_#t~nondet3; [L19] havoc main_#t~nondet3; [L20] main_~y~0 := main_#t~nondet4; [L20] havoc main_#t~nondet4; [L22] COND FALSE !(!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823)) [L23] COND FALSE !(!(-1073741823 <= main_~y~0 && main_~y~0 <= 1073741823)) [L24] CALL call main_#t~ret5 := bsearch(main_~x~0, main_~y~0); [L19] ~x~0 := #t~nondet3; [L19] havoc #t~nondet3; [L20] ~y~0 := #t~nondet4; [L20] havoc #t~nondet4; [L22] COND FALSE !(!(-1073741823 <= ~x~0 && ~x~0 <= 1073741823)) [L23] COND FALSE !(!(-1073741823 <= ~y~0 && ~y~0 <= 1073741823)) [L24] CALL call #t~ret5 := bsearch(~x~0, ~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L19] ~x~0 := #t~nondet3; [L19] havoc #t~nondet3; [L20] ~y~0 := #t~nondet4; [L20] havoc #t~nondet4; [L22] COND FALSE !(!(-1073741823 <= ~x~0 && ~x~0 <= 1073741823)) [L23] COND FALSE !(!(-1073741823 <= ~y~0 && ~y~0 <= 1073741823)) [L24] CALL call #t~ret5 := bsearch(~x~0, ~y~0); [L19] int x = __VERIFIER_nondet_int(); [L20] int y = __VERIFIER_nondet_int(); [L22] COND FALSE !(!(-1073741823<=x && x<=1073741823)) [L23] COND FALSE !(!(-1073741823<=y && y<=1073741823)) [L24] CALL bsearch(x, y) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~i := #in~i;~j := #in~j; [?] assume !(~i >= ~j);~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [?] assume 0 != #t~nondet0;havoc #t~nondet0; [?] CALL call #t~ret1 := bsearch(~i, ~mid~0); [L8-L15] ~i := #in~i; [L8-L15] ~j := #in~j; [L10] assume !(~i >= ~j); [L11] ~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [L12-L13] assume 0 != #t~nondet0; [L12] havoc #t~nondet0; [L13] CALL call #t~ret1 := bsearch(~i, ~mid~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L8-L15] ~i := #in~i; [L8-L15] ~j := #in~j; [L10] assume !(~i >= ~j); [L11] ~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [L12-L13] assume 0 != #t~nondet0; [L12] havoc #t~nondet0; [L13] CALL call #t~ret1 := bsearch(~i, ~mid~0); [L8-L15] ~i := #in~i; [L8-L15] ~j := #in~j; [L10] COND FALSE !(~i >= ~j) [L11] ~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [L12-L13] COND TRUE 0 != #t~nondet0 [L12] havoc #t~nondet0; [L13] CALL call #t~ret1 := bsearch(~i, ~mid~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L8-L15] ~i := #in~i; [L8-L15] ~j := #in~j; [L10] COND FALSE !(~i >= ~j) [L11] ~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [L12-L13] COND TRUE 0 != #t~nondet0 [L12] havoc #t~nondet0; [L13] CALL call #t~ret1 := bsearch(~i, ~mid~0); [L8-L15] ~i := #in~i; [L8-L15] ~j := #in~j; [L10] COND FALSE !(~i >= ~j) [L11] ~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [L12-L13] COND TRUE 0 != #t~nondet0 [L12] havoc #t~nondet0; [L13] CALL call #t~ret1 := bsearch(~i, ~mid~0); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L8-L15] ~i := #in~i; [L8-L15] ~j := #in~j; [L10] COND FALSE !(~i >= ~j) [L11] ~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [L12-L13] COND TRUE 0 != #t~nondet0 [L12] havoc #t~nondet0; [L13] CALL call #t~ret1 := bsearch(~i, ~mid~0); [L10] COND FALSE !(i>=j) [L11] int mid = (i+j)/2; [L12] COND TRUE __VERIFIER_nondet_int() [L13] CALL bsearch(i,mid) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; [?] assume !!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823); [?] assume !!(-1073741823 <= main_~y~0 && main_~y~0 <= 1073741823); [?] CALL call main_#t~ret5 := bsearch(main_~x~0, main_~y~0); [?] havoc main_#res; [?] havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~x~0, main_~y~0; [L19] main_~x~0 := main_#t~nondet3; [L19] havoc main_#t~nondet3; [L20] main_~y~0 := main_#t~nondet4; [L20] havoc main_#t~nondet4; [L22] assume !!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823); [L23] assume !!(-1073741823 <= main_~y~0 && main_~y~0 <= 1073741823); [L24] CALL call main_#t~ret5 := bsearch(main_~x~0, main_~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~x~0, main_~y~0; [L19] main_~x~0 := main_#t~nondet3; [L19] havoc main_#t~nondet3; [L20] main_~y~0 := main_#t~nondet4; [L20] havoc main_#t~nondet4; [L22] assume !!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823); [L23] assume !!(-1073741823 <= main_~y~0 && main_~y~0 <= 1073741823); [L24] CALL call main_#t~ret5 := bsearch(main_~x~0, main_~y~0); [?] havoc main_#res; [?] havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~x~0, main_~y~0; [L19] main_~x~0 := main_#t~nondet3; [L19] havoc main_#t~nondet3; [L20] main_~y~0 := main_#t~nondet4; [L20] havoc main_#t~nondet4; [L22] COND FALSE !(!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823)) [L23] COND FALSE !(!(-1073741823 <= main_~y~0 && main_~y~0 <= 1073741823)) [L24] CALL call main_#t~ret5 := bsearch(main_~x~0, main_~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~x~0, main_~y~0; [L19] main_~x~0 := main_#t~nondet3; [L19] havoc main_#t~nondet3; [L20] main_~y~0 := main_#t~nondet4; [L20] havoc main_#t~nondet4; [L22] COND FALSE !(!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823)) [L23] COND FALSE !(!(-1073741823 <= main_~y~0 && main_~y~0 <= 1073741823)) [L24] CALL call main_#t~ret5 := bsearch(main_~x~0, main_~y~0); [L19] ~x~0 := #t~nondet3; [L19] havoc #t~nondet3; [L20] ~y~0 := #t~nondet4; [L20] havoc #t~nondet4; [L22] COND FALSE !(!(-1073741823 <= ~x~0 && ~x~0 <= 1073741823)) [L23] COND FALSE !(!(-1073741823 <= ~y~0 && ~y~0 <= 1073741823)) [L24] CALL call #t~ret5 := bsearch(~x~0, ~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L19] ~x~0 := #t~nondet3; [L19] havoc #t~nondet3; [L20] ~y~0 := #t~nondet4; [L20] havoc #t~nondet4; [L22] COND FALSE !(!(-1073741823 <= ~x~0 && ~x~0 <= 1073741823)) [L23] COND FALSE !(!(-1073741823 <= ~y~0 && ~y~0 <= 1073741823)) [L24] CALL call #t~ret5 := bsearch(~x~0, ~y~0); [L19] int x = __VERIFIER_nondet_int(); [L20] int y = __VERIFIER_nondet_int(); [L22] COND FALSE !(!(-1073741823<=x && x<=1073741823)) [L23] COND FALSE !(!(-1073741823<=y && y<=1073741823)) [L24] CALL bsearch(x, y) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~i := #in~i;~j := #in~j; [?] assume !(~i >= ~j);~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [?] assume 0 != #t~nondet0;havoc #t~nondet0; [?] CALL call #t~ret1 := bsearch(~i, ~mid~0); [L8-L15] ~i := #in~i; [L8-L15] ~j := #in~j; [L10] assume !(~i >= ~j); [L11] ~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [L12-L13] assume 0 != #t~nondet0; [L12] havoc #t~nondet0; [L13] CALL call #t~ret1 := bsearch(~i, ~mid~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L8-L15] ~i := #in~i; [L8-L15] ~j := #in~j; [L10] assume !(~i >= ~j); [L11] ~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [L12-L13] assume 0 != #t~nondet0; [L12] havoc #t~nondet0; [L13] CALL call #t~ret1 := bsearch(~i, ~mid~0); [L8-L15] ~i := #in~i; [L8-L15] ~j := #in~j; [L10] COND FALSE !(~i >= ~j) [L11] ~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [L12-L13] COND TRUE 0 != #t~nondet0 [L12] havoc #t~nondet0; [L13] CALL call #t~ret1 := bsearch(~i, ~mid~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L8-L15] ~i := #in~i; [L8-L15] ~j := #in~j; [L10] COND FALSE !(~i >= ~j) [L11] ~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [L12-L13] COND TRUE 0 != #t~nondet0 [L12] havoc #t~nondet0; [L13] CALL call #t~ret1 := bsearch(~i, ~mid~0); [L8-L15] ~i := #in~i; [L8-L15] ~j := #in~j; [L10] COND FALSE !(~i >= ~j) [L11] ~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [L12-L13] COND TRUE 0 != #t~nondet0 [L12] havoc #t~nondet0; [L13] CALL call #t~ret1 := bsearch(~i, ~mid~0); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L8-L15] ~i := #in~i; [L8-L15] ~j := #in~j; [L10] COND FALSE !(~i >= ~j) [L11] ~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); [L12-L13] COND TRUE 0 != #t~nondet0 [L12] havoc #t~nondet0; [L13] CALL call #t~ret1 := bsearch(~i, ~mid~0); [L10] COND FALSE !(i>=j) [L11] int mid = (i+j)/2; [L12] COND TRUE __VERIFIER_nondet_int() [L13] CALL bsearch(i,mid) ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L19] int x = __VERIFIER_nondet_int(); [L20] int y = __VERIFIER_nondet_int(); [L22] COND FALSE !(!(-1073741823<=x && x<=1073741823)) [L23] COND FALSE !(!(-1073741823<=y && y<=1073741823)) [L24] CALL bsearch(x, y) Loop: [L10] COND FALSE !(i>=j) [L11] int mid = (i+j)/2; [L12] COND TRUE __VERIFIER_nondet_int() [L13] CALL bsearch(i,mid) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...