./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/heapsort.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/loop-invgen/heapsort.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 149fdbbcb5d1f0b05c2de89b523b2d2cfc590a6f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-906a4fb [2020-10-19 19:13:01,170 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 19:13:01,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 19:13:01,197 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 19:13:01,197 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 19:13:01,198 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 19:13:01,200 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 19:13:01,202 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 19:13:01,203 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 19:13:01,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 19:13:01,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 19:13:01,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 19:13:01,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 19:13:01,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 19:13:01,209 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 19:13:01,210 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 19:13:01,211 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 19:13:01,212 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 19:13:01,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 19:13:01,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 19:13:01,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 19:13:01,219 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 19:13:01,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 19:13:01,222 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 19:13:01,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 19:13:01,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 19:13:01,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 19:13:01,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 19:13:01,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 19:13:01,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 19:13:01,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 19:13:01,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 19:13:01,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 19:13:01,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 19:13:01,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 19:13:01,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 19:13:01,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 19:13:01,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 19:13:01,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 19:13:01,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 19:13:01,247 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 19:13:01,249 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-19 19:13:01,293 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 19:13:01,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 19:13:01,295 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 19:13:01,296 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 19:13:01,296 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 19:13:01,296 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 19:13:01,297 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 19:13:01,297 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 19:13:01,297 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 19:13:01,297 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 19:13:01,298 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 19:13:01,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 19:13:01,299 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 19:13:01,299 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 19:13:01,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 19:13:01,301 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 19:13:01,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 19:13:01,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 19:13:01,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 19:13:01,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 19:13:01,302 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 19:13:01,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 19:13:01,302 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 19:13:01,303 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 19:13:01,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 19:13:01,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 19:13:01,304 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 19:13:01,304 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 19:13:01,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 19:13:01,305 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 19:13:01,305 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 19:13:01,305 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 19:13:01,307 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 19:13:01,307 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 149fdbbcb5d1f0b05c2de89b523b2d2cfc590a6f [2020-10-19 19:13:01,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 19:13:01,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 19:13:01,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 19:13:01,633 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 19:13:01,633 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 19:13:01,634 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/heapsort.i [2020-10-19 19:13:01,692 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7972ffc6/dee616975f694dc5985e621cc1a54d90/FLAG1f6de96b9 [2020-10-19 19:13:02,125 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 19:13:02,127 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i [2020-10-19 19:13:02,139 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7972ffc6/dee616975f694dc5985e621cc1a54d90/FLAG1f6de96b9 [2020-10-19 19:13:02,438 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7972ffc6/dee616975f694dc5985e621cc1a54d90 [2020-10-19 19:13:02,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 19:13:02,448 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 19:13:02,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 19:13:02,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 19:13:02,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 19:13:02,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 07:13:02" (1/1) ... [2020-10-19 19:13:02,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31819264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:13:02, skipping insertion in model container [2020-10-19 19:13:02,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 07:13:02" (1/1) ... [2020-10-19 19:13:02,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 19:13:02,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 19:13:02,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 19:13:02,675 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 19:13:02,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 19:13:02,710 INFO L208 MainTranslator]: Completed translation [2020-10-19 19:13:02,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:13:02 WrapperNode [2020-10-19 19:13:02,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 19:13:02,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 19:13:02,711 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 19:13:02,712 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 19:13:02,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:13:02" (1/1) ... [2020-10-19 19:13:02,798 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:13:02" (1/1) ... [2020-10-19 19:13:02,826 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 19:13:02,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 19:13:02,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 19:13:02,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 19:13:02,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:13:02" (1/1) ... [2020-10-19 19:13:02,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:13:02" (1/1) ... [2020-10-19 19:13:02,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:13:02" (1/1) ... [2020-10-19 19:13:02,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:13:02" (1/1) ... [2020-10-19 19:13:02,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:13:02" (1/1) ... [2020-10-19 19:13:02,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:13:02" (1/1) ... [2020-10-19 19:13:02,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:13:02" (1/1) ... [2020-10-19 19:13:02,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 19:13:02,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 19:13:02,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 19:13:02,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 19:13:02,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:13:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:02,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-19 19:13:02,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 19:13:02,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 19:13:02,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 19:13:03,350 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 19:13:03,351 INFO L298 CfgBuilder]: Removed 62 assume(true) statements. [2020-10-19 19:13:03,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 07:13:03 BoogieIcfgContainer [2020-10-19 19:13:03,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 19:13:03,354 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 19:13:03,354 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 19:13:03,359 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 19:13:03,360 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 19:13:03,360 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 07:13:02" (1/3) ... [2020-10-19 19:13:03,362 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54dc6323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 07:13:03, skipping insertion in model container [2020-10-19 19:13:03,362 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 19:13:03,362 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:13:02" (2/3) ... [2020-10-19 19:13:03,363 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54dc6323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 07:13:03, skipping insertion in model container [2020-10-19 19:13:03,363 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 19:13:03,363 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 07:13:03" (3/3) ... [2020-10-19 19:13:03,365 INFO L373 chiAutomizerObserver]: Analyzing ICFG heapsort.i [2020-10-19 19:13:03,421 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 19:13:03,422 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 19:13:03,422 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 19:13:03,422 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 19:13:03,423 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 19:13:03,423 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 19:13:03,423 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 19:13:03,423 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 19:13:03,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states. [2020-10-19 19:13:03,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2020-10-19 19:13:03,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:13:03,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:13:03,514 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 19:13:03,515 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:13:03,515 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 19:13:03,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states. [2020-10-19 19:13:03,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2020-10-19 19:13:03,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:13:03,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:13:03,526 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 19:13:03,526 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:13:03,534 INFO L794 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 16#L-1true main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~nondet6, main_#t~nondet7, main_#t~post8, main_#t~post9, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 54#L27true assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 36#L30true assume !(main_~l~0 > 1);main_#t~post5 := main_~r~0;main_~r~0 := main_#t~post5 - 1;havoc main_#t~post5; 27#L59-1true [2020-10-19 19:13:03,535 INFO L796 eck$LassoCheckResult]: Loop: 27#L59-1true assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 68#L38-2true assume !true; 66#L38-3true assume !(main_~l~0 > 1);__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 49#L18-36true assume !(0 == __VERIFIER_assert_~cond); 45#L18-38true __VERIFIER_assert_#in~cond := (if main_~r~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 42#L18-39true assume !(0 == __VERIFIER_assert_~cond); 15#L18-41true main_#t~post9 := main_~r~0;main_~r~0 := main_#t~post9 - 1;havoc main_#t~post9; 27#L59-1true [2020-10-19 19:13:03,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:03,542 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2020-10-19 19:13:03,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:03,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307255206] [2020-10-19 19:13:03,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:03,665 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:03,688 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:03,711 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:03,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:03,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1098383874, now seen corresponding path program 1 times [2020-10-19 19:13:03,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:03,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916334132] [2020-10-19 19:13:03,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:03,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:03,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916334132] [2020-10-19 19:13:03,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:13:03,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 19:13:03,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886353580] [2020-10-19 19:13:03,764 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 19:13:03,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:13:03,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-19 19:13:03,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-19 19:13:03,784 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 2 states. [2020-10-19 19:13:03,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:13:03,795 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2020-10-19 19:13:03,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-19 19:13:03,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 76 transitions. [2020-10-19 19:13:03,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2020-10-19 19:13:03,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 37 states and 43 transitions. [2020-10-19 19:13:03,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2020-10-19 19:13:03,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2020-10-19 19:13:03,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2020-10-19 19:13:03,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:13:03,809 INFO L691 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2020-10-19 19:13:03,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2020-10-19 19:13:03,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-19 19:13:03,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-19 19:13:03,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2020-10-19 19:13:03,862 INFO L714 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2020-10-19 19:13:03,862 INFO L594 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2020-10-19 19:13:03,862 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 19:13:03,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 43 transitions. [2020-10-19 19:13:03,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2020-10-19 19:13:03,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:13:03,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:13:03,867 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 19:13:03,867 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:13:03,868 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 173#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~nondet6, main_#t~nondet7, main_#t~post8, main_#t~post9, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 166#L27 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 167#L30 assume !(main_~l~0 > 1);main_#t~post5 := main_~r~0;main_~r~0 := main_#t~post5 - 1;havoc main_#t~post5; 172#L59-1 [2020-10-19 19:13:03,868 INFO L796 eck$LassoCheckResult]: Loop: 172#L59-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 177#L38-2 assume !(main_~j~0 <= main_~r~0); 180#L38-3 assume !(main_~l~0 > 1);__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 181#L18-36 assume !(0 == __VERIFIER_assert_~cond); 195#L18-38 __VERIFIER_assert_#in~cond := (if main_~r~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 193#L18-39 assume !(0 == __VERIFIER_assert_~cond); 171#L18-41 main_#t~post9 := main_~r~0;main_~r~0 := main_#t~post9 - 1;havoc main_#t~post9; 172#L59-1 [2020-10-19 19:13:03,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:03,868 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2020-10-19 19:13:03,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:03,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451611758] [2020-10-19 19:13:03,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:03,886 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:03,901 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:03,907 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:03,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:03,908 INFO L82 PathProgramCache]: Analyzing trace with hash -46187520, now seen corresponding path program 1 times [2020-10-19 19:13:03,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:03,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118545299] [2020-10-19 19:13:03,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:03,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:03,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118545299] [2020-10-19 19:13:03,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:13:03,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 19:13:03,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678306451] [2020-10-19 19:13:03,979 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 19:13:03,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:13:03,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 19:13:03,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-19 19:13:03,981 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-10-19 19:13:04,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:13:04,113 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2020-10-19 19:13:04,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 19:13:04,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 81 transitions. [2020-10-19 19:13:04,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2020-10-19 19:13:04,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 81 transitions. [2020-10-19 19:13:04,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2020-10-19 19:13:04,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2020-10-19 19:13:04,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 81 transitions. [2020-10-19 19:13:04,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:13:04,121 INFO L691 BuchiCegarLoop]: Abstraction has 70 states and 81 transitions. [2020-10-19 19:13:04,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 81 transitions. [2020-10-19 19:13:04,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 39. [2020-10-19 19:13:04,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-19 19:13:04,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2020-10-19 19:13:04,125 INFO L714 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2020-10-19 19:13:04,126 INFO L594 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2020-10-19 19:13:04,126 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 19:13:04,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2020-10-19 19:13:04,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2020-10-19 19:13:04,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:13:04,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:13:04,128 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 19:13:04,128 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:13:04,129 INFO L794 eck$LassoCheckResult]: Stem: 307#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 289#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~nondet6, main_#t~nondet7, main_#t~post8, main_#t~post9, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 282#L27 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 283#L30 assume !(main_~l~0 > 1);main_#t~post5 := main_~r~0;main_~r~0 := main_#t~post5 - 1;havoc main_#t~post5; 288#L59-1 [2020-10-19 19:13:04,129 INFO L796 eck$LassoCheckResult]: Loop: 288#L59-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 298#L38-2 assume !(main_~j~0 <= main_~r~0); 296#L38-3 assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 297#L18-30 assume !(0 == __VERIFIER_assert_~cond); 306#L18-32 __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 304#L18-33 assume !(0 == __VERIFIER_assert_~cond); 300#L18-35 main_#t~post8 := main_~l~0;main_~l~0 := main_#t~post8 - 1;havoc main_#t~post8; 288#L59-1 [2020-10-19 19:13:04,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:04,130 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 3 times [2020-10-19 19:13:04,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:04,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882483130] [2020-10-19 19:13:04,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:04,146 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:04,159 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:04,164 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:04,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:04,165 INFO L82 PathProgramCache]: Analyzing trace with hash -80542500, now seen corresponding path program 1 times [2020-10-19 19:13:04,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:04,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108430724] [2020-10-19 19:13:04,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:04,174 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:04,181 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:04,185 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:04,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:04,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1879278357, now seen corresponding path program 1 times [2020-10-19 19:13:04,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:04,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504037079] [2020-10-19 19:13:04,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:04,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:04,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504037079] [2020-10-19 19:13:04,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:13:04,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 19:13:04,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943294262] [2020-10-19 19:13:04,401 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:13:04,402 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:13:04,402 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:13:04,402 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:13:04,402 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-19 19:13:04,403 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:04,403 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:13:04,403 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:13:04,404 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2020-10-19 19:13:04,404 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:13:04,404 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:13:04,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:04,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:04,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:04,543 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 19:13:04,544 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:04,559 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 19:13:04,559 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:04,602 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-19 19:13:04,602 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-19 19:13:04,851 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-19 19:13:04,853 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:13:04,853 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:13:04,854 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:13:04,854 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:13:04,854 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 19:13:04,854 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:04,854 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:13:04,855 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:13:04,855 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2020-10-19 19:13:04,855 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:13:04,855 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:13:04,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:04,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:04,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:04,968 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 19:13:04,974 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:04,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:13:04,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:13:04,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:13:04,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:13:04,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:13:04,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:13:04,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:13:04,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:05,000 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:05,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:13:05,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:13:05,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:13:05,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:13:05,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:13:05,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:13:05,040 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:13:05,040 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:13:05,047 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:05,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:13:05,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:13:05,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:13:05,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:13:05,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:13:05,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:13:05,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:13:05,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:05,111 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 19:13:05,125 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-19 19:13:05,125 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:05,132 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 19:13:05,132 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-19 19:13:05,133 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 19:13:05,134 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0) = 1*ULTIMATE.start_main_~l~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:05,169 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-19 19:13:05,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:05,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 19:13:05,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:05,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 19:13:05,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:05,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:05,282 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-19 19:13:05,283 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-10-19 19:13:05,360 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 112 states and 133 transitions. Complement of second has 6 states. [2020-10-19 19:13:05,360 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 [2020-10-19 19:13:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 19:13:05,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2020-10-19 19:13:05,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 4 letters. Loop has 7 letters. [2020-10-19 19:13:05,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:05,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 11 letters. Loop has 7 letters. [2020-10-19 19:13:05,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:05,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 4 letters. Loop has 14 letters. [2020-10-19 19:13:05,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:05,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 133 transitions. [2020-10-19 19:13:05,369 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2020-10-19 19:13:05,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 107 states and 126 transitions. [2020-10-19 19:13:05,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2020-10-19 19:13:05,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2020-10-19 19:13:05,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 126 transitions. [2020-10-19 19:13:05,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:13:05,373 INFO L691 BuchiCegarLoop]: Abstraction has 107 states and 126 transitions. [2020-10-19 19:13:05,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 126 transitions. [2020-10-19 19:13:05,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2020-10-19 19:13:05,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-19 19:13:05,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2020-10-19 19:13:05,381 INFO L714 BuchiCegarLoop]: Abstraction has 106 states and 125 transitions. [2020-10-19 19:13:05,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:13:05,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 19:13:05,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 19:13:05,383 INFO L87 Difference]: Start difference. First operand 106 states and 125 transitions. Second operand 3 states. [2020-10-19 19:13:05,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:13:05,406 INFO L93 Difference]: Finished difference Result 128 states and 148 transitions. [2020-10-19 19:13:05,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 19:13:05,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 148 transitions. [2020-10-19 19:13:05,409 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 91 [2020-10-19 19:13:05,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 96 states and 111 transitions. [2020-10-19 19:13:05,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2020-10-19 19:13:05,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2020-10-19 19:13:05,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 111 transitions. [2020-10-19 19:13:05,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:13:05,413 INFO L691 BuchiCegarLoop]: Abstraction has 96 states and 111 transitions. [2020-10-19 19:13:05,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 111 transitions. [2020-10-19 19:13:05,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 65. [2020-10-19 19:13:05,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-19 19:13:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2020-10-19 19:13:05,419 INFO L714 BuchiCegarLoop]: Abstraction has 65 states and 76 transitions. [2020-10-19 19:13:05,419 INFO L594 BuchiCegarLoop]: Abstraction has 65 states and 76 transitions. [2020-10-19 19:13:05,419 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 19:13:05,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 76 transitions. [2020-10-19 19:13:05,420 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2020-10-19 19:13:05,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:13:05,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:13:05,421 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 19:13:05,422 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:13:05,422 INFO L794 eck$LassoCheckResult]: Stem: 752#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 731#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~nondet6, main_#t~nondet7, main_#t~post8, main_#t~post9, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 724#L27 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 725#L30 assume main_~l~0 > 1;main_#t~post4 := main_~l~0;main_~l~0 := main_#t~post4 - 1;havoc main_#t~post4; 743#L59-1 [2020-10-19 19:13:05,422 INFO L796 eck$LassoCheckResult]: Loop: 743#L59-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 759#L38-2 assume !(main_~j~0 <= main_~r~0); 757#L38-3 assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 750#L18-30 assume !(0 == __VERIFIER_assert_~cond); 749#L18-32 __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 747#L18-33 assume !(0 == __VERIFIER_assert_~cond); 742#L18-35 main_#t~post8 := main_~l~0;main_~l~0 := main_#t~post8 - 1;havoc main_#t~post8; 743#L59-1 [2020-10-19 19:13:05,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:05,423 INFO L82 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2020-10-19 19:13:05,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:05,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194002978] [2020-10-19 19:13:05,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:05,439 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:05,450 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:05,455 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:05,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:05,456 INFO L82 PathProgramCache]: Analyzing trace with hash -80542500, now seen corresponding path program 2 times [2020-10-19 19:13:05,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:05,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012191186] [2020-10-19 19:13:05,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:05,466 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:05,478 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:05,483 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:05,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:05,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1606342313, now seen corresponding path program 1 times [2020-10-19 19:13:05,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:05,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971265968] [2020-10-19 19:13:05,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:05,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:05,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971265968] [2020-10-19 19:13:05,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:13:05,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 19:13:05,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361874684] [2020-10-19 19:13:05,680 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:13:05,680 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:13:05,680 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:13:05,680 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:13:05,681 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-19 19:13:05,681 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:05,681 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:13:05,681 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:13:05,681 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration4_Loop [2020-10-19 19:13:05,681 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:13:05,681 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:13:05,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:05,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:05,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:05,783 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 19:13:05,783 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:05,794 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 19:13:05,794 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:05,856 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-19 19:13:05,856 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:06,254 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-19 19:13:06,256 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:13:06,256 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:13:06,257 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:13:06,257 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:13:06,257 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 19:13:06,257 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:06,257 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:13:06,257 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:13:06,257 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration4_Loop [2020-10-19 19:13:06,258 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:13:06,258 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:13:06,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:06,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:06,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:06,369 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 19:13:06,369 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:06,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:13:06,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:13:06,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:13:06,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:13:06,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:13:06,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:13:06,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:13:06,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:06,386 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:06,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:13:06,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:13:06,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:13:06,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:13:06,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:13:06,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:13:06,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:13:06,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:13:06,438 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 19:13:06,444 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-19 19:13:06,444 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:06,456 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 19:13:06,456 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-19 19:13:06,457 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 19:13:06,457 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0) = 1*ULTIMATE.start_main_~l~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:06,487 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-19 19:13:06,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:06,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 19:13:06,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:06,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 19:13:06,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:06,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:06,543 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-19 19:13:06,543 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 76 transitions. cyclomatic complexity: 13 Second operand 4 states. [2020-10-19 19:13:06,571 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 76 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 156 states and 182 transitions. Complement of second has 6 states. [2020-10-19 19:13:06,572 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 [2020-10-19 19:13:06,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 19:13:06,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2020-10-19 19:13:06,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 4 letters. Loop has 7 letters. [2020-10-19 19:13:06,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:06,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 11 letters. Loop has 7 letters. [2020-10-19 19:13:06,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:06,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 4 letters. Loop has 14 letters. [2020-10-19 19:13:06,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:06,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 182 transitions. [2020-10-19 19:13:06,577 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 83 [2020-10-19 19:13:06,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 121 states and 141 transitions. [2020-10-19 19:13:06,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2020-10-19 19:13:06,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2020-10-19 19:13:06,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 141 transitions. [2020-10-19 19:13:06,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:13:06,580 INFO L691 BuchiCegarLoop]: Abstraction has 121 states and 141 transitions. [2020-10-19 19:13:06,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 141 transitions. [2020-10-19 19:13:06,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 64. [2020-10-19 19:13:06,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-19 19:13:06,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2020-10-19 19:13:06,586 INFO L714 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2020-10-19 19:13:06,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:13:06,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 19:13:06,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-19 19:13:06,587 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 5 states. [2020-10-19 19:13:06,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:13:06,759 INFO L93 Difference]: Finished difference Result 197 states and 221 transitions. [2020-10-19 19:13:06,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 19:13:06,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 197 states and 221 transitions. [2020-10-19 19:13:06,762 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 120 [2020-10-19 19:13:06,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 197 states to 197 states and 221 transitions. [2020-10-19 19:13:06,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 148 [2020-10-19 19:13:06,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 148 [2020-10-19 19:13:06,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 197 states and 221 transitions. [2020-10-19 19:13:06,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:13:06,766 INFO L691 BuchiCegarLoop]: Abstraction has 197 states and 221 transitions. [2020-10-19 19:13:06,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states and 221 transitions. [2020-10-19 19:13:06,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 65. [2020-10-19 19:13:06,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-19 19:13:06,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2020-10-19 19:13:06,772 INFO L714 BuchiCegarLoop]: Abstraction has 65 states and 76 transitions. [2020-10-19 19:13:06,772 INFO L594 BuchiCegarLoop]: Abstraction has 65 states and 76 transitions. [2020-10-19 19:13:06,772 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 19:13:06,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 76 transitions. [2020-10-19 19:13:06,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2020-10-19 19:13:06,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:13:06,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:13:06,774 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 19:13:06,774 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:13:06,775 INFO L794 eck$LassoCheckResult]: Stem: 1319#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 1285#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~nondet6, main_#t~nondet7, main_#t~post8, main_#t~post9, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 1273#L27 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 1274#L30 assume !(main_~l~0 > 1);main_#t~post5 := main_~r~0;main_~r~0 := main_#t~post5 - 1;havoc main_#t~post5; 1284#L59-1 [2020-10-19 19:13:06,775 INFO L796 eck$LassoCheckResult]: Loop: 1284#L59-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1302#L38-2 assume !!(main_~j~0 <= main_~r~0); 1303#L39 assume !(main_~j~0 < main_~r~0); 1308#L39-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1309#L18-12 assume !(0 == __VERIFIER_assert_~cond); 1312#L18-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1326#L18-15 assume !(0 == __VERIFIER_assert_~cond); 1323#L18-17 assume 0 != main_#t~nondet7;havoc main_#t~nondet7; 1298#L38-3 assume !(main_~l~0 > 1);__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1299#L18-36 assume !(0 == __VERIFIER_assert_~cond); 1325#L18-38 __VERIFIER_assert_#in~cond := (if main_~r~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1322#L18-39 assume !(0 == __VERIFIER_assert_~cond); 1283#L18-41 main_#t~post9 := main_~r~0;main_~r~0 := main_#t~post9 - 1;havoc main_#t~post9; 1284#L59-1 [2020-10-19 19:13:06,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:06,776 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 4 times [2020-10-19 19:13:06,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:06,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40710550] [2020-10-19 19:13:06,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:06,787 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:06,796 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:06,799 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:06,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:06,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1510380012, now seen corresponding path program 1 times [2020-10-19 19:13:06,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:06,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770449679] [2020-10-19 19:13:06,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:06,811 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:06,820 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:06,823 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:06,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:06,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1463197069, now seen corresponding path program 1 times [2020-10-19 19:13:06,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:06,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142339524] [2020-10-19 19:13:06,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:06,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142339524] [2020-10-19 19:13:06,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:13:06,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 19:13:06,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082892329] [2020-10-19 19:13:07,066 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2020-10-19 19:13:07,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-19 19:13:07,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:13:07,148 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:13:07,148 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:13:07,148 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:13:07,148 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:13:07,148 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-19 19:13:07,149 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:07,149 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:13:07,149 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:13:07,149 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2020-10-19 19:13:07,149 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:13:07,149 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:13:07,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:07,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:07,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:07,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:07,263 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 19:13:07,263 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:07,271 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 19:13:07,271 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:07,297 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-19 19:13:07,297 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-19 19:13:07,999 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-19 19:13:08,002 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:13:08,002 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:13:08,002 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:13:08,002 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:13:08,002 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 19:13:08,002 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:08,002 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:13:08,002 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:13:08,002 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2020-10-19 19:13:08,003 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:13:08,003 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:13:08,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:08,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:08,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:08,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:08,096 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 19:13:08,097 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:08,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:13:08,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:13:08,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:13:08,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:13:08,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:13:08,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:13:08,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:13:08,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:13:08,117 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 19:13:08,120 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-19 19:13:08,121 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:08,123 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 19:13:08,123 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-19 19:13:08,124 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 19:13:08,124 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0) = 1*ULTIMATE.start_main_~r~0 Supporting invariants [] [2020-10-19 19:13:08,144 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-19 19:13:08,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:08,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 19:13:08,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:08,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 19:13:08,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:08,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:08,198 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-19 19:13:08,199 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 76 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-10-19 19:13:08,230 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 76 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 125 states and 145 transitions. Complement of second has 4 states. [2020-10-19 19:13:08,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-19 19:13:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 19:13:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2020-10-19 19:13:08,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 76 transitions. Stem has 4 letters. Loop has 13 letters. [2020-10-19 19:13:08,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:08,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 76 transitions. Stem has 17 letters. Loop has 13 letters. [2020-10-19 19:13:08,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:08,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 76 transitions. Stem has 4 letters. Loop has 26 letters. [2020-10-19 19:13:08,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:08,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 145 transitions. [2020-10-19 19:13:08,235 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2020-10-19 19:13:08,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 120 states and 139 transitions. [2020-10-19 19:13:08,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2020-10-19 19:13:08,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2020-10-19 19:13:08,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 139 transitions. [2020-10-19 19:13:08,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:13:08,237 INFO L691 BuchiCegarLoop]: Abstraction has 120 states and 139 transitions. [2020-10-19 19:13:08,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 139 transitions. [2020-10-19 19:13:08,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2020-10-19 19:13:08,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-19 19:13:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 138 transitions. [2020-10-19 19:13:08,242 INFO L714 BuchiCegarLoop]: Abstraction has 119 states and 138 transitions. [2020-10-19 19:13:08,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:13:08,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 19:13:08,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-19 19:13:08,243 INFO L87 Difference]: Start difference. First operand 119 states and 138 transitions. Second operand 4 states. [2020-10-19 19:13:08,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:13:08,280 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2020-10-19 19:13:08,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 19:13:08,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 76 transitions. [2020-10-19 19:13:08,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2020-10-19 19:13:08,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 65 states and 75 transitions. [2020-10-19 19:13:08,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2020-10-19 19:13:08,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2020-10-19 19:13:08,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 75 transitions. [2020-10-19 19:13:08,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:13:08,282 INFO L691 BuchiCegarLoop]: Abstraction has 65 states and 75 transitions. [2020-10-19 19:13:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 75 transitions. [2020-10-19 19:13:08,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-10-19 19:13:08,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-19 19:13:08,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2020-10-19 19:13:08,286 INFO L714 BuchiCegarLoop]: Abstraction has 65 states and 75 transitions. [2020-10-19 19:13:08,286 INFO L594 BuchiCegarLoop]: Abstraction has 65 states and 75 transitions. [2020-10-19 19:13:08,286 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 19:13:08,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 75 transitions. [2020-10-19 19:13:08,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2020-10-19 19:13:08,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:13:08,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:13:08,288 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-19 19:13:08,288 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:13:08,288 INFO L794 eck$LassoCheckResult]: Stem: 1771#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 1735#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~nondet6, main_#t~nondet7, main_#t~post8, main_#t~post9, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 1725#L27 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 1726#L30 assume main_~l~0 > 1;main_#t~post4 := main_~l~0;main_~l~0 := main_#t~post4 - 1;havoc main_#t~post4; 1768#L59-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1752#L38-2 [2020-10-19 19:13:08,288 INFO L796 eck$LassoCheckResult]: Loop: 1752#L38-2 assume !!(main_~j~0 <= main_~r~0); 1753#L39 assume !(main_~j~0 < main_~r~0); 1762#L39-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1758#L18-12 assume !(0 == __VERIFIER_assert_~cond); 1759#L18-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1776#L18-15 assume !(0 == __VERIFIER_assert_~cond); 1773#L18-17 assume 0 != main_#t~nondet7;havoc main_#t~nondet7; 1748#L38-3 assume !(main_~l~0 > 1);__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1749#L18-36 assume !(0 == __VERIFIER_assert_~cond); 1775#L18-38 __VERIFIER_assert_#in~cond := (if main_~r~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1772#L18-39 assume !(0 == __VERIFIER_assert_~cond); 1733#L18-41 main_#t~post9 := main_~r~0;main_~r~0 := main_#t~post9 - 1;havoc main_#t~post9; 1734#L59-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1752#L38-2 [2020-10-19 19:13:08,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:08,289 INFO L82 PathProgramCache]: Analyzing trace with hash 28695791, now seen corresponding path program 1 times [2020-10-19 19:13:08,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:08,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311240496] [2020-10-19 19:13:08,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:08,298 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:08,306 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:08,309 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:08,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:08,310 INFO L82 PathProgramCache]: Analyzing trace with hash 436546004, now seen corresponding path program 2 times [2020-10-19 19:13:08,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:08,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151097669] [2020-10-19 19:13:08,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:08,321 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:08,329 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:08,331 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:08,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:08,332 INFO L82 PathProgramCache]: Analyzing trace with hash -605667418, now seen corresponding path program 1 times [2020-10-19 19:13:08,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:08,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009981404] [2020-10-19 19:13:08,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:08,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:08,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009981404] [2020-10-19 19:13:08,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:13:08,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 19:13:08,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115583781] [2020-10-19 19:13:08,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-19 19:13:08,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:13:08,569 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:13:08,570 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:13:08,570 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:13:08,570 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:13:08,570 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-19 19:13:08,570 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:08,570 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:13:08,570 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:13:08,570 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2020-10-19 19:13:08,570 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:13:08,571 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:13:08,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:08,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:08,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:08,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:08,677 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 19:13:08,677 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:08,681 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 19:13:08,681 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-19 19:13:08,696 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 19:13:08,696 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet7=-5} Honda state: {ULTIMATE.start_main_#t~nondet7=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:08,727 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 19:13:08,727 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-19 19:13:08,730 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 19:13:08,730 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post9=0} Honda state: {ULTIMATE.start_main_#t~post9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:08,774 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 19:13:08,774 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:08,823 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-19 19:13:08,823 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:09,266 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-19 19:13:09,269 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:13:09,269 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:13:09,269 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:13:09,269 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:13:09,269 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 19:13:09,269 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:09,270 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:13:09,270 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:13:09,270 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2020-10-19 19:13:09,270 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:13:09,270 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:13:09,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:09,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:09,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:09,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:09,376 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 19:13:09,376 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:09,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:13:09,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:13:09,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:13:09,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:13:09,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:13:09,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:13:09,390 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:13:09,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:09,394 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:09,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:13:09,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:13:09,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:13:09,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:13:09,445 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-19 19:13:09,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:13:09,446 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-19 19:13:09,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:09,448 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:09,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:13:09,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:13:09,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:13:09,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:13:09,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:13:09,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:13:09,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:13:09,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:09,495 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:09,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:13:09,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:13:09,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:13:09,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:13:09,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:13:09,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:13:09,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:13:09,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:09,537 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 19:13:09,542 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-10-19 19:13:09,542 INFO L444 ModelExtractionUtils]: 5 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:09,545 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 19:13:09,545 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-19 19:13:09,545 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 19:13:09,545 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0) = 1*ULTIMATE.start_main_~r~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:09,565 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-19 19:13:09,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:09,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 19:13:09,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:09,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 19:13:09,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:09,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:09,635 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-19 19:13:09,635 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 75 transitions. cyclomatic complexity: 12 Second operand 4 states. [2020-10-19 19:13:09,679 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 75 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 129 states and 151 transitions. Complement of second has 6 states. [2020-10-19 19:13:09,681 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 [2020-10-19 19:13:09,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 19:13:09,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2020-10-19 19:13:09,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 5 letters. Loop has 13 letters. [2020-10-19 19:13:09,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:09,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 18 letters. Loop has 13 letters. [2020-10-19 19:13:09,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:09,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 5 letters. Loop has 26 letters. [2020-10-19 19:13:09,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:09,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 151 transitions. [2020-10-19 19:13:09,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-10-19 19:13:09,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 123 states and 144 transitions. [2020-10-19 19:13:09,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2020-10-19 19:13:09,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2020-10-19 19:13:09,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 144 transitions. [2020-10-19 19:13:09,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:13:09,690 INFO L691 BuchiCegarLoop]: Abstraction has 123 states and 144 transitions. [2020-10-19 19:13:09,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 144 transitions. [2020-10-19 19:13:09,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2020-10-19 19:13:09,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-10-19 19:13:09,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2020-10-19 19:13:09,702 INFO L714 BuchiCegarLoop]: Abstraction has 121 states and 141 transitions. [2020-10-19 19:13:09,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:13:09,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-19 19:13:09,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-19 19:13:09,704 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. Second operand 6 states. [2020-10-19 19:13:09,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:13:09,897 INFO L93 Difference]: Finished difference Result 402 states and 448 transitions. [2020-10-19 19:13:09,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-19 19:13:09,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 402 states and 448 transitions. [2020-10-19 19:13:09,901 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2020-10-19 19:13:09,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 402 states to 354 states and 396 transitions. [2020-10-19 19:13:09,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2020-10-19 19:13:09,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2020-10-19 19:13:09,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 354 states and 396 transitions. [2020-10-19 19:13:09,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:13:09,906 INFO L691 BuchiCegarLoop]: Abstraction has 354 states and 396 transitions. [2020-10-19 19:13:09,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states and 396 transitions. [2020-10-19 19:13:09,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 122. [2020-10-19 19:13:09,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-10-19 19:13:09,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2020-10-19 19:13:09,911 INFO L714 BuchiCegarLoop]: Abstraction has 122 states and 142 transitions. [2020-10-19 19:13:09,912 INFO L594 BuchiCegarLoop]: Abstraction has 122 states and 142 transitions. [2020-10-19 19:13:09,912 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 19:13:09,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 142 transitions. [2020-10-19 19:13:09,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-10-19 19:13:09,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:13:09,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:13:09,914 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-19 19:13:09,914 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:13:09,914 INFO L794 eck$LassoCheckResult]: Stem: 2579#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 2544#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~nondet6, main_#t~nondet7, main_#t~post8, main_#t~post9, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 2531#L27 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 2532#L30 assume main_~l~0 > 1;main_#t~post4 := main_~l~0;main_~l~0 := main_#t~post4 - 1;havoc main_#t~post4; 2564#L59-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 2566#L38-2 assume !!(main_~j~0 <= main_~r~0); 2559#L39 [2020-10-19 19:13:09,915 INFO L796 eck$LassoCheckResult]: Loop: 2559#L39 assume !(main_~j~0 < main_~r~0); 2567#L39-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2568#L18-12 assume !(0 == __VERIFIER_assert_~cond); 2571#L18-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2587#L18-15 assume !(0 == __VERIFIER_assert_~cond); 2583#L18-17 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2580#L18-18 assume !(0 == __VERIFIER_assert_~cond); 2539#L18-20 __VERIFIER_assert_#in~cond := (if main_~i~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2537#L18-21 assume !(0 == __VERIFIER_assert_~cond); 2533#L18-23 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2525#L18-24 assume !(0 == __VERIFIER_assert_~cond); 2526#L18-26 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2555#L18-27 assume !(0 == __VERIFIER_assert_~cond); 2549#L18-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 2550#L38-2 assume !!(main_~j~0 <= main_~r~0); 2559#L39 [2020-10-19 19:13:09,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:09,915 INFO L82 PathProgramCache]: Analyzing trace with hash 889569551, now seen corresponding path program 1 times [2020-10-19 19:13:09,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:09,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983346532] [2020-10-19 19:13:09,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:09,939 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:09,948 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:09,960 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:09,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:09,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1922606789, now seen corresponding path program 1 times [2020-10-19 19:13:09,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:09,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124821007] [2020-10-19 19:13:09,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:10,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:10,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124821007] [2020-10-19 19:13:10,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:13:10,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 19:13:10,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845866865] [2020-10-19 19:13:10,048 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 19:13:10,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:13:10,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-19 19:13:10,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-19 19:13:10,049 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. cyclomatic complexity: 24 Second operand 6 states. [2020-10-19 19:13:10,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:13:10,215 INFO L93 Difference]: Finished difference Result 213 states and 239 transitions. [2020-10-19 19:13:10,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-19 19:13:10,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 213 states and 239 transitions. [2020-10-19 19:13:10,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-10-19 19:13:10,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 213 states to 199 states and 225 transitions. [2020-10-19 19:13:10,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-10-19 19:13:10,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-10-19 19:13:10,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 199 states and 225 transitions. [2020-10-19 19:13:10,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:13:10,220 INFO L691 BuchiCegarLoop]: Abstraction has 199 states and 225 transitions. [2020-10-19 19:13:10,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states and 225 transitions. [2020-10-19 19:13:10,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 164. [2020-10-19 19:13:10,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-10-19 19:13:10,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 186 transitions. [2020-10-19 19:13:10,224 INFO L714 BuchiCegarLoop]: Abstraction has 164 states and 186 transitions. [2020-10-19 19:13:10,224 INFO L594 BuchiCegarLoop]: Abstraction has 164 states and 186 transitions. [2020-10-19 19:13:10,224 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 19:13:10,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 164 states and 186 transitions. [2020-10-19 19:13:10,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-10-19 19:13:10,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:13:10,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:13:10,227 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-19 19:13:10,227 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:13:10,227 INFO L794 eck$LassoCheckResult]: Stem: 2942#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 2897#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~nondet6, main_#t~nondet7, main_#t~post8, main_#t~post9, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 2884#L27 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 2885#L30 assume main_~l~0 > 1;main_#t~post4 := main_~l~0;main_~l~0 := main_#t~post4 - 1;havoc main_#t~post4; 2918#L59-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 2920#L38-2 assume !!(main_~j~0 <= main_~r~0); 2932#L39 [2020-10-19 19:13:10,227 INFO L796 eck$LassoCheckResult]: Loop: 2932#L39 assume main_~j~0 < main_~r~0;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2888#L18 assume !(0 == __VERIFIER_assert_~cond); 2881#L18-2 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2873#L18-3 assume !(0 == __VERIFIER_assert_~cond); 2874#L18-5 __VERIFIER_assert_#in~cond := (if 1 <= 1 + main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2906#L18-6 assume !(0 == __VERIFIER_assert_~cond); 2898#L18-8 __VERIFIER_assert_#in~cond := (if 1 + main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2899#L18-9 assume !(0 == __VERIFIER_assert_~cond); 2934#L18-11 assume 0 != main_#t~nondet6;havoc main_#t~nondet6;main_~j~0 := 1 + main_~j~0; 2923#L39-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2924#L18-12 assume !(0 == __VERIFIER_assert_~cond); 2927#L18-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2949#L18-15 assume !(0 == __VERIFIER_assert_~cond); 2946#L18-17 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2943#L18-18 assume !(0 == __VERIFIER_assert_~cond); 2893#L18-20 __VERIFIER_assert_#in~cond := (if main_~i~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2891#L18-21 assume !(0 == __VERIFIER_assert_~cond); 2886#L18-23 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2877#L18-24 assume !(0 == __VERIFIER_assert_~cond); 2878#L18-26 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2909#L18-27 assume !(0 == __VERIFIER_assert_~cond); 2902#L18-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 2903#L38-2 assume !!(main_~j~0 <= main_~r~0); 2932#L39 [2020-10-19 19:13:10,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:10,228 INFO L82 PathProgramCache]: Analyzing trace with hash 889569551, now seen corresponding path program 2 times [2020-10-19 19:13:10,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:10,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162733033] [2020-10-19 19:13:10,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:10,236 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:10,242 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:10,244 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:10,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:10,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1146797320, now seen corresponding path program 1 times [2020-10-19 19:13:10,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:10,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446869501] [2020-10-19 19:13:10,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:10,259 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:10,271 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:10,274 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:10,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:10,275 INFO L82 PathProgramCache]: Analyzing trace with hash 780250170, now seen corresponding path program 1 times [2020-10-19 19:13:10,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:10,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083056412] [2020-10-19 19:13:10,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:10,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:10,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083056412] [2020-10-19 19:13:10,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083094290] [2020-10-19 19:13:10,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 19:13:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:10,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-19 19:13:10,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:10,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 19:13:10,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-19 19:13:10,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-19 19:13:10,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:10,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-19 19:13:10,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2020-10-19 19:13:10,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986168748] [2020-10-19 19:13:11,142 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2020-10-19 19:13:11,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-19 19:13:11,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:13:11,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-19 19:13:11,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:13:11,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-19 19:13:11,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:13:11,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-19 19:13:11,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:13:11,224 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:13:11,224 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:13:11,224 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:13:11,224 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:13:11,225 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-19 19:13:11,225 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:11,225 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:13:11,225 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:13:11,225 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2020-10-19 19:13:11,225 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:13:11,225 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:13:11,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:11,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:11,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:11,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:11,324 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 19:13:11,324 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:11,328 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 19:13:11,328 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:11,332 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 19:13:11,332 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet6=7} Honda state: {ULTIMATE.start_main_#t~nondet6=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:11,370 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 19:13:11,370 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:11,398 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-19 19:13:11,398 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-19 19:13:11,552 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-19 19:13:11,554 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:13:11,554 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:13:11,554 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:13:11,554 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:13:11,554 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 19:13:11,554 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:11,555 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:13:11,555 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:13:11,555 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2020-10-19 19:13:11,555 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:13:11,555 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:13:11,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:11,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:11,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:11,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:11,651 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 19:13:11,652 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:11,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:13:11,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:13:11,656 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:13:11,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:13:11,656 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-19 19:13:11,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:13:11,657 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-19 19:13:11,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:13:11,661 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:11,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:13:11,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:13:11,683 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:13:11,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:13:11,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:13:11,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:13:11,684 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:13:11,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:13:11,687 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 19:13:11,692 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-10-19 19:13:11,693 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:11,695 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 19:13:11,695 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-19 19:13:11,696 INFO L510 LassoAnalysis]: Proved termination. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:11,696 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0, ULTIMATE.start_main_~j~0) = 3*ULTIMATE.start_main_~r~0 - 2*ULTIMATE.start_main_~j~0 Supporting invariants [] [2020-10-19 19:13:11,715 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-19 19:13:11,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:11,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 19:13:11,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:11,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-19 19:13:11,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:11,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-19 19:13:11,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:13:11,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:11,855 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2020-10-19 19:13:11,855 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 164 states and 186 transitions. cyclomatic complexity: 26 Second operand 7 states. [2020-10-19 19:13:11,977 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 164 states and 186 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 560 states and 602 transitions. Complement of second has 11 states. [2020-10-19 19:13:11,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-10-19 19:13:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-19 19:13:11,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2020-10-19 19:13:11,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 66 transitions. Stem has 6 letters. Loop has 23 letters. [2020-10-19 19:13:11,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:11,981 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 19:13:11,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:12,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 19:13:12,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:12,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-19 19:13:12,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:12,072 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-19 19:13:12,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:13:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:12,122 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2020-10-19 19:13:12,122 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 164 states and 186 transitions. cyclomatic complexity: 26 Second operand 7 states. [2020-10-19 19:13:12,404 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 164 states and 186 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 668 states and 721 transitions. Complement of second has 17 states. [2020-10-19 19:13:12,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2020-10-19 19:13:12,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-19 19:13:12,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2020-10-19 19:13:12,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 99 transitions. Stem has 6 letters. Loop has 23 letters. [2020-10-19 19:13:12,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:12,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 99 transitions. Stem has 29 letters. Loop has 23 letters. [2020-10-19 19:13:12,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:12,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 99 transitions. Stem has 6 letters. Loop has 46 letters. [2020-10-19 19:13:12,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:12,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 668 states and 721 transitions. [2020-10-19 19:13:12,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-10-19 19:13:12,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 668 states to 493 states and 544 transitions. [2020-10-19 19:13:12,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2020-10-19 19:13:12,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2020-10-19 19:13:12,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 493 states and 544 transitions. [2020-10-19 19:13:12,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:13:12,419 INFO L691 BuchiCegarLoop]: Abstraction has 493 states and 544 transitions. [2020-10-19 19:13:12,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states and 544 transitions. [2020-10-19 19:13:12,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 290. [2020-10-19 19:13:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2020-10-19 19:13:12,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 324 transitions. [2020-10-19 19:13:12,425 INFO L714 BuchiCegarLoop]: Abstraction has 290 states and 324 transitions. [2020-10-19 19:13:12,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:13:12,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-19 19:13:12,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-19 19:13:12,426 INFO L87 Difference]: Start difference. First operand 290 states and 324 transitions. Second operand 7 states. [2020-10-19 19:13:12,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:13:12,824 INFO L93 Difference]: Finished difference Result 519 states and 565 transitions. [2020-10-19 19:13:12,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-19 19:13:12,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 519 states and 565 transitions. [2020-10-19 19:13:12,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-10-19 19:13:12,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 519 states to 303 states and 341 transitions. [2020-10-19 19:13:12,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-10-19 19:13:12,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-10-19 19:13:12,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 303 states and 341 transitions. [2020-10-19 19:13:12,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:13:12,832 INFO L691 BuchiCegarLoop]: Abstraction has 303 states and 341 transitions. [2020-10-19 19:13:12,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states and 341 transitions. [2020-10-19 19:13:12,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 211. [2020-10-19 19:13:12,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-10-19 19:13:12,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 239 transitions. [2020-10-19 19:13:12,837 INFO L714 BuchiCegarLoop]: Abstraction has 211 states and 239 transitions. [2020-10-19 19:13:12,837 INFO L594 BuchiCegarLoop]: Abstraction has 211 states and 239 transitions. [2020-10-19 19:13:12,837 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 19:13:12,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 211 states and 239 transitions. [2020-10-19 19:13:12,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-10-19 19:13:12,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:13:12,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:13:12,839 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:13:12,839 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:13:12,839 INFO L794 eck$LassoCheckResult]: Stem: 5484#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 5435#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~nondet6, main_#t~nondet7, main_#t~post8, main_#t~post9, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 5424#L27 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 5425#L30 assume main_~l~0 > 1;main_#t~post4 := main_~l~0;main_~l~0 := main_#t~post4 - 1;havoc main_#t~post4; 5459#L59-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 5460#L38-2 assume !!(main_~j~0 <= main_~r~0); 5565#L39 assume !(main_~j~0 < main_~r~0); 5476#L39-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5616#L18-12 assume !(0 == __VERIFIER_assert_~cond); 5614#L18-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5612#L18-15 assume !(0 == __VERIFIER_assert_~cond); 5487#L18-17 assume 0 != main_#t~nondet7;havoc main_#t~nondet7; 5456#L38-3 assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5481#L18-30 assume !(0 == __VERIFIER_assert_~cond); 5477#L18-32 __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5478#L18-33 assume !(0 == __VERIFIER_assert_~cond); 5457#L18-35 main_#t~post8 := main_~l~0;main_~l~0 := main_#t~post8 - 1;havoc main_#t~post8; 5458#L59-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 5441#L38-2 [2020-10-19 19:13:12,840 INFO L796 eck$LassoCheckResult]: Loop: 5441#L38-2 assume !!(main_~j~0 <= main_~r~0); 5474#L39 assume main_~j~0 < main_~r~0;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5426#L18 assume !(0 == __VERIFIER_assert_~cond); 5419#L18-2 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5411#L18-3 assume !(0 == __VERIFIER_assert_~cond); 5412#L18-5 __VERIFIER_assert_#in~cond := (if 1 <= 1 + main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5444#L18-6 assume !(0 == __VERIFIER_assert_~cond); 5436#L18-8 __VERIFIER_assert_#in~cond := (if 1 + main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5437#L18-9 assume !(0 == __VERIFIER_assert_~cond); 5471#L18-11 assume 0 != main_#t~nondet6;havoc main_#t~nondet6;main_~j~0 := 1 + main_~j~0; 5463#L39-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5464#L18-12 assume !(0 == __VERIFIER_assert_~cond); 5467#L18-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5490#L18-15 assume !(0 == __VERIFIER_assert_~cond); 5486#L18-17 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5482#L18-18 assume !(0 == __VERIFIER_assert_~cond); 5431#L18-20 __VERIFIER_assert_#in~cond := (if main_~i~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5429#L18-21 assume !(0 == __VERIFIER_assert_~cond); 5422#L18-23 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5415#L18-24 assume !(0 == __VERIFIER_assert_~cond); 5416#L18-26 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5447#L18-27 assume !(0 == __VERIFIER_assert_~cond); 5440#L18-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 5441#L38-2 [2020-10-19 19:13:12,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:12,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1670671798, now seen corresponding path program 1 times [2020-10-19 19:13:12,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:12,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920633925] [2020-10-19 19:13:12,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:12,850 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:12,859 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:12,863 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:12,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:12,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1478170350, now seen corresponding path program 2 times [2020-10-19 19:13:12,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:12,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481985862] [2020-10-19 19:13:12,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:12,876 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:12,884 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:12,889 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:12,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:12,889 INFO L82 PathProgramCache]: Analyzing trace with hash 50779305, now seen corresponding path program 1 times [2020-10-19 19:13:12,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:12,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161447402] [2020-10-19 19:13:12,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:12,903 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:12,916 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:12,924 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:13,100 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2020-10-19 19:13:13,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-19 19:13:13,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:13:13,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-19 19:13:13,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:13:13,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-19 19:13:13,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:13:13,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-19 19:13:13,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:13:13,193 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:13:13,193 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:13:13,193 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:13:13,193 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:13:13,193 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-19 19:13:13,193 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:13,193 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:13:13,194 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:13:13,194 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2020-10-19 19:13:13,194 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:13:13,194 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:13:13,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:13,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:13,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:13,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:13,284 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 19:13:13,285 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:13,288 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 19:13:13,289 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:13,315 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-19 19:13:13,315 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-19 19:13:13,418 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-19 19:13:13,420 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:13:13,420 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:13:13,420 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:13:13,420 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:13:13,420 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 19:13:13,420 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:13,420 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:13:13,420 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:13:13,420 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2020-10-19 19:13:13,421 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:13:13,421 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:13:13,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:13,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:13,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:13,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:13,520 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 19:13:13,520 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:13,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:13:13,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:13:13,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:13:13,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:13:13,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:13:13,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:13:13,534 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:13:13,534 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:13:13,537 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 19:13:13,541 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-10-19 19:13:13,542 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:13,544 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 19:13:13,544 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-19 19:13:13,544 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 19:13:13,544 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~j~0) = 3*ULTIMATE.start_main_~n~0 - 2*ULTIMATE.start_main_~j~0 Supporting invariants [] [2020-10-19 19:13:13,564 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-19 19:13:13,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:13,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 19:13:13,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:13,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 24 conjunts are in the unsatisfiable core [2020-10-19 19:13:13,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:13,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-19 19:13:13,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:13:13,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-19 19:13:13,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:13:13,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-19 19:13:13,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:13:13,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:13:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:13,869 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2020-10-19 19:13:13,869 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 211 states and 239 transitions. cyclomatic complexity: 32 Second operand 11 states. [2020-10-19 19:13:14,164 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 211 states and 239 transitions. cyclomatic complexity: 32. Second operand 11 states. Result 425 states and 471 transitions. Complement of second has 17 states. [2020-10-19 19:13:14,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2020-10-19 19:13:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-19 19:13:14,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2020-10-19 19:13:14,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 62 transitions. Stem has 18 letters. Loop has 23 letters. [2020-10-19 19:13:14,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:14,166 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 19:13:14,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:14,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 19:13:14,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:14,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 24 conjunts are in the unsatisfiable core [2020-10-19 19:13:14,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:14,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-19 19:13:14,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:13:14,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-19 19:13:14,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:13:14,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-19 19:13:14,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:13:14,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:13:14,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:14,474 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2020-10-19 19:13:14,474 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 211 states and 239 transitions. cyclomatic complexity: 32 Second operand 11 states. [2020-10-19 19:13:15,155 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 211 states and 239 transitions. cyclomatic complexity: 32. Second operand 11 states. Result 465 states and 511 transitions. Complement of second has 27 states. [2020-10-19 19:13:15,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2020-10-19 19:13:15,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-19 19:13:15,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2020-10-19 19:13:15,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 71 transitions. Stem has 18 letters. Loop has 23 letters. [2020-10-19 19:13:15,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:15,157 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 19:13:15,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:15,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 19:13:15,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:15,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 24 conjunts are in the unsatisfiable core [2020-10-19 19:13:15,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:15,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-19 19:13:15,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:13:15,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-19 19:13:15,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:13:15,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-19 19:13:15,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:13:15,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:13:15,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:15,434 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2020-10-19 19:13:15,434 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 211 states and 239 transitions. cyclomatic complexity: 32 Second operand 11 states. [2020-10-19 19:13:15,754 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 211 states and 239 transitions. cyclomatic complexity: 32. Second operand 11 states. Result 763 states and 849 transitions. Complement of second has 16 states. [2020-10-19 19:13:15,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2020-10-19 19:13:15,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-19 19:13:15,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2020-10-19 19:13:15,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 125 transitions. Stem has 18 letters. Loop has 23 letters. [2020-10-19 19:13:15,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:15,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 125 transitions. Stem has 41 letters. Loop has 23 letters. [2020-10-19 19:13:15,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:15,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 125 transitions. Stem has 18 letters. Loop has 46 letters. [2020-10-19 19:13:15,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:15,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 763 states and 849 transitions. [2020-10-19 19:13:15,764 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 19:13:15,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 763 states to 0 states and 0 transitions. [2020-10-19 19:13:15,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-19 19:13:15,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-19 19:13:15,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-19 19:13:15,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:13:15,765 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 19:13:15,765 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 19:13:15,765 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 19:13:15,765 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-19 19:13:15,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-19 19:13:15,765 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 19:13:15,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-19 19:13:15,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 07:13:15 BoogieIcfgContainer [2020-10-19 19:13:15,772 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 19:13:15,772 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 19:13:15,772 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 19:13:15,773 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 19:13:15,773 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 07:13:03" (3/4) ... [2020-10-19 19:13:15,777 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-19 19:13:15,777 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 19:13:15,778 INFO L168 Benchmark]: Toolchain (without parser) took 13335.24 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 316.1 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 136.6 MB. Max. memory is 11.5 GB. [2020-10-19 19:13:15,779 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 19:13:15,779 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.76 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2020-10-19 19:13:15,780 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-10-19 19:13:15,780 INFO L168 Benchmark]: Boogie Preprocessor took 28.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 19:13:15,781 INFO L168 Benchmark]: RCFGBuilder took 498.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. [2020-10-19 19:13:15,781 INFO L168 Benchmark]: BuchiAutomizer took 12417.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 192.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -52.7 MB). Peak memory consumption was 139.7 MB. Max. memory is 11.5 GB. [2020-10-19 19:13:15,782 INFO L168 Benchmark]: Witness Printer took 4.49 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 19:13:15,785 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 261.76 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 114.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 498.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12417.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 192.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -52.7 MB). Peak memory consumption was 139.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.49 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (8 trivial, 5 deterministic, 1 nondeterministic). One deterministic module has affine ranking function l and consists of 4 locations. One deterministic module has affine ranking function l and consists of 4 locations. One deterministic module has affine ranking function r and consists of 3 locations. One deterministic module has affine ranking function r and consists of 4 locations. One deterministic module has affine ranking function 3 * r + -2 * j and consists of 9 locations. One nondeterministic module has affine ranking function 3 * n + -2 * j and consists of 9 locations. 8 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.3s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 7.4s. Construction of modules took 1.5s. Büchi inclusion checks took 2.9s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 10. Automata minimization 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 817 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 211 states and ocurred in iteration 8. Nontrivial modules had stage [4, 1, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 806 SDtfs, 1354 SDslu, 1052 SDs, 0 SdLazy, 1441 SolverSat, 198 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT1 conc0 concLT5 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital38 mio100 ax100 hnf97 lsp74 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq154 hnf93 smp100 dnf100 smp100 tf105 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...