./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/Binary_Search-2.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted/Binary_Search-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 c62b8cd14983fa4dda29102c5113315628115eea4aa89f3549fa0abedadf594b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:23:11,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:23:11,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:23:11,332 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:23:11,332 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:23:11,333 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:23:11,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:23:11,345 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:23:11,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:23:11,347 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:23:11,347 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:23:11,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:23:11,364 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:23:11,364 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:23:11,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:23:11,366 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:23:11,367 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:23:11,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:23:11,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:23:11,369 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:23:11,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:23:11,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:23:11,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:23:11,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:23:11,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:23:11,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:23:11,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:23:11,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:23:11,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:23:11,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:23:11,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:23:11,383 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:23:11,383 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:23:11,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:23:11,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:23:11,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:23:11,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:23:11,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:23:11,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:23:11,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:23:11,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:23:11,388 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:23:11,412 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:23:11,412 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:23:11,413 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:23:11,413 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:23:11,415 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:23:11,415 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:23:11,415 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:23:11,415 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:23:11,415 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:23:11,415 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:23:11,422 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:23:11,422 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:23:11,422 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:23:11,422 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:23:11,423 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:23:11,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:23:11,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:23:11,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:23:11,423 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:23:11,423 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:23:11,423 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:23:11,424 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:23:11,424 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:23:11,424 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:23:11,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:23:11,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:23:11,424 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:23:11,424 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:23:11,425 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:23:11,425 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> c62b8cd14983fa4dda29102c5113315628115eea4aa89f3549fa0abedadf594b [2022-02-21 03:23:11,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:23:11,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:23:11,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:23:11,621 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:23:11,621 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:23:11,622 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/Binary_Search-2.c [2022-02-21 03:23:11,666 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1b5ec846/7c0fd8827784417982e23692c99ff0ea/FLAG2c1e925f3 [2022-02-21 03:23:12,066 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:23:12,067 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/Binary_Search-2.c [2022-02-21 03:23:12,084 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1b5ec846/7c0fd8827784417982e23692c99ff0ea/FLAG2c1e925f3 [2022-02-21 03:23:12,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1b5ec846/7c0fd8827784417982e23692c99ff0ea [2022-02-21 03:23:12,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:23:12,114 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:23:12,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:23:12,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:23:12,122 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:23:12,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:23:12" (1/1) ... [2022-02-21 03:23:12,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f6c3309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:12, skipping insertion in model container [2022-02-21 03:23:12,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:23:12" (1/1) ... [2022-02-21 03:23:12,135 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:23:12,143 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:23:12,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:23:12,263 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:23:12,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:23:12,328 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:23:12,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:12 WrapperNode [2022-02-21 03:23:12,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:23:12,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:23:12,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:23:12,330 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:23:12,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:12" (1/1) ... [2022-02-21 03:23:12,340 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:12" (1/1) ... [2022-02-21 03:23:12,360 INFO L137 Inliner]: procedures = 5, calls = 5, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 14 [2022-02-21 03:23:12,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:23:12,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:23:12,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:23:12,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:23:12,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:12" (1/1) ... [2022-02-21 03:23:12,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:12" (1/1) ... [2022-02-21 03:23:12,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:12" (1/1) ... [2022-02-21 03:23:12,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:12" (1/1) ... [2022-02-21 03:23:12,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:12" (1/1) ... [2022-02-21 03:23:12,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:12" (1/1) ... [2022-02-21 03:23:12,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:12" (1/1) ... [2022-02-21 03:23:12,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:23:12,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:23:12,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:23:12,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:23:12,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:12" (1/1) ... [2022-02-21 03:23:12,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:12,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:12,424 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:12,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:23:12,452 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2022-02-21 03:23:12,453 INFO L138 BoogieDeclarations]: Found implementation of procedure bsearch [2022-02-21 03:23:12,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:23:12,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:23:12,498 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:23:12,499 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:23:12,648 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:23:12,654 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:23:12,654 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 03:23:12,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:23:12 BoogieIcfgContainer [2022-02-21 03:23:12,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:23:12,658 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:23:12,658 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:23:12,661 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:23:12,662 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:12,663 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:23:12" (1/3) ... [2022-02-21 03:23:12,666 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2323aa20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:23:12, skipping insertion in model container [2022-02-21 03:23:12,666 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:12,666 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:12" (2/3) ... [2022-02-21 03:23:12,667 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2323aa20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:23:12, skipping insertion in model container [2022-02-21 03:23:12,667 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:12,667 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:23:12" (3/3) ... [2022-02-21 03:23:12,668 INFO L388 chiAutomizerObserver]: Analyzing ICFG Binary_Search-2.c [2022-02-21 03:23:12,716 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:23:12,717 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:23:12,717 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:23:12,717 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:23:12,717 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:23:12,717 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:23:12,717 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:23:12,717 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:23:12,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:23:12,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:23:12,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:12,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:12,757 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:23:12,757 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:23:12,758 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:23:12,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:23:12,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:23:12,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:12,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:12,767 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:23:12,767 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:23:12,771 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11#L22true assume !!(-1073741823 <= main_~x~0#1 && main_~x~0#1 <= 1073741823); 16#L23true assume !!(-1073741823 <= main_~y~0#1 && main_~y~0#1 <= 1073741823); 19#L24true call main_#t~ret5#1 := bsearch(main_~x~0#1, main_~y~0#1);< 6#bsearchENTRYtrue [2022-02-21 03:23:12,772 INFO L793 eck$LassoCheckResult]: Loop: 6#bsearchENTRYtrue ~i := #in~i;~j := #in~j; 17#L10true assume !(~i >= ~j);~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); 18#L12true assume !(0 != #t~nondet0);havoc #t~nondet0; 5#L14true call #t~ret2 := bsearch(1 + ~mid~0, ~j);< 6#bsearchENTRYtrue [2022-02-21 03:23:12,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:12,776 INFO L85 PathProgramCache]: Analyzing trace with hash 42056124, now seen corresponding path program 1 times [2022-02-21 03:23:12,783 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:12,784 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473614979] [2022-02-21 03:23:12,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:12,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:12,845 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:12,871 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:12,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:12,873 INFO L85 PathProgramCache]: Analyzing trace with hash 927709, now seen corresponding path program 1 times [2022-02-21 03:23:12,874 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:12,875 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757330673] [2022-02-21 03:23:12,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:12,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:12,914 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:12,937 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:12,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:12,940 INFO L85 PathProgramCache]: Analyzing trace with hash 324439064, now seen corresponding path program 1 times [2022-02-21 03:23:12,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:12,941 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183810102] [2022-02-21 03:23:12,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:12,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:12,969 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:12,982 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:20,886 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:20,886 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:20,887 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:20,887 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:20,887 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:23:20,887 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:20,887 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:20,887 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:20,887 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binary_Search-2.c_Iteration1_Loop [2022-02-21 03:23:20,887 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:20,888 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:20,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:20,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:20,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:20,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:20,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:20,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:20,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:20,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:21,299 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:21,300 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:23:21,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:21,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:21,317 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:21,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:23:21,333 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:21,333 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:21,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:21,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:21,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:21,413 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:21,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:23:21,416 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:23:21,416 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:25,044 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:23:25,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:25,051 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:25,052 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:25,052 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:25,052 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:25,052 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:23:25,052 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:25,052 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:25,052 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:25,052 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binary_Search-2.c_Iteration1_Loop [2022-02-21 03:23:25,052 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:25,052 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:25,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:25,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:25,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:25,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:25,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:25,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:25,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:25,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:25,414 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:25,418 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:23:25,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:25,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:25,420 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:25,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:23:25,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:25,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:25,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:25,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:25,431 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2022-02-21 03:23:25,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:25,436 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:23:25,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:25,451 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:23:25,456 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:23:25,456 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:23:25,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:25,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:25,483 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:25,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:23:25,512 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:23:25,512 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:23:25,513 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:23:25,513 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(bsearch_#in~j, bsearch_#in~i) = 1*bsearch_#in~j - 1*bsearch_#in~i Supporting invariants [] [2022-02-21 03:23:25,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:25,539 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:23:25,543 INFO L390 LassoCheck]: Loop: "~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 #t~ret2 := bsearch(1 + ~mid~0, ~j);"< [2022-02-21 03:23:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:25,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:25,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:23:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:25,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:25,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#unseeded} assume { :begin_inline_ULTIMATE.init } true; {28#unseeded} is VALID [2022-02-21 03:23:25,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {28#unseeded} is VALID [2022-02-21 03:23:25,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#unseeded} assume !!(-1073741823 <= main_~x~0#1 && main_~x~0#1 <= 1073741823); {28#unseeded} is VALID [2022-02-21 03:23:25,600 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#unseeded} assume !!(-1073741823 <= main_~y~0#1 && main_~y~0#1 <= 1073741823); {28#unseeded} is VALID [2022-02-21 03:23:25,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#unseeded} call main_#t~ret5#1 := bsearch(main_~x~0#1, main_~y~0#1); {28#unseeded} is VALID [2022-02-21 03:23:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:25,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:23:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:25,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:25,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:26,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(>= oldRank0 (+ (* (- 1) |bsearch_#in~i|) |bsearch_#in~j|))} ~i := #in~i;~j := #in~j; {58#(<= bsearch_~j (+ bsearch_~i oldRank0))} is VALID [2022-02-21 03:23:26,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#(<= bsearch_~j (+ bsearch_~i oldRank0))} assume !(~i >= ~j);~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); {62#(or (and (< (+ (div (+ oldRank0 1) (- 2)) bsearch_~j) bsearch_~mid~0) (< (+ (* (div (+ oldRank0 1) (- 2)) 2) 1) 0)) (and (< (+ bsearch_~j (div oldRank0 (- 2))) (+ bsearch_~mid~0 1)) (< (div oldRank0 (- 2)) 0)) (and (< (+ (div (+ oldRank0 1) (- 2)) bsearch_~j) (+ bsearch_~mid~0 1)) (< (div (+ oldRank0 1) (- 2)) 0) (< 0 (+ bsearch_~mid~0 1))))} is VALID [2022-02-21 03:23:26,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {62#(or (and (< (+ (div (+ oldRank0 1) (- 2)) bsearch_~j) bsearch_~mid~0) (< (+ (* (div (+ oldRank0 1) (- 2)) 2) 1) 0)) (and (< (+ bsearch_~j (div oldRank0 (- 2))) (+ bsearch_~mid~0 1)) (< (div oldRank0 (- 2)) 0)) (and (< (+ (div (+ oldRank0 1) (- 2)) bsearch_~j) (+ bsearch_~mid~0 1)) (< (div (+ oldRank0 1) (- 2)) 0) (< 0 (+ bsearch_~mid~0 1))))} assume !(0 != #t~nondet0);havoc #t~nondet0; {62#(or (and (< (+ (div (+ oldRank0 1) (- 2)) bsearch_~j) bsearch_~mid~0) (< (+ (* (div (+ oldRank0 1) (- 2)) 2) 1) 0)) (and (< (+ bsearch_~j (div oldRank0 (- 2))) (+ bsearch_~mid~0 1)) (< (div oldRank0 (- 2)) 0)) (and (< (+ (div (+ oldRank0 1) (- 2)) bsearch_~j) (+ bsearch_~mid~0 1)) (< (div (+ oldRank0 1) (- 2)) 0) (< 0 (+ bsearch_~mid~0 1))))} is VALID [2022-02-21 03:23:26,331 INFO L272 TraceCheckUtils]: 3: Hoare triple {62#(or (and (< (+ (div (+ oldRank0 1) (- 2)) bsearch_~j) bsearch_~mid~0) (< (+ (* (div (+ oldRank0 1) (- 2)) 2) 1) 0)) (and (< (+ bsearch_~j (div oldRank0 (- 2))) (+ bsearch_~mid~0 1)) (< (div oldRank0 (- 2)) 0)) (and (< (+ (div (+ oldRank0 1) (- 2)) bsearch_~j) (+ bsearch_~mid~0 1)) (< (div (+ oldRank0 1) (- 2)) 0) (< 0 (+ bsearch_~mid~0 1))))} call #t~ret2 := bsearch(1 + ~mid~0, ~j); {41#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |bsearch_#in~i|) |bsearch_#in~j|))))} is VALID [2022-02-21 03:23:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:26,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:26,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:26,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:23:26,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,366 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:23:26,367 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:26,532 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3). Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 47 states and 60 transitions. Complement of second has 12 states. [2022-02-21 03:23:26,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:23:26,532 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:26,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:23:26,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:23:26,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:26,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:26,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:26,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:26,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:26,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:26,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 60 transitions. [2022-02-21 03:23:26,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:23:26,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:26,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:26,541 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:23:26,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:23:26,544 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:23:26,544 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:26,545 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:26,545 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:23:26,545 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 47 states and 60 transitions. cyclomatic complexity: 15 [2022-02-21 03:23:26,546 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:23:26,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:23:26,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:23:26,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 60 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:23:26,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:23:26,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:23:26,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 60 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:23:26,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:23:26,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:23:26,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 60 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:23:26,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 47 letters. Loop has 47 letters. [2022-02-21 03:23:26,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 47 letters. [2022-02-21 03:23:26,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 60 transitions. cyclomatic complexity: 15 Stem has 47 letters. Loop has 47 letters. [2022-02-21 03:23:26,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:23:26,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:23:26,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 60 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:23:26,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:26,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:26,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 60 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:26,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:23:26,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:23:26,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 60 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:23:26,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:23:26,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:23:26,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 60 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:23:26,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:23:26,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:23:26,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 60 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:23:26,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:23:26,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:23:26,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 60 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:23:26,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:23:26,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:23:26,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 60 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:23:26,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:23:26,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:23:26,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 60 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:23:26,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:23:26,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:23:26,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 60 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:23:26,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:23:26,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:23:26,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 60 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:23:26,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:23:26,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:23:26,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 60 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:23:26,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:23:26,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:23:26,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 60 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:23:26,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:23:26,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:23:26,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 60 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:23:26,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,564 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:26,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-02-21 03:23:26,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:23:26,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:23:26,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:23:26,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:26,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 60 transitions. cyclomatic complexity: 15 [2022-02-21 03:23:26,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:23:26,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 24 states and 27 transitions. [2022-02-21 03:23:26,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-02-21 03:23:26,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-02-21 03:23:26,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2022-02-21 03:23:26,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:26,580 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-02-21 03:23:26,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2022-02-21 03:23:26,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2022-02-21 03:23:26,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:26,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 27 transitions. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:26,598 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 27 transitions. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:26,599 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:26,601 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:26,603 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-02-21 03:23:26,604 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-21 03:23:26,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:26,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:26,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 24 states and 27 transitions. [2022-02-21 03:23:26,605 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 24 states and 27 transitions. [2022-02-21 03:23:26,605 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:26,608 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-02-21 03:23:26,608 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-02-21 03:23:26,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:26,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:26,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:26,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:26,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-02-21 03:23:26,611 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-21 03:23:26,611 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-21 03:23:26,611 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:23:26,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2022-02-21 03:23:26,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:23:26,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:26,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:26,612 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:26,612 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:23:26,612 INFO L791 eck$LassoCheckResult]: Stem: 135#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 136#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 133#L22 assume !!(-1073741823 <= main_~x~0#1 && main_~x~0#1 <= 1073741823); 134#L23 assume !!(-1073741823 <= main_~y~0#1 && main_~y~0#1 <= 1073741823); 141#L24 call main_#t~ret5#1 := bsearch(main_~x~0#1, main_~y~0#1);< 143#bsearchENTRY ~i := #in~i;~j := #in~j; 145#L10 assume !(~i >= ~j);~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); 146#L12 assume 0 != #t~nondet0;havoc #t~nondet0; 138#L13 [2022-02-21 03:23:26,613 INFO L793 eck$LassoCheckResult]: Loop: 138#L13 call #t~ret1 := bsearch(~i, ~mid~0);< 139#bsearchENTRY ~i := #in~i;~j := #in~j; 149#L10 assume !(~i >= ~j);~mid~0 := (if ~i + ~j < 0 && 0 != (~i + ~j) % 2 then 1 + (~i + ~j) / 2 else (~i + ~j) / 2); 148#L12 assume 0 != #t~nondet0;havoc #t~nondet0; 138#L13 [2022-02-21 03:23:26,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:26,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1236460217, now seen corresponding path program 1 times [2022-02-21 03:23:26,613 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:26,613 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928190428] [2022-02-21 03:23:26,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:26,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:26,623 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:26,630 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:26,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:26,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1876964, now seen corresponding path program 1 times [2022-02-21 03:23:26,631 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:26,631 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139592631] [2022-02-21 03:23:26,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:26,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:26,637 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:26,641 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:26,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:26,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1684909610, now seen corresponding path program 1 times [2022-02-21 03:23:26,642 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:26,642 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395152479] [2022-02-21 03:23:26,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:26,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:26,655 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:26,665 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:27,226 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret5 := bsearch(~x~0, ~y~0); [2022-02-21 03:23:27,227 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.NonterminatingLassoResult.getLongDescription(NonterminatingLassoResult.java:69) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.reportResult(BuchiAutomizerObserver.java:374) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.interpretAndReportResult(BuchiAutomizerObserver.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 03:23:27,237 INFO L158 Benchmark]: Toolchain (without parser) took 15122.98ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 78.1MB in the beginning and 71.1MB in the end (delta: 7.0MB). Peak memory consumption was 68.5MB. Max. memory is 16.1GB. [2022-02-21 03:23:27,237 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 73.4MB. Free memory is still 45.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:23:27,238 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.10ms. Allocated memory is still 98.6MB. Free memory was 77.9MB in the beginning and 77.8MB in the end (delta: 89.4kB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2022-02-21 03:23:27,238 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.62ms. Allocated memory is still 98.6MB. Free memory was 77.8MB in the beginning and 76.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:23:27,239 INFO L158 Benchmark]: Boogie Preprocessor took 19.41ms. Allocated memory is still 98.6MB. Free memory was 76.5MB in the beginning and 75.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:23:27,239 INFO L158 Benchmark]: RCFGBuilder took 269.65ms. Allocated memory is still 98.6MB. Free memory was 75.4MB in the beginning and 65.5MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:23:27,239 INFO L158 Benchmark]: BuchiAutomizer took 14578.24ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 65.5MB in the beginning and 71.1MB in the end (delta: -5.7MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. [2022-02-21 03:23:27,241 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 73.4MB. Free memory is still 45.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.10ms. Allocated memory is still 98.6MB. Free memory was 77.9MB in the beginning and 77.8MB in the end (delta: 89.4kB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.62ms. Allocated memory is still 98.6MB. Free memory was 77.8MB in the beginning and 76.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.41ms. Allocated memory is still 98.6MB. Free memory was 76.5MB in the beginning and 75.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 269.65ms. Allocated memory is still 98.6MB. Free memory was 75.4MB in the beginning and 65.5MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 14578.24ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 65.5MB in the beginning and 71.1MB in the end (delta: -5.7MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * \old(i) + \old(j) and consists of 4 locations. The remainder module has 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.5s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 13.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 14 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital62 mio100 ax100 hnf100 lsp141 ukn73 mio100 lsp100 div204 bol100 ite100 ukn100 eq137 hnf98 smp57 dnf253 smp59 tf101 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 94ms VariablesStem: 0 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 3.7s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 13]: 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 {y=0, \old(j)=0, \result=0, \old(i)=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4507d239=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5bdfde52=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@f3fbb55=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b248036=0, x=0, i=-1, mid=0, j=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@20988a63=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1fe05931=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 03:23:27,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator