./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-LICS2004-Fig1.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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/termination-crafted-lit/PodelskiRybalchenko-LICS2004-Fig1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f7e1c1540b70904598fe5e82d3f5b8e6f2e3e9f6 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:28:55,090 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:28:55,092 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:28:55,110 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:28:55,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:28:55,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:28:55,116 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:28:55,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:28:55,128 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:28:55,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:28:55,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:28:55,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:28:55,133 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:28:55,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:28:55,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:28:55,140 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:28:55,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:28:55,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:28:55,147 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:28:55,153 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:28:55,157 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:28:55,158 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:28:55,159 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:28:55,160 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:28:55,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:28:55,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:28:55,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:28:55,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:28:55,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:28:55,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:28:55,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:28:55,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:28:55,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:28:55,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:28:55,176 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:28:55,177 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:28:55,178 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:28:55,178 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:28:55,178 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:28:55,179 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:28:55,180 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:28:55,181 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:28:55,204 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:28:55,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:28:55,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:28:55,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:28:55,206 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:28:55,207 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:28:55,207 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:28:55,207 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:28:55,207 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:28:55,207 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:28:55,209 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:28:55,209 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:28:55,209 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:28:55,210 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:28:55,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:28:55,210 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:28:55,210 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:28:55,210 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:28:55,211 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:28:55,211 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:28:55,211 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:28:55,211 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:28:55,211 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:28:55,212 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:28:55,212 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:28:55,212 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:28:55,212 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:28:55,213 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:28:55,213 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:28:55,214 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:28:55,214 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f7e1c1540b70904598fe5e82d3f5b8e6f2e3e9f6 [2020-07-29 01:28:55,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:28:55,547 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:28:55,551 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:28:55,553 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:28:55,553 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:28:55,554 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-LICS2004-Fig1.c [2020-07-29 01:28:55,619 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6adc61d41/022589938f5048bda41d249c3fa1cce6/FLAG47d9aefd6 [2020-07-29 01:28:56,021 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:28:56,022 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-LICS2004-Fig1.c [2020-07-29 01:28:56,028 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6adc61d41/022589938f5048bda41d249c3fa1cce6/FLAG47d9aefd6 [2020-07-29 01:28:56,409 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6adc61d41/022589938f5048bda41d249c3fa1cce6 [2020-07-29 01:28:56,415 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:28:56,420 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:28:56,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:56,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:28:56,426 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:28:56,427 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:56" (1/1) ... [2020-07-29 01:28:56,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d88eed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:56, skipping insertion in model container [2020-07-29 01:28:56,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:56" (1/1) ... [2020-07-29 01:28:56,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:28:56,458 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:28:56,627 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:56,632 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:28:56,649 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:56,664 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:28:56,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:56 WrapperNode [2020-07-29 01:28:56,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:56,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:56,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:28:56,666 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:28:56,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:56" (1/1) ... [2020-07-29 01:28:56,684 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:56" (1/1) ... [2020-07-29 01:28:56,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:56,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:28:56,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:28:56,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:28:56,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:56" (1/1) ... [2020-07-29 01:28:56,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:56" (1/1) ... [2020-07-29 01:28:56,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:56" (1/1) ... [2020-07-29 01:28:56,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:56" (1/1) ... [2020-07-29 01:28:56,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:56" (1/1) ... [2020-07-29 01:28:56,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:56" (1/1) ... [2020-07-29 01:28:56,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:56" (1/1) ... [2020-07-29 01:28:56,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:28:56,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:28:56,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:28:56,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:28:56,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:56" (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-07-29 01:28:56,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:28:56,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:28:57,085 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:28:57,086 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-29 01:28:57,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:57 BoogieIcfgContainer [2020-07-29 01:28:57,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:28:57,090 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:28:57,091 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:28:57,094 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:28:57,094 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:57,094 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:28:56" (1/3) ... [2020-07-29 01:28:57,095 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75a2b1fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:57, skipping insertion in model container [2020-07-29 01:28:57,096 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:57,096 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:56" (2/3) ... [2020-07-29 01:28:57,096 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75a2b1fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:57, skipping insertion in model container [2020-07-29 01:28:57,096 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:57,096 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:57" (3/3) ... [2020-07-29 01:28:57,098 INFO L371 chiAutomizerObserver]: Analyzing ICFG PodelskiRybalchenko-LICS2004-Fig1.c [2020-07-29 01:28:57,152 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:28:57,153 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:28:57,153 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:28:57,153 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:28:57,153 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:28:57,153 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:28:57,154 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:28:57,154 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:28:57,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:28:57,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:57,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:57,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:57,211 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:28:57,211 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:28:57,211 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:28:57,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:28:57,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:57,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:57,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:57,217 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:28:57,217 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:28:57,225 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 3#L17-2true [2020-07-29 01:28:57,226 INFO L796 eck$LassoCheckResult]: Loop: 3#L17-2true assume !!(main_~x~0 >= 0 && main_~x~0 <= 1073741823);main_~y~0 := 1; 6#L19-2true assume !(main_~y~0 < main_~x~0); 5#L19-3true main_~x~0 := main_~x~0 - 1; 3#L17-2true [2020-07-29 01:28:57,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:57,233 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-07-29 01:28:57,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:57,246 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134580642] [2020-07-29 01:28:57,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:57,352 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:57,358 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:57,380 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:57,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:57,383 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2020-07-29 01:28:57,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:57,384 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053735034] [2020-07-29 01:28:57,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:57,414 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:57,419 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:57,421 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:57,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:57,423 INFO L82 PathProgramCache]: Analyzing trace with hash 963472, now seen corresponding path program 1 times [2020-07-29 01:28:57,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:57,424 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549849050] [2020-07-29 01:28:57,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:57,432 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:57,438 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:57,441 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:57,538 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:57,539 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:57,539 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:57,539 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:57,539 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:57,539 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:57,540 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:57,540 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:57,540 INFO L133 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-LICS2004-Fig1.c_Iteration1_Loop [2020-07-29 01:28:57,540 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:57,540 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:57,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:57,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:57,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:57,872 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:57,873 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-07-29 01:28:57,879 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:57,880 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 [2020-07-29 01:28:57,890 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:57,891 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2020-07-29 01:28:57,931 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:57,932 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:57,937 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:57,937 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:57,977 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:57,977 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) [2020-07-29 01:28:58,029 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:58,030 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:58,077 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:58,079 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:58,080 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:58,080 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:58,081 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:58,081 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:58,081 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:58,081 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:58,082 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:58,082 INFO L133 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-LICS2004-Fig1.c_Iteration1_Loop [2020-07-29 01:28:58,082 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:58,082 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:58,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:58,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:58,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:58,247 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:58,253 INFO L489 LassoAnalysis]: Using template 'affine'. 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-07-29 01:28:58,271 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-07-29 01:28:58,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:58,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:58,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:58,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:58,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:58,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:58,281 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-07-29 01:28:58,285 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:58,291 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:58,291 INFO L444 ModelExtractionUtils]: 1 out of 4 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 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:58,310 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:58,310 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:58,311 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:58,312 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 2*ULTIMATE.start_main_~x~0 + 1 Supporting invariants [] [2020-07-29 01:28:58,337 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:58,341 INFO L393 LassoCheck]: Loop: "assume !!(main_~x~0 >= 0 && main_~x~0 <= 1073741823);main_~y~0 := 1;" "assume !(main_~y~0 < main_~x~0);" "main_~x~0 := main_~x~0 - 1;" [2020-07-29 01:28:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:58,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:58,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:58,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:58,402 INFO L280 TraceCheckUtils]: 0: Hoare triple {18#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {18#unseeded} is VALID [2020-07-29 01:28:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:58,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:58,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:58,445 INFO L280 TraceCheckUtils]: 0: Hoare triple {21#(>= oldRank0 (+ (* 2 ULTIMATE.start_main_~x~0) 1))} assume !!(main_~x~0 >= 0 && main_~x~0 <= 1073741823);main_~y~0 := 1; {36#(and (<= (+ (* 2 ULTIMATE.start_main_~x~0) 1) oldRank0) (<= 0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:28:58,447 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#(and (<= (+ (* 2 ULTIMATE.start_main_~x~0) 1) oldRank0) (<= 0 ULTIMATE.start_main_~x~0))} assume !(main_~y~0 < main_~x~0); {36#(and (<= (+ (* 2 ULTIMATE.start_main_~x~0) 1) oldRank0) (<= 0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:28:58,448 INFO L280 TraceCheckUtils]: 2: Hoare triple {36#(and (<= (+ (* 2 ULTIMATE.start_main_~x~0) 1) oldRank0) (<= 0 ULTIMATE.start_main_~x~0))} main_~x~0 := main_~x~0 - 1; {31#(or (and (> oldRank0 (+ (* 2 ULTIMATE.start_main_~x~0) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:58,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:58,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:58,471 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:58,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:58,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,483 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-07-29 01:28:58,485 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 3 states. [2020-07-29 01:28:58,571 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 3 states. Result 23 states and 35 transitions. Complement of second has 7 states. [2020-07-29 01:28:58,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:58,572 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:58,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:28:58,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:58,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:58,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:58,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:58,577 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:28:58,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:58,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:58,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2020-07-29 01:28:58,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:58,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:58,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:58,582 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 01:28:58,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:58,584 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:28:58,585 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:58,587 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:28:58,588 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:58,588 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 35 transitions. cyclomatic complexity: 15 [2020-07-29 01:28:58,589 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:58,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:58,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:58,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:58,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:58,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:58,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:58,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:58,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:58,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:58,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:28:58,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:28:58,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 15 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:28:58,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:58,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:58,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:58,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:58,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:58,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:58,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:58,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:58,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:58,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:58,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:58,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:58,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:58,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:58,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:58,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:58,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:58,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:58,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:58,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:58,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:58,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:58,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:58,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:58,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,609 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:58,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2020-07-29 01:28:58,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:58,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:28:58,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:28:58,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 35 transitions. cyclomatic complexity: 15 [2020-07-29 01:28:58,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:58,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2020-07-29 01:28:58,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-07-29 01:28:58,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-07-29 01:28:58,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2020-07-29 01:28:58,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:58,628 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-29 01:28:58,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2020-07-29 01:28:58,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2020-07-29 01:28:58,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:58,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states and 10 transitions. Second operand 6 states. [2020-07-29 01:28:58,660 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states and 10 transitions. Second operand 6 states. [2020-07-29 01:28:58,663 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 6 states. [2020-07-29 01:28:58,666 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:58,669 INFO L93 Difference]: Finished difference Result 7 states and 10 transitions. [2020-07-29 01:28:58,670 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 10 transitions. [2020-07-29 01:28:58,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:58,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:58,671 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 7 states and 10 transitions. [2020-07-29 01:28:58,671 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 7 states and 10 transitions. [2020-07-29 01:28:58,672 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:58,673 INFO L93 Difference]: Finished difference Result 8 states and 12 transitions. [2020-07-29 01:28:58,674 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 12 transitions. [2020-07-29 01:28:58,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:58,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:58,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:58,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:58,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:28:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2020-07-29 01:28:58,677 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 9 transitions. [2020-07-29 01:28:58,677 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 9 transitions. [2020-07-29 01:28:58,678 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:28:58,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 9 transitions. [2020-07-29 01:28:58,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:58,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:58,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:58,679 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:28:58,679 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:28:58,680 INFO L794 eck$LassoCheckResult]: Stem: 80#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 76#L17-2 assume !!(main_~x~0 >= 0 && main_~x~0 <= 1073741823);main_~y~0 := 1; 78#L19-2 [2020-07-29 01:28:58,680 INFO L796 eck$LassoCheckResult]: Loop: 78#L19-2 assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; 78#L19-2 [2020-07-29 01:28:58,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:58,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2020-07-29 01:28:58,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:58,681 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108527086] [2020-07-29 01:28:58,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:58,687 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:58,691 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:58,692 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:58,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:58,693 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2020-07-29 01:28:58,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:58,694 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964864617] [2020-07-29 01:28:58,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:58,699 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:58,703 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:58,705 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:58,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:58,708 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2020-07-29 01:28:58,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:58,708 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696814679] [2020-07-29 01:28:58,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:58,720 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:58,733 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:58,736 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:58,806 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:58,806 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:58,806 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:58,806 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:58,806 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:58,807 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:58,807 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:58,807 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:58,807 INFO L133 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-LICS2004-Fig1.c_Iteration2_Lasso [2020-07-29 01:28:58,807 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:58,808 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:58,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:58,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:58,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:58,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:58,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-07-29 01:28:58,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:59,033 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:59,034 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) [2020-07-29 01:28:59,046 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:59,047 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:59,052 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:59,052 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-07-29 01:28:59,101 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:59,101 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-07-29 01:28:59,105 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:59,105 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-07-29 01:28:59,156 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:59,156 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:59,208 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:59,209 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:11,344 INFO L442 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2020-07-29 01:29:11,351 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:11,352 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:11,352 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:11,352 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:11,352 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:11,352 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:11,352 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:11,352 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:11,352 INFO L133 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-LICS2004-Fig1.c_Iteration2_Lasso [2020-07-29 01:29:11,353 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:11,353 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:11,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:11,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:11,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:11,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:11,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:11,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:11,553 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:11,553 INFO L489 LassoAnalysis]: Using template 'affine'. 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-07-29 01:29:11,569 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-07-29 01:29:11,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:11,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:11,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:11,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:11,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:11,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:11,582 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:11,628 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-07-29 01:29:11,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:11,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:11,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:11,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:11,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:11,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:11,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:11,635 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:11,686 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-07-29 01:29:11,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:11,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:11,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:11,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:11,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:11,691 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:11,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:11,693 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:11,743 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-07-29 01:29:11,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:11,745 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:11,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:11,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:11,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:11,746 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:11,746 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:11,748 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:11,794 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-07-29 01:29:11,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:11,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:11,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:11,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:11,803 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:11,803 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:11,813 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:11,821 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:29:11,821 INFO L444 ModelExtractionUtils]: 4 out of 10 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:11,834 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:11,838 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:29:11,839 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:11,839 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~y~0 + 1*ULTIMATE.start_main_~x~0 Supporting invariants [1*ULTIMATE.start_main_~y~0 - 1 >= 0] [2020-07-29 01:29:11,878 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:29:11,883 INFO L393 LassoCheck]: Loop: "assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0;" [2020-07-29 01:29:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:11,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:11,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:29:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:11,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:11,924 INFO L280 TraceCheckUtils]: 0: Hoare triple {125#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {125#unseeded} is VALID [2020-07-29 01:29:11,926 INFO L280 TraceCheckUtils]: 1: Hoare triple {125#unseeded} assume !!(main_~x~0 >= 0 && main_~x~0 <= 1073741823);main_~y~0 := 1; {144#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:29:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:11,930 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:29:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:11,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:11,935 INFO L280 TraceCheckUtils]: 0: Hoare triple {145#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0)) (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0))} assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; {147#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0))) unseeded) (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0))} is VALID [2020-07-29 01:29:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:11,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:29:11,944 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:11,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:11,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:11,945 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:29:11,945 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 9 transitions. cyclomatic complexity: 5 Second operand 2 states. [2020-07-29 01:29:12,007 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 9 transitions. cyclomatic complexity: 5. Second operand 2 states. Result 13 states and 18 transitions. Complement of second has 5 states. [2020-07-29 01:29:12,008 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-07-29 01:29:12,008 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:12,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 9 transitions. cyclomatic complexity: 5 [2020-07-29 01:29:12,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:12,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:12,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:29:12,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:12,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:12,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:12,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2020-07-29 01:29:12,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:12,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:12,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:12,011 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states and 9 transitions. cyclomatic complexity: 5 [2020-07-29 01:29:12,011 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:12,011 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:29:12,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:12,012 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:12,012 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 18 transitions. cyclomatic complexity: 9 [2020-07-29 01:29:12,013 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:12,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:12,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:12,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:12,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:12,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:12,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:12,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 1 letters. [2020-07-29 01:29:12,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 5 letters. Loop has 1 letters. [2020-07-29 01:29:12,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 1 letters. [2020-07-29 01:29:12,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:29:12,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:29:12,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:29:12,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:29:12,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:29:12,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:29:12,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:12,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:12,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:12,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:12,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:12,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:12,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:12,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:12,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:12,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 1 letters. [2020-07-29 01:29:12,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 5 letters. Loop has 1 letters. [2020-07-29 01:29:12,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 1 letters. [2020-07-29 01:29:12,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,023 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:12,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:29:12,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:29:12,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:12,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:29:12,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:12,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:12,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. cyclomatic complexity: 9 [2020-07-29 01:29:12,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:12,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 13 transitions. [2020-07-29 01:29:12,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-07-29 01:29:12,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-07-29 01:29:12,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2020-07-29 01:29:12,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:12,029 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2020-07-29 01:29:12,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2020-07-29 01:29:12,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 6. [2020-07-29 01:29:12,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:12,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 13 transitions. Second operand 6 states. [2020-07-29 01:29:12,031 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 13 transitions. Second operand 6 states. [2020-07-29 01:29:12,031 INFO L87 Difference]: Start difference. First operand 9 states and 13 transitions. Second operand 6 states. [2020-07-29 01:29:12,032 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:12,033 INFO L93 Difference]: Finished difference Result 9 states and 13 transitions. [2020-07-29 01:29:12,034 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 13 transitions. [2020-07-29 01:29:12,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:12,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:12,034 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 9 states and 13 transitions. [2020-07-29 01:29:12,035 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 9 states and 13 transitions. [2020-07-29 01:29:12,035 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:12,037 INFO L93 Difference]: Finished difference Result 9 states and 13 transitions. [2020-07-29 01:29:12,037 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 13 transitions. [2020-07-29 01:29:12,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:12,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:12,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:12,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:12,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:29:12,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2020-07-29 01:29:12,039 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2020-07-29 01:29:12,039 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2020-07-29 01:29:12,039 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:29:12,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2020-07-29 01:29:12,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:12,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:12,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:12,041 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2020-07-29 01:29:12,041 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:29:12,041 INFO L794 eck$LassoCheckResult]: Stem: 182#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 177#L17-2 assume !!(main_~x~0 >= 0 && main_~x~0 <= 1073741823);main_~y~0 := 1; 178#L19-2 assume !(main_~y~0 < main_~x~0); 181#L19-3 main_~x~0 := main_~x~0 - 1; 179#L17-2 assume !!(main_~x~0 >= 0 && main_~x~0 <= 1073741823);main_~y~0 := 1; 180#L19-2 [2020-07-29 01:29:12,041 INFO L796 eck$LassoCheckResult]: Loop: 180#L19-2 assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; 180#L19-2 [2020-07-29 01:29:12,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:12,042 INFO L82 PathProgramCache]: Analyzing trace with hash 29867642, now seen corresponding path program 2 times [2020-07-29 01:29:12,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:12,043 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970791349] [2020-07-29 01:29:12,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:12,049 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:12,054 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:12,056 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:12,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:12,057 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2020-07-29 01:29:12,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:12,057 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807689350] [2020-07-29 01:29:12,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:12,061 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:12,064 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:12,065 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:12,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:12,065 INFO L82 PathProgramCache]: Analyzing trace with hash 925896921, now seen corresponding path program 1 times [2020-07-29 01:29:12,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:12,066 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325867945] [2020-07-29 01:29:12,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:12,167 INFO L280 TraceCheckUtils]: 0: Hoare triple {236#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {236#true} is VALID [2020-07-29 01:29:12,168 INFO L280 TraceCheckUtils]: 1: Hoare triple {236#true} assume !!(main_~x~0 >= 0 && main_~x~0 <= 1073741823);main_~y~0 := 1; {238#(<= ULTIMATE.start_main_~y~0 1)} is VALID [2020-07-29 01:29:12,169 INFO L280 TraceCheckUtils]: 2: Hoare triple {238#(<= ULTIMATE.start_main_~y~0 1)} assume !(main_~y~0 < main_~x~0); {239#(<= ULTIMATE.start_main_~x~0 1)} is VALID [2020-07-29 01:29:12,170 INFO L280 TraceCheckUtils]: 3: Hoare triple {239#(<= ULTIMATE.start_main_~x~0 1)} main_~x~0 := main_~x~0 - 1; {240#(<= ULTIMATE.start_main_~x~0 0)} is VALID [2020-07-29 01:29:12,171 INFO L280 TraceCheckUtils]: 4: Hoare triple {240#(<= ULTIMATE.start_main_~x~0 0)} assume !!(main_~x~0 >= 0 && main_~x~0 <= 1073741823);main_~y~0 := 1; {241#(<= (+ ULTIMATE.start_main_~x~0 1) ULTIMATE.start_main_~y~0)} is VALID [2020-07-29 01:29:12,172 INFO L280 TraceCheckUtils]: 5: Hoare triple {241#(<= (+ ULTIMATE.start_main_~x~0 1) ULTIMATE.start_main_~y~0)} assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; {237#false} is VALID [2020-07-29 01:29:12,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:12,174 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325867945] [2020-07-29 01:29:12,175 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168675043] [2020-07-29 01:29:12,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:29:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:12,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:29:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:12,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:12,369 INFO L280 TraceCheckUtils]: 0: Hoare triple {236#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {236#true} is VALID [2020-07-29 01:29:12,370 INFO L280 TraceCheckUtils]: 1: Hoare triple {236#true} assume !!(main_~x~0 >= 0 && main_~x~0 <= 1073741823);main_~y~0 := 1; {238#(<= ULTIMATE.start_main_~y~0 1)} is VALID [2020-07-29 01:29:12,372 INFO L280 TraceCheckUtils]: 2: Hoare triple {238#(<= ULTIMATE.start_main_~y~0 1)} assume !(main_~y~0 < main_~x~0); {239#(<= ULTIMATE.start_main_~x~0 1)} is VALID [2020-07-29 01:29:12,373 INFO L280 TraceCheckUtils]: 3: Hoare triple {239#(<= ULTIMATE.start_main_~x~0 1)} main_~x~0 := main_~x~0 - 1; {240#(<= ULTIMATE.start_main_~x~0 0)} is VALID [2020-07-29 01:29:12,374 INFO L280 TraceCheckUtils]: 4: Hoare triple {240#(<= ULTIMATE.start_main_~x~0 0)} assume !!(main_~x~0 >= 0 && main_~x~0 <= 1073741823);main_~y~0 := 1; {257#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 0))} is VALID [2020-07-29 01:29:12,375 INFO L280 TraceCheckUtils]: 5: Hoare triple {257#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 0))} assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; {237#false} is VALID [2020-07-29 01:29:12,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:12,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:29:12,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-29 01:29:12,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942072711] [2020-07-29 01:29:12,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:12,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:29:12,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:29:12,404 INFO L87 Difference]: Start difference. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 7 states. [2020-07-29 01:29:12,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:12,522 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2020-07-29 01:29:12,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:29:12,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:29:12,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:12,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 18 transitions. [2020-07-29 01:29:12,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:12,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 8 states and 10 transitions. [2020-07-29 01:29:12,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-07-29 01:29:12,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-07-29 01:29:12,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2020-07-29 01:29:12,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:12,536 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-29 01:29:12,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2020-07-29 01:29:12,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2020-07-29 01:29:12,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:12,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 10 transitions. Second operand 7 states. [2020-07-29 01:29:12,537 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 10 transitions. Second operand 7 states. [2020-07-29 01:29:12,537 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 7 states. [2020-07-29 01:29:12,538 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:12,540 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2020-07-29 01:29:12,541 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:29:12,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:12,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:12,541 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 8 states and 10 transitions. [2020-07-29 01:29:12,541 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 8 states and 10 transitions. [2020-07-29 01:29:12,544 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:12,546 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2020-07-29 01:29:12,546 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:29:12,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:12,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:12,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:12,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:12,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:29:12,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2020-07-29 01:29:12,549 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-29 01:29:12,549 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-29 01:29:12,549 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:29:12,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2020-07-29 01:29:12,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:12,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:12,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:12,550 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2020-07-29 01:29:12,550 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:29:12,550 INFO L794 eck$LassoCheckResult]: Stem: 282#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 278#L17-2 assume !!(main_~x~0 >= 0 && main_~x~0 <= 1073741823);main_~y~0 := 1; 279#L19-2 assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; 284#L19-2 assume !(main_~y~0 < main_~x~0); 283#L19-3 main_~x~0 := main_~x~0 - 1; 280#L17-2 assume !!(main_~x~0 >= 0 && main_~x~0 <= 1073741823);main_~y~0 := 1; 281#L19-2 [2020-07-29 01:29:12,551 INFO L796 eck$LassoCheckResult]: Loop: 281#L19-2 assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; 281#L19-2 [2020-07-29 01:29:12,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:12,551 INFO L82 PathProgramCache]: Analyzing trace with hash 925951131, now seen corresponding path program 2 times [2020-07-29 01:29:12,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:12,551 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629941049] [2020-07-29 01:29:12,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:12,573 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:12,582 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:12,585 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:12,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:12,586 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 3 times [2020-07-29 01:29:12,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:12,586 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18876328] [2020-07-29 01:29:12,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:12,594 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:12,599 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:12,600 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:12,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:12,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1360285992, now seen corresponding path program 3 times [2020-07-29 01:29:12,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:12,604 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200321387] [2020-07-29 01:29:12,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:12,683 INFO L280 TraceCheckUtils]: 0: Hoare triple {344#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {344#true} is VALID [2020-07-29 01:29:12,685 INFO L280 TraceCheckUtils]: 1: Hoare triple {344#true} assume !!(main_~x~0 >= 0 && main_~x~0 <= 1073741823);main_~y~0 := 1; {346#(<= ULTIMATE.start_main_~y~0 1)} is VALID [2020-07-29 01:29:12,686 INFO L280 TraceCheckUtils]: 2: Hoare triple {346#(<= ULTIMATE.start_main_~y~0 1)} assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; {347#(<= ULTIMATE.start_main_~y~0 2)} is VALID [2020-07-29 01:29:12,687 INFO L280 TraceCheckUtils]: 3: Hoare triple {347#(<= ULTIMATE.start_main_~y~0 2)} assume !(main_~y~0 < main_~x~0); {348#(<= ULTIMATE.start_main_~x~0 2)} is VALID [2020-07-29 01:29:12,688 INFO L280 TraceCheckUtils]: 4: Hoare triple {348#(<= ULTIMATE.start_main_~x~0 2)} main_~x~0 := main_~x~0 - 1; {349#(<= ULTIMATE.start_main_~x~0 1)} is VALID [2020-07-29 01:29:12,689 INFO L280 TraceCheckUtils]: 5: Hoare triple {349#(<= ULTIMATE.start_main_~x~0 1)} assume !!(main_~x~0 >= 0 && main_~x~0 <= 1073741823);main_~y~0 := 1; {350#(<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)} is VALID [2020-07-29 01:29:12,690 INFO L280 TraceCheckUtils]: 6: Hoare triple {350#(<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)} assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; {345#false} is VALID [2020-07-29 01:29:12,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:12,691 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200321387] [2020-07-29 01:29:12,691 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839827722] [2020-07-29 01:29:12,691 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-29 01:29:12,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-29 01:29:12,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:29:12,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:29:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:12,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:12,825 INFO L280 TraceCheckUtils]: 0: Hoare triple {344#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {344#true} is VALID [2020-07-29 01:29:12,826 INFO L280 TraceCheckUtils]: 1: Hoare triple {344#true} assume !!(main_~x~0 >= 0 && main_~x~0 <= 1073741823);main_~y~0 := 1; {346#(<= ULTIMATE.start_main_~y~0 1)} is VALID [2020-07-29 01:29:12,827 INFO L280 TraceCheckUtils]: 2: Hoare triple {346#(<= ULTIMATE.start_main_~y~0 1)} assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; {347#(<= ULTIMATE.start_main_~y~0 2)} is VALID [2020-07-29 01:29:12,828 INFO L280 TraceCheckUtils]: 3: Hoare triple {347#(<= ULTIMATE.start_main_~y~0 2)} assume !(main_~y~0 < main_~x~0); {348#(<= ULTIMATE.start_main_~x~0 2)} is VALID [2020-07-29 01:29:12,828 INFO L280 TraceCheckUtils]: 4: Hoare triple {348#(<= ULTIMATE.start_main_~x~0 2)} main_~x~0 := main_~x~0 - 1; {349#(<= ULTIMATE.start_main_~x~0 1)} is VALID [2020-07-29 01:29:12,829 INFO L280 TraceCheckUtils]: 5: Hoare triple {349#(<= ULTIMATE.start_main_~x~0 1)} assume !!(main_~x~0 >= 0 && main_~x~0 <= 1073741823);main_~y~0 := 1; {369#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 1))} is VALID [2020-07-29 01:29:12,830 INFO L280 TraceCheckUtils]: 6: Hoare triple {369#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 1))} assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; {345#false} is VALID [2020-07-29 01:29:12,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:12,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:29:12,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-29 01:29:12,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652051357] [2020-07-29 01:29:12,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:12,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:29:12,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:29:12,852 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 8 states. [2020-07-29 01:29:12,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:12,984 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2020-07-29 01:29:12,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:29:12,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:29:12,999 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:12,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2020-07-29 01:29:13,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:13,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 12 transitions. [2020-07-29 01:29:13,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 01:29:13,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-29 01:29:13,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2020-07-29 01:29:13,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:13,003 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-07-29 01:29:13,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2020-07-29 01:29:13,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2020-07-29 01:29:13,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:13,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 12 transitions. Second operand 8 states. [2020-07-29 01:29:13,004 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 12 transitions. Second operand 8 states. [2020-07-29 01:29:13,004 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 8 states. [2020-07-29 01:29:13,005 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:13,006 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2020-07-29 01:29:13,006 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2020-07-29 01:29:13,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:13,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:13,006 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 10 states and 12 transitions. [2020-07-29 01:29:13,006 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 10 states and 12 transitions. [2020-07-29 01:29:13,007 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:13,008 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2020-07-29 01:29:13,008 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2020-07-29 01:29:13,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:13,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:13,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:13,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:13,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:29:13,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2020-07-29 01:29:13,009 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-29 01:29:13,010 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-29 01:29:13,010 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:29:13,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2020-07-29 01:29:13,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:13,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:13,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:13,011 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2020-07-29 01:29:13,011 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:29:13,011 INFO L794 eck$LassoCheckResult]: Stem: 394#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 390#L17-2 assume !!(main_~x~0 >= 0 && main_~x~0 <= 1073741823);main_~y~0 := 1; 391#L19-2 assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; 396#L19-2 assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; 397#L19-2 assume !(main_~y~0 < main_~x~0); 395#L19-3 main_~x~0 := main_~x~0 - 1; 392#L17-2 assume !!(main_~x~0 >= 0 && main_~x~0 <= 1073741823);main_~y~0 := 1; 393#L19-2 [2020-07-29 01:29:13,011 INFO L796 eck$LassoCheckResult]: Loop: 393#L19-2 assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; 393#L19-2 [2020-07-29 01:29:13,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:13,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1360231782, now seen corresponding path program 4 times [2020-07-29 01:29:13,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:13,012 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479649331] [2020-07-29 01:29:13,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:13,019 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:13,025 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:13,026 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:13,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:13,027 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 4 times [2020-07-29 01:29:13,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:13,027 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42378215] [2020-07-29 01:29:13,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:13,030 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:13,032 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:13,033 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:13,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:13,033 INFO L82 PathProgramCache]: Analyzing trace with hash 782487737, now seen corresponding path program 5 times [2020-07-29 01:29:13,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:13,034 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856683751] [2020-07-29 01:29:13,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:13,042 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:13,048 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:13,050 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:13,151 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:13,151 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:13,151 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:13,152 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:13,152 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:13,152 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:13,152 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:13,152 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:13,152 INFO L133 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-LICS2004-Fig1.c_Iteration5_Lasso [2020-07-29 01:29:13,152 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:13,153 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:13,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:13,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:13,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:13,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:13,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:13,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:13,336 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:13,336 INFO L404 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:13,339 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:13,339 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:13,342 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:13,342 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:13,366 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:13,366 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:13,368 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:13,369 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:13,393 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:13,393 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:13,396 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:13,396 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:13,421 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:13,422 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:13,425 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:13,425 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:13,450 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:13,450 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:13,480 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:13,480 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:13,579 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:13,581 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:13,581 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:13,581 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:13,581 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:13,581 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:13,582 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:13,582 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:13,582 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:13,582 INFO L133 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-LICS2004-Fig1.c_Iteration5_Lasso [2020-07-29 01:29:13,582 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:13,582 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:13,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:13,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:13,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:13,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:13,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:13,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:13,779 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:13,779 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:13,782 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-07-29 01:29:13,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:13,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:13,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:13,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:13,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:13,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:13,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:13,786 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 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:13,811 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-07-29 01:29:13,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:13,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:13,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:13,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:13,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:13,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:13,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:13,816 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 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:13,839 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-07-29 01:29:13,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:13,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:13,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:13,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:13,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:13,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:13,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:13,844 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 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-07-29 01:29:13,867 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-07-29 01:29:13,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:13,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:13,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:13,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:13,871 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:13,871 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:13,876 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:13,919 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-07-29 01:29:13,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:13,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:13,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:13,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:13,924 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:13,924 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:13,929 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) [2020-07-29 01:29:13,968 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-07-29 01:29:13,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:13,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:13,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:13,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:13,974 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:13,974 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:13,985 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:13,996 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-07-29 01:29:13,996 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 3 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-07-29 01:29:14,000 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:14,003 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:29:14,004 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:14,004 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~y~0 + 1*ULTIMATE.start_main_~x~0 Supporting invariants [1*ULTIMATE.start_main_~y~0 - 1 >= 0] [2020-07-29 01:29:14,041 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:29:14,046 INFO L393 LassoCheck]: Loop: "assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0;" [2020-07-29 01:29:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:14,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:14,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:29:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:14,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:14,094 INFO L280 TraceCheckUtils]: 0: Hoare triple {471#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {471#unseeded} is VALID [2020-07-29 01:29:14,095 INFO L280 TraceCheckUtils]: 1: Hoare triple {471#unseeded} assume !!(main_~x~0 >= 0 && main_~x~0 <= 1073741823);main_~y~0 := 1; {471#unseeded} is VALID [2020-07-29 01:29:14,096 INFO L280 TraceCheckUtils]: 2: Hoare triple {471#unseeded} assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; {471#unseeded} is VALID [2020-07-29 01:29:14,097 INFO L280 TraceCheckUtils]: 3: Hoare triple {471#unseeded} assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; {471#unseeded} is VALID [2020-07-29 01:29:14,098 INFO L280 TraceCheckUtils]: 4: Hoare triple {471#unseeded} assume !(main_~y~0 < main_~x~0); {471#unseeded} is VALID [2020-07-29 01:29:14,099 INFO L280 TraceCheckUtils]: 5: Hoare triple {471#unseeded} main_~x~0 := main_~x~0 - 1; {471#unseeded} is VALID [2020-07-29 01:29:14,100 INFO L280 TraceCheckUtils]: 6: Hoare triple {471#unseeded} assume !!(main_~x~0 >= 0 && main_~x~0 <= 1073741823);main_~y~0 := 1; {490#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:29:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:14,105 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:29:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:14,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:14,111 INFO L280 TraceCheckUtils]: 0: Hoare triple {491#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0)) (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0))} assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; {493#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0))) unseeded) (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0))} is VALID [2020-07-29 01:29:14,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:14,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:29:14,123 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:14,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,124 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:29:14,124 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 2 states. [2020-07-29 01:29:14,177 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 15 states and 19 transitions. Complement of second has 5 states. [2020-07-29 01:29:14,178 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-07-29 01:29:14,178 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:14,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2020-07-29 01:29:14,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:14,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:14,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:29:14,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:14,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:14,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:14,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2020-07-29 01:29:14,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:14,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:14,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:14,181 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2020-07-29 01:29:14,182 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:14,182 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:29:14,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:14,183 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:14,183 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 19 transitions. cyclomatic complexity: 7 [2020-07-29 01:29:14,183 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:14,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:14,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:14,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:14,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:29:14,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:29:14,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:29:14,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:29:14,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:29:14,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:29:14,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:14,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:14,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:14,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:14,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:14,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:14,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,196 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:14,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:29:14,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:29:14,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,197 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:29:14,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:14,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:29:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:14,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:14,244 INFO L280 TraceCheckUtils]: 0: Hoare triple {471#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {471#unseeded} is VALID [2020-07-29 01:29:14,245 INFO L280 TraceCheckUtils]: 1: Hoare triple {471#unseeded} assume !!(main_~x~0 >= 0 && main_~x~0 <= 1073741823);main_~y~0 := 1; {471#unseeded} is VALID [2020-07-29 01:29:14,246 INFO L280 TraceCheckUtils]: 2: Hoare triple {471#unseeded} assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; {471#unseeded} is VALID [2020-07-29 01:29:14,247 INFO L280 TraceCheckUtils]: 3: Hoare triple {471#unseeded} assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; {471#unseeded} is VALID [2020-07-29 01:29:14,248 INFO L280 TraceCheckUtils]: 4: Hoare triple {471#unseeded} assume !(main_~y~0 < main_~x~0); {471#unseeded} is VALID [2020-07-29 01:29:14,249 INFO L280 TraceCheckUtils]: 5: Hoare triple {471#unseeded} main_~x~0 := main_~x~0 - 1; {471#unseeded} is VALID [2020-07-29 01:29:14,250 INFO L280 TraceCheckUtils]: 6: Hoare triple {471#unseeded} assume !!(main_~x~0 >= 0 && main_~x~0 <= 1073741823);main_~y~0 := 1; {490#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:29:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:14,255 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:29:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:14,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:14,261 INFO L280 TraceCheckUtils]: 0: Hoare triple {491#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0)) (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0))} assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; {493#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0))) unseeded) (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0))} is VALID [2020-07-29 01:29:14,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:14,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:29:14,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:14,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,272 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:29:14,272 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 2 states. [2020-07-29 01:29:14,315 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 15 states and 19 transitions. Complement of second has 5 states. [2020-07-29 01:29:14,315 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-07-29 01:29:14,316 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:14,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2020-07-29 01:29:14,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:14,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:14,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:29:14,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:14,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:14,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:14,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2020-07-29 01:29:14,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:14,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:14,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:14,319 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2020-07-29 01:29:14,319 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:14,319 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:29:14,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:14,320 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:14,320 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 19 transitions. cyclomatic complexity: 7 [2020-07-29 01:29:14,320 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:14,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:14,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:14,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:14,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:29:14,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:29:14,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:29:14,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:29:14,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:29:14,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:29:14,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:14,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:14,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:14,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:14,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:14,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:14,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,332 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:14,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:29:14,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:29:14,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,334 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:29:14,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:14,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:29:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:14,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:14,371 INFO L280 TraceCheckUtils]: 0: Hoare triple {471#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {471#unseeded} is VALID [2020-07-29 01:29:14,372 INFO L280 TraceCheckUtils]: 1: Hoare triple {471#unseeded} assume !!(main_~x~0 >= 0 && main_~x~0 <= 1073741823);main_~y~0 := 1; {471#unseeded} is VALID [2020-07-29 01:29:14,373 INFO L280 TraceCheckUtils]: 2: Hoare triple {471#unseeded} assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; {471#unseeded} is VALID [2020-07-29 01:29:14,373 INFO L280 TraceCheckUtils]: 3: Hoare triple {471#unseeded} assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; {471#unseeded} is VALID [2020-07-29 01:29:14,374 INFO L280 TraceCheckUtils]: 4: Hoare triple {471#unseeded} assume !(main_~y~0 < main_~x~0); {471#unseeded} is VALID [2020-07-29 01:29:14,375 INFO L280 TraceCheckUtils]: 5: Hoare triple {471#unseeded} main_~x~0 := main_~x~0 - 1; {471#unseeded} is VALID [2020-07-29 01:29:14,376 INFO L280 TraceCheckUtils]: 6: Hoare triple {471#unseeded} assume !!(main_~x~0 >= 0 && main_~x~0 <= 1073741823);main_~y~0 := 1; {490#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:29:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:14,380 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:29:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:14,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:14,385 INFO L280 TraceCheckUtils]: 0: Hoare triple {491#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0)) (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0))} assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; {493#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0))) unseeded) (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0))} is VALID [2020-07-29 01:29:14,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:14,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:29:14,394 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:14,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,395 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 1 loop predicates [2020-07-29 01:29:14,395 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 2 states. [2020-07-29 01:29:14,454 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 11 states and 13 transitions. Complement of second has 4 states. [2020-07-29 01:29:14,454 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-07-29 01:29:14,454 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:14,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2020-07-29 01:29:14,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:14,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:14,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:29:14,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:14,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:14,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:14,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2020-07-29 01:29:14,456 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:14,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:14,457 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2020-07-29 01:29:14,457 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:14,457 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:29:14,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:14,458 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:14,458 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 01:29:14,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 01:29:14,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:14,458 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:29:14,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:14,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:14,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:14,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:29:14,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:29:14,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:29:14,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:29:14,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:29:14,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:29:14,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:14,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:14,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:14,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:14,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:14,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:14,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,464 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:14,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:29:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2020-07-29 01:29:14,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:29:14,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:14,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:14,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:14,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 01:29:14,466 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:14,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2020-07-29 01:29:14,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:29:14,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:29:14,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:29:14,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:29:14,467 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:29:14,467 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:29:14,467 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:29:14,467 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:29:14,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:29:14,467 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:14,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:14,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:29:14 BoogieIcfgContainer [2020-07-29 01:29:14,475 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:29:14,475 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:29:14,475 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:29:14,476 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:29:14,476 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:57" (3/4) ... [2020-07-29 01:29:14,480 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:29:14,480 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:29:14,483 INFO L168 Benchmark]: Toolchain (without parser) took 18066.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.3 MB). Free memory was 950.8 MB in the beginning and 877.2 MB in the end (delta: 73.6 MB). Peak memory consumption was 286.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:14,484 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:29:14,485 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.67 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:14,485 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.39 ms. Allocated memory is still 1.0 GB. Free memory is still 940.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:29:14,486 INFO L168 Benchmark]: Boogie Preprocessor took 119.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 940.1 MB in the beginning and 1.1 GB in the end (delta: -209.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:14,487 INFO L168 Benchmark]: RCFGBuilder took 260.66 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: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:14,488 INFO L168 Benchmark]: BuchiAutomizer took 17384.46 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 58.7 MB). Free memory was 1.1 GB in the beginning and 877.2 MB in the end (delta: 247.6 MB). Peak memory consumption was 306.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:14,488 INFO L168 Benchmark]: Witness Printer took 5.00 ms. Allocated memory is still 1.2 GB. Free memory is still 877.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:29:14,491 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 243.67 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.39 ms. Allocated memory is still 1.0 GB. Free memory is still 940.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 119.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 940.1 MB in the beginning and 1.1 GB in the end (delta: -209.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 260.66 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: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17384.46 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 58.7 MB). Free memory was 1.1 GB in the beginning and 877.2 MB in the end (delta: 247.6 MB). Peak memory consumption was 306.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.00 ms. Allocated memory is still 1.2 GB. Free memory is still 877.2 MB. 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * x + 1 and consists of 5 locations. One deterministic module has affine ranking function -1 * y + x and consists of 3 locations. One nondeterministic module has affine ranking function -1 * y + x and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 16.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 7 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 8 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 19 SDtfs, 32 SDslu, 7 SDs, 0 SdLazy, 93 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax164 hnf97 lsp59 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq155 hnf92 smp100 dnf100 smp100 tf102 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 12.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...