./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.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 ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:16:04,172 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:16:04,178 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:16:04,195 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:16:04,195 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:16:04,197 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:16:04,198 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:16:04,201 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:16:04,203 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:16:04,206 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:16:04,209 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:16:04,209 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:16:04,210 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:16:04,211 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:16:04,212 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:16:04,213 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:16:04,214 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:16:04,216 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:16:04,218 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:16:04,220 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:16:04,221 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:16:04,222 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:16:04,225 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:16:04,225 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:16:04,225 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:16:04,226 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:16:04,227 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:16:04,228 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:16:04,228 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:16:04,229 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:16:04,230 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:16:04,230 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:16:04,231 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:16:04,231 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:16:04,234 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:16:04,235 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:16:04,236 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:16:04,271 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:16:04,271 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:16:04,272 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:16:04,272 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:16:04,273 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:16:04,274 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:16:04,274 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:16:04,275 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:16:04,276 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:16:04,276 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:16:04,277 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:16:04,277 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:16:04,277 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:16:04,277 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:16:04,277 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:16:04,278 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:16:04,278 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:16:04,278 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:16:04,279 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:16:04,279 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:16:04,279 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:16:04,279 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:16:04,279 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:16:04,280 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:16:04,282 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:16:04,282 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:16:04,282 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:16:04,283 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:16:04,284 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:16:04,285 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d [2019-01-14 02:16:04,345 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:16:04,359 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:16:04,365 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:16:04,367 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:16:04,368 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:16:04,368 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2019-01-14 02:16:04,438 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c4a7d071/71ee59b0e5994393bf500845c5af4bd5/FLAGf0a57088d [2019-01-14 02:16:04,907 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:16:04,907 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2019-01-14 02:16:04,913 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c4a7d071/71ee59b0e5994393bf500845c5af4bd5/FLAGf0a57088d [2019-01-14 02:16:05,278 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c4a7d071/71ee59b0e5994393bf500845c5af4bd5 [2019-01-14 02:16:05,283 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:16:05,285 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:16:05,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:16:05,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:16:05,290 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:16:05,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:16:05" (1/1) ... [2019-01-14 02:16:05,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50a3827e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:05, skipping insertion in model container [2019-01-14 02:16:05,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:16:05" (1/1) ... [2019-01-14 02:16:05,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:16:05,325 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:16:05,538 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:16:05,545 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:16:05,568 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:16:05,585 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:16:05,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:05 WrapperNode [2019-01-14 02:16:05,586 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:16:05,587 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:16:05,587 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:16:05,587 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:16:05,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:05" (1/1) ... [2019-01-14 02:16:05,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:05" (1/1) ... [2019-01-14 02:16:05,625 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:16:05,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:16:05,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:16:05,625 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:16:05,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:05" (1/1) ... [2019-01-14 02:16:05,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:05" (1/1) ... [2019-01-14 02:16:05,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:05" (1/1) ... [2019-01-14 02:16:05,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:05" (1/1) ... [2019-01-14 02:16:05,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:05" (1/1) ... [2019-01-14 02:16:05,642 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:05" (1/1) ... [2019-01-14 02:16:05,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:05" (1/1) ... [2019-01-14 02:16:05,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:16:05,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:16:05,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:16:05,645 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:16:05,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:05" (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 [2019-01-14 02:16:05,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:16:05,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:16:05,974 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:16:05,975 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 02:16:05,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:16:05 BoogieIcfgContainer [2019-01-14 02:16:05,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:16:05,976 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:16:05,976 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:16:05,980 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:16:05,980 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:16:05,981 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:16:05" (1/3) ... [2019-01-14 02:16:05,982 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4dc25b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:16:05, skipping insertion in model container [2019-01-14 02:16:05,982 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:16:05,982 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:05" (2/3) ... [2019-01-14 02:16:05,982 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4dc25b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:16:05, skipping insertion in model container [2019-01-14 02:16:05,983 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:16:05,983 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:16:05" (3/3) ... [2019-01-14 02:16:05,984 INFO L375 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2019-01-14 02:16:06,042 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:16:06,043 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:16:06,043 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:16:06,043 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:16:06,043 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:16:06,043 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:16:06,044 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:16:06,044 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:16:06,045 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:16:06,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-14 02:16:06,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:16:06,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:06,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:06,087 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:16:06,088 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:16:06,088 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:16:06,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-14 02:16:06,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:16:06,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:06,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:06,090 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:16:06,090 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:16:06,098 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 4#L21true assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 5#L23-2true [2019-01-14 02:16:06,098 INFO L796 eck$LassoCheckResult]: Loop: 5#L23-2true assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 8#L25-2true assume !(main_~j~0 < main_~m~0); 7#L25-3true main_~i~0 := 1 + main_~i~0; 5#L23-2true [2019-01-14 02:16:06,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:06,105 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2019-01-14 02:16:06,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:06,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:06,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:06,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:06,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:06,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:06,226 INFO L82 PathProgramCache]: Analyzing trace with hash 42943, now seen corresponding path program 1 times [2019-01-14 02:16:06,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:06,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:06,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:06,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:06,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:06,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:06,240 INFO L82 PathProgramCache]: Analyzing trace with hash 29684988, now seen corresponding path program 1 times [2019-01-14 02:16:06,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:06,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:06,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:06,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:06,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:06,454 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 02:16:06,469 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:06,470 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:06,471 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:06,471 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:06,471 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:16:06,472 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:06,472 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:06,472 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:06,472 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:16:06,473 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:06,473 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:06,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:06,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:06,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:06,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:06,817 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 02:16:06,909 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:06,909 INFO L412 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:06,914 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:06,914 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:06,939 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:06,939 INFO L448 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:06,948 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:06,948 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:06,980 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:06,980 INFO L448 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 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 [2019-01-14 02:16:06,985 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:06,985 INFO L163 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:07,018 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:16:07,018 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:07,139 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:16:07,141 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:07,141 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:07,141 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:07,142 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:07,142 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:16:07,142 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:07,142 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:07,142 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:07,143 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:16:07,143 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:07,143 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:07,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:07,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:07,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:07,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:07,361 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:07,369 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:16:07,371 INFO L122 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 [2019-01-14 02:16:07,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:07,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:07,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:07,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:07,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:07,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:07,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:07,389 INFO L122 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 [2019-01-14 02:16:07,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:07,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:07,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:07,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:07,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:07,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:07,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:07,405 INFO L122 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 [2019-01-14 02:16:07,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:07,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:07,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:07,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:07,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:07,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:07,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:07,416 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:16:07,424 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:16:07,425 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:16:07,427 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:16:07,427 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:16:07,428 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:16:07,428 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-14 02:16:07,430 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:16:07,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:07,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:07,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:07,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:07,661 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 [2019-01-14 02:16:07,663 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 3 states. [2019-01-14 02:16:07,774 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 3 states. Result 42 states and 62 transitions. Complement of second has 8 states. [2019-01-14 02:16:07,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:07,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:16:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2019-01-14 02:16:07,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 2 letters. Loop has 3 letters. [2019-01-14 02:16:07,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:07,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-14 02:16:07,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:07,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-14 02:16:07,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:07,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 62 transitions. [2019-01-14 02:16:07,789 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:16:07,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 14 states and 21 transitions. [2019-01-14 02:16:07,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:16:07,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:16:07,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 21 transitions. [2019-01-14 02:16:07,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:16:07,799 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2019-01-14 02:16:07,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 21 transitions. [2019-01-14 02:16:07,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-14 02:16:07,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 02:16:07,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2019-01-14 02:16:07,831 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2019-01-14 02:16:07,831 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2019-01-14 02:16:07,831 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:16:07,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 20 transitions. [2019-01-14 02:16:07,832 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:16:07,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:07,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:07,833 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:16:07,833 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:16:07,833 INFO L794 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 98#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 99#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 104#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 96#L28-2 [2019-01-14 02:16:07,834 INFO L796 eck$LassoCheckResult]: Loop: 96#L28-2 assume !!(main_~k~0 < main_~N~0 - 1);main_~k~0 := 1 + main_~k~0; 96#L28-2 [2019-01-14 02:16:07,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:07,835 INFO L82 PathProgramCache]: Analyzing trace with hash 957581, now seen corresponding path program 1 times [2019-01-14 02:16:07,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:07,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:07,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:07,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:07,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:07,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:07,853 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 1 times [2019-01-14 02:16:07,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:07,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:07,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:07,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:07,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:07,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:07,862 INFO L82 PathProgramCache]: Analyzing trace with hash 29685042, now seen corresponding path program 1 times [2019-01-14 02:16:07,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:07,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:07,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:07,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:07,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:07,918 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:07,918 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:07,919 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:07,919 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:07,919 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:16:07,919 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:07,919 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:07,919 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:07,920 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:16:07,920 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:07,920 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:07,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:07,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:07,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:08,054 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:08,054 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:08,064 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:08,065 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:08,086 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:08,086 INFO L448 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 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 [2019-01-14 02:16:08,091 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:08,092 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:08,114 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:08,114 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:08,120 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:08,120 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:08,149 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:16:08,149 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:08,293 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:16:08,296 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:08,296 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:08,296 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:08,296 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:08,296 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:16:08,297 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:08,297 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:08,297 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:08,297 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:16:08,297 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:08,297 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:08,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:08,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:08,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:08,613 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 02:16:08,877 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:08,878 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:16:08,878 INFO L122 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 [2019-01-14 02:16:08,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:08,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:08,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:08,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:08,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:08,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:08,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:08,890 INFO L122 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 [2019-01-14 02:16:08,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:08,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:08,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:08,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:08,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:08,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:08,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:08,905 INFO L122 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 [2019-01-14 02:16:08,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:08,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:08,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:08,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:08,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:08,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:08,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:08,916 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:16:08,928 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:16:08,928 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:16:08,928 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:16:08,929 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:16:08,929 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:16:08,929 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~N~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~N~0 Supporting invariants [] [2019-01-14 02:16:08,932 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:16:09,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:09,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:09,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:09,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:09,082 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 [2019-01-14 02:16:09,083 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 10 Second operand 2 states. [2019-01-14 02:16:09,178 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 10. Second operand 2 states. Result 27 states and 43 transitions. Complement of second has 6 states. [2019-01-14 02:16:09,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:09,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:16:09,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-01-14 02:16:09,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 1 letters. [2019-01-14 02:16:09,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:09,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-14 02:16:09,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:09,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:16:09,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:09,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 43 transitions. [2019-01-14 02:16:09,185 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-14 02:16:09,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 18 states and 27 transitions. [2019-01-14 02:16:09,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-14 02:16:09,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-14 02:16:09,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 27 transitions. [2019-01-14 02:16:09,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:16:09,187 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2019-01-14 02:16:09,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 27 transitions. [2019-01-14 02:16:09,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-14 02:16:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 02:16:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2019-01-14 02:16:09,190 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2019-01-14 02:16:09,190 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2019-01-14 02:16:09,191 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:16:09,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 27 transitions. [2019-01-14 02:16:09,192 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-14 02:16:09,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:09,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:09,194 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:16:09,194 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:16:09,194 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 181#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 182#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 180#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 188#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 175#L28-3 main_~i~0 := main_~k~0; 186#L25-2 [2019-01-14 02:16:09,194 INFO L796 eck$LassoCheckResult]: Loop: 186#L25-2 assume !(main_~j~0 < main_~m~0); 187#L25-3 main_~i~0 := 1 + main_~i~0; 189#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 186#L25-2 [2019-01-14 02:16:09,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:09,195 INFO L82 PathProgramCache]: Analyzing trace with hash 920236275, now seen corresponding path program 1 times [2019-01-14 02:16:09,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:09,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:09,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:09,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:09,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:09,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:09,231 INFO L82 PathProgramCache]: Analyzing trace with hash 50233, now seen corresponding path program 2 times [2019-01-14 02:16:09,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:09,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:09,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:09,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:09,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:09,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:09,243 INFO L82 PathProgramCache]: Analyzing trace with hash -17361401, now seen corresponding path program 1 times [2019-01-14 02:16:09,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:09,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:09,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:09,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:09,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:09,294 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:09,294 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:09,294 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:09,294 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:09,294 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:16:09,295 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:09,295 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:09,295 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:09,295 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:16:09,295 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:09,296 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:09,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:09,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:09,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:09,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:09,436 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:09,437 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:09,441 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:09,441 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:09,464 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:09,465 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:09,472 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:09,472 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:09,476 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:09,476 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~m~0=0} Honda state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:09,500 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:09,500 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:09,521 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:09,521 INFO L448 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:09,529 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:09,529 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:09,557 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:16:09,557 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:10,043 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:16:10,051 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:10,052 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:10,052 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:10,052 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:10,052 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:16:10,052 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:10,052 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:10,053 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:10,054 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:16:10,054 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:10,055 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:10,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:10,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:10,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:10,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:10,236 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:10,236 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:16:10,237 INFO L122 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 [2019-01-14 02:16:10,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:10,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:10,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:10,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:10,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:10,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:10,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:10,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:10,245 INFO L122 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 [2019-01-14 02:16:10,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:10,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:10,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:10,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:10,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:10,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:10,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:10,256 INFO L122 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 [2019-01-14 02:16:10,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:10,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:10,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:10,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:10,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:10,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:10,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:10,267 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:16:10,272 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:16:10,273 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:16:10,273 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:16:10,273 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:16:10,274 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:16:10,274 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-01-14 02:16:10,274 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:16:10,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:10,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:10,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:10,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:10,440 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 [2019-01-14 02:16:10,440 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13 Second operand 4 states. [2019-01-14 02:16:10,495 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 31 states and 51 transitions. Complement of second has 8 states. [2019-01-14 02:16:10,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:10,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:16:10,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2019-01-14 02:16:10,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-14 02:16:10,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:10,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-14 02:16:10,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:10,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 6 letters. Loop has 6 letters. [2019-01-14 02:16:10,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:10,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 51 transitions. [2019-01-14 02:16:10,501 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:16:10,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 22 states and 34 transitions. [2019-01-14 02:16:10,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-14 02:16:10,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-14 02:16:10,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 34 transitions. [2019-01-14 02:16:10,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:16:10,505 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 34 transitions. [2019-01-14 02:16:10,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 34 transitions. [2019-01-14 02:16:10,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-01-14 02:16:10,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 02:16:10,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2019-01-14 02:16:10,508 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2019-01-14 02:16:10,508 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2019-01-14 02:16:10,509 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:16:10,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. [2019-01-14 02:16:10,510 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:16:10,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:10,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:10,510 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2019-01-14 02:16:10,510 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:16:10,511 INFO L794 eck$LassoCheckResult]: Stem: 283#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 277#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 278#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 288#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 287#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 276#L28-3 main_~i~0 := main_~k~0; 286#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 273#L28-2 [2019-01-14 02:16:10,511 INFO L796 eck$LassoCheckResult]: Loop: 273#L28-2 assume !!(main_~k~0 < main_~N~0 - 1);main_~k~0 := 1 + main_~k~0; 273#L28-2 [2019-01-14 02:16:10,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:10,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1537446525, now seen corresponding path program 2 times [2019-01-14 02:16:10,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:10,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:10,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:10,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:10,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:10,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:10,537 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 2 times [2019-01-14 02:16:10,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:10,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:10,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:10,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:10,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:10,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:10,551 INFO L82 PathProgramCache]: Analyzing trace with hash -416201988, now seen corresponding path program 1 times [2019-01-14 02:16:10,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:10,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:10,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:10,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:10,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:10,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:10,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:16:10,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:16:10,683 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:10,684 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:10,684 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:10,684 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:10,684 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:16:10,684 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:10,684 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:10,684 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:10,685 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-14 02:16:10,685 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:10,685 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:10,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:10,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:10,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:10,794 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:10,794 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:10,798 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:10,798 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:10,829 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:16:10,829 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:10,972 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:16:10,975 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:10,975 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:10,975 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:10,975 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:10,975 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:16:10,975 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:10,975 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:10,976 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:10,976 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-14 02:16:10,976 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:10,976 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:10,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:10,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:10,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:11,104 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:11,104 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:16:11,105 INFO L122 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 [2019-01-14 02:16:11,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:11,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:11,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:11,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:11,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:11,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:11,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:11,115 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:16:11,118 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:16:11,118 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:16:11,118 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:16:11,118 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:16:11,119 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:16:11,119 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~N~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~N~0 Supporting invariants [] [2019-01-14 02:16:11,119 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:16:11,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:11,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:11,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:11,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:11,215 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 [2019-01-14 02:16:11,215 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16 Second operand 2 states. [2019-01-14 02:16:11,236 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16. Second operand 2 states. Result 25 states and 38 transitions. Complement of second has 5 states. [2019-01-14 02:16:11,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:11,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:16:11,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-01-14 02:16:11,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 1 letters. [2019-01-14 02:16:11,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:11,241 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:16:11,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:11,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:11,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:11,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:11,280 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 [2019-01-14 02:16:11,281 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16 Second operand 2 states. [2019-01-14 02:16:11,297 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16. Second operand 2 states. Result 25 states and 38 transitions. Complement of second has 5 states. [2019-01-14 02:16:11,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:11,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:16:11,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-01-14 02:16:11,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 1 letters. [2019-01-14 02:16:11,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:11,301 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:16:11,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:11,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:11,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:11,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:11,337 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 [2019-01-14 02:16:11,337 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16 Second operand 2 states. [2019-01-14 02:16:11,367 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16. Second operand 2 states. Result 36 states and 60 transitions. Complement of second has 5 states. [2019-01-14 02:16:11,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:11,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:16:11,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2019-01-14 02:16:11,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 7 letters. Loop has 1 letters. [2019-01-14 02:16:11,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:11,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 8 letters. Loop has 1 letters. [2019-01-14 02:16:11,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:11,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 02:16:11,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:11,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 60 transitions. [2019-01-14 02:16:11,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:16:11,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 22 states and 33 transitions. [2019-01-14 02:16:11,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 02:16:11,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 02:16:11,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 33 transitions. [2019-01-14 02:16:11,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:16:11,375 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. [2019-01-14 02:16:11,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 33 transitions. [2019-01-14 02:16:11,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-01-14 02:16:11,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 02:16:11,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-01-14 02:16:11,380 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-01-14 02:16:11,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:16:11,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:16:11,385 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. Second operand 4 states. [2019-01-14 02:16:11,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:16:11,488 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2019-01-14 02:16:11,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:16:11,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-01-14 02:16:11,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:16:11,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2019-01-14 02:16:11,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-14 02:16:11,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-14 02:16:11,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2019-01-14 02:16:11,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:16:11,492 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-14 02:16:11,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2019-01-14 02:16:11,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-14 02:16:11,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 02:16:11,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-01-14 02:16:11,495 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-14 02:16:11,495 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-14 02:16:11,496 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:16:11,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2019-01-14 02:16:11,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:16:11,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:11,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:11,497 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2019-01-14 02:16:11,497 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:16:11,497 INFO L794 eck$LassoCheckResult]: Stem: 535#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 533#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 534#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 540#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 539#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 528#L28-3 main_~i~0 := main_~k~0; 538#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 525#L28-2 [2019-01-14 02:16:11,498 INFO L796 eck$LassoCheckResult]: Loop: 525#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 526#L28-3 main_~i~0 := main_~k~0; 530#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 525#L28-2 [2019-01-14 02:16:11,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:11,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1537446525, now seen corresponding path program 3 times [2019-01-14 02:16:11,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:11,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:11,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:11,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:11,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:11,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:11,515 INFO L82 PathProgramCache]: Analyzing trace with hash 58767, now seen corresponding path program 1 times [2019-01-14 02:16:11,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:11,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:11,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:11,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:11,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:11,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:11,526 INFO L82 PathProgramCache]: Analyzing trace with hash -538152755, now seen corresponding path program 4 times [2019-01-14 02:16:11,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:11,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:11,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:11,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:11,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:11,617 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:11,617 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:11,617 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:11,617 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:11,617 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:16:11,618 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:11,618 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:11,618 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:11,618 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-14 02:16:11,618 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:11,618 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:11,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:11,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:11,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:11,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:11,719 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:11,720 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:11,750 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:11,750 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:11,762 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:11,763 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0=1, ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~N~0=-7} Honda state: {ULTIMATE.start_main_~k~0=1, ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~N~0=-7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:11,785 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:11,785 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:11,808 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:11,808 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:11,813 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:11,814 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:11,836 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:11,836 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 [2019-01-14 02:16:11,844 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:11,844 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2019-01-14 02:16:11,875 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:16:11,875 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:12,007 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:16:12,010 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:12,010 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:12,010 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:12,010 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:12,010 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:16:12,010 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:12,011 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:12,011 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:12,011 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-14 02:16:12,011 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:12,011 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:12,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:12,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:12,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:12,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:12,130 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:12,131 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:16:12,131 INFO L122 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 [2019-01-14 02:16:12,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:12,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:12,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:12,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:12,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:12,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:12,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:12,141 INFO L122 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 [2019-01-14 02:16:12,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:12,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:12,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:12,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:12,144 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:12,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:12,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:12,148 INFO L122 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 [2019-01-14 02:16:12,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:12,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:12,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:12,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:12,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:12,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:12,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:12,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:12,156 INFO L122 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 [2019-01-14 02:16:12,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:12,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:12,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:12,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:12,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:12,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:12,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:12,164 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:16:12,168 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:16:12,168 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:16:12,169 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:16:12,169 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:16:12,169 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:16:12,169 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~m~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-01-14 02:16:12,169 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:16:12,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:12,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:12,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:12,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:12,242 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 [2019-01-14 02:16:12,242 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-01-14 02:16:12,269 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 37 states and 48 transitions. Complement of second has 5 states. [2019-01-14 02:16:12,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:16:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-01-14 02:16:12,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-14 02:16:12,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:12,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-14 02:16:12,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:12,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-14 02:16:12,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:12,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 48 transitions. [2019-01-14 02:16:12,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:16:12,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 33 states and 44 transitions. [2019-01-14 02:16:12,275 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-14 02:16:12,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 02:16:12,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2019-01-14 02:16:12,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:16:12,276 INFO L706 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-01-14 02:16:12,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2019-01-14 02:16:12,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2019-01-14 02:16:12,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 02:16:12,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2019-01-14 02:16:12,279 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 35 transitions. [2019-01-14 02:16:12,279 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 35 transitions. [2019-01-14 02:16:12,279 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:16:12,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 35 transitions. [2019-01-14 02:16:12,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:16:12,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:12,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:12,282 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2019-01-14 02:16:12,282 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:16:12,282 INFO L794 eck$LassoCheckResult]: Stem: 640#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 635#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 636#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 637#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 651#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 647#L28-3 main_~i~0 := main_~k~0; 648#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 649#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 650#L28-3 main_~i~0 := main_~k~0; 655#L25-2 assume !(main_~j~0 < main_~m~0); 641#L25-3 [2019-01-14 02:16:12,282 INFO L796 eck$LassoCheckResult]: Loop: 641#L25-3 main_~i~0 := 1 + main_~i~0; 642#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 653#L25-2 assume !(main_~j~0 < main_~m~0); 641#L25-3 [2019-01-14 02:16:12,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:12,283 INFO L82 PathProgramCache]: Analyzing trace with hash -538152757, now seen corresponding path program 1 times [2019-01-14 02:16:12,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:12,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:12,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:12,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:12,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:12,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:12,298 INFO L82 PathProgramCache]: Analyzing trace with hash 67693, now seen corresponding path program 3 times [2019-01-14 02:16:12,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:12,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:12,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:12,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:12,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:12,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:12,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1004170083, now seen corresponding path program 2 times [2019-01-14 02:16:12,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:12,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:12,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:12,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:12,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:12,545 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 02:16:12,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:16:12,545 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:16:12,556 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:16:12,587 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 02:16:12,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:16:12,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:12,653 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 02:16:12,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:16:12,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 02:16:12,716 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:12,716 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:12,716 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:12,716 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:12,716 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:16:12,717 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:12,717 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:12,717 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:12,717 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration6_Loop [2019-01-14 02:16:12,717 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:12,717 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:12,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:12,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:12,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:12,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:12,811 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:12,812 INFO L412 LassoAnalysis]: Checking for nontermination... 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 [2019-01-14 02:16:12,817 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:12,817 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:12,839 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:12,839 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=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 [2019-01-14 02:16:12,846 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:12,847 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:12,869 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:12,870 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 [2019-01-14 02:16:12,875 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:12,875 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2019-01-14 02:16:12,902 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:16:12,902 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:13,244 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:16:13,247 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:13,247 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:13,247 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:13,247 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:13,247 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:16:13,247 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:13,248 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:13,248 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:13,248 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration6_Loop [2019-01-14 02:16:13,248 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:13,248 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:13,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:13,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:13,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:13,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:13,329 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:13,330 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:16:13,331 INFO L122 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 [2019-01-14 02:16:13,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:13,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:13,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:13,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:13,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:13,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:13,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:13,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:13,340 INFO L122 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 [2019-01-14 02:16:13,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:13,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:13,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:13,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:13,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:13,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:13,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:13,349 INFO L122 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 [2019-01-14 02:16:13,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:13,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:13,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:13,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:13,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:13,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:13,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:13,358 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:16:13,361 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:16:13,362 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:16:13,363 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:16:13,363 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:16:13,364 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:16:13,364 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-14 02:16:13,365 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:16:13,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:13,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:13,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:13,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:13,485 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:16:13,485 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 35 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-01-14 02:16:13,513 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 35 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 65 states and 90 transitions. Complement of second has 7 states. [2019-01-14 02:16:13,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:16:13,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-14 02:16:13,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-14 02:16:13,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:13,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 13 letters. Loop has 3 letters. [2019-01-14 02:16:13,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:13,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-14 02:16:13,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:13,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 90 transitions. [2019-01-14 02:16:13,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:16:13,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 50 states and 68 transitions. [2019-01-14 02:16:13,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-01-14 02:16:13,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-14 02:16:13,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 68 transitions. [2019-01-14 02:16:13,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:16:13,534 INFO L706 BuchiCegarLoop]: Abstraction has 50 states and 68 transitions. [2019-01-14 02:16:13,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 68 transitions. [2019-01-14 02:16:13,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 34. [2019-01-14 02:16:13,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-14 02:16:13,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2019-01-14 02:16:13,544 INFO L729 BuchiCegarLoop]: Abstraction has 34 states and 49 transitions. [2019-01-14 02:16:13,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 02:16:13,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 02:16:13,545 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 6 states. [2019-01-14 02:16:13,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:16:13,623 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2019-01-14 02:16:13,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:16:13,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 49 transitions. [2019-01-14 02:16:13,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:16:13,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 49 transitions. [2019-01-14 02:16:13,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-14 02:16:13,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-01-14 02:16:13,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 49 transitions. [2019-01-14 02:16:13,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:16:13,627 INFO L706 BuchiCegarLoop]: Abstraction has 35 states and 49 transitions. [2019-01-14 02:16:13,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 49 transitions. [2019-01-14 02:16:13,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2019-01-14 02:16:13,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 02:16:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2019-01-14 02:16:13,633 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2019-01-14 02:16:13,633 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2019-01-14 02:16:13,633 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:16:13,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2019-01-14 02:16:13,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:16:13,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:13,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:13,637 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:16:13,637 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:16:13,637 INFO L794 eck$LassoCheckResult]: Stem: 909#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 907#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 908#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 916#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 917#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 901#L28-3 main_~i~0 := main_~k~0; 912#L25-2 assume !(main_~j~0 < main_~m~0); 910#L25-3 [2019-01-14 02:16:13,637 INFO L796 eck$LassoCheckResult]: Loop: 910#L25-3 main_~i~0 := 1 + main_~i~0; 902#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 903#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 898#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 899#L28-3 main_~i~0 := main_~k~0; 920#L25-2 assume !(main_~j~0 < main_~m~0); 910#L25-3 [2019-01-14 02:16:13,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:13,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1537446527, now seen corresponding path program 2 times [2019-01-14 02:16:13,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:13,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:13,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:13,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:13,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:13,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:13,650 INFO L82 PathProgramCache]: Analyzing trace with hash 2016730719, now seen corresponding path program 1 times [2019-01-14 02:16:13,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:13,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:13,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:13,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:13,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:13,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:13,662 INFO L82 PathProgramCache]: Analyzing trace with hash -504812577, now seen corresponding path program 3 times [2019-01-14 02:16:13,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:13,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:13,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:13,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:13,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:13,735 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:13,735 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:13,735 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:13,736 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:13,736 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:16:13,736 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:13,736 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:13,736 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:13,737 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration7_Loop [2019-01-14 02:16:13,737 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:13,737 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:13,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:13,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:13,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:13,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:13,835 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:13,835 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:13,841 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:13,841 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:13,845 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:13,845 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~m~0=1} Honda state: {ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~m~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:13,871 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:13,871 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2019-01-14 02:16:13,900 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:16:13,900 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:25,930 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-14 02:16:25,933 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:25,933 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:25,933 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:25,933 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:25,934 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:16:25,934 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:25,934 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:25,934 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:25,934 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration7_Loop [2019-01-14 02:16:25,934 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:25,934 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:25,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:25,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:25,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:25,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:26,056 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:26,056 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:16:26,056 INFO L122 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 [2019-01-14 02:16:26,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:26,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:26,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:26,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:26,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:26,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:26,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:26,062 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:16:26,065 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:16:26,065 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:16:26,066 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:16:26,066 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:16:26,066 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:16:26,066 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-14 02:16:26,066 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:16:26,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:26,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:26,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:26,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:26,174 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-14 02:16:26,174 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17 Second operand 6 states. [2019-01-14 02:16:26,212 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17. Second operand 6 states. Result 49 states and 69 transitions. Complement of second has 7 states. [2019-01-14 02:16:26,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:26,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:16:26,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-14 02:16:26,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-14 02:16:26,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:26,214 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:16:26,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:26,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:26,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:26,331 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-14 02:16:26,332 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17 Second operand 6 states. [2019-01-14 02:16:26,446 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17. Second operand 6 states. Result 56 states and 79 transitions. Complement of second has 10 states. [2019-01-14 02:16:26,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:26,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:16:26,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2019-01-14 02:16:26,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-14 02:16:26,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:26,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 13 letters. Loop has 6 letters. [2019-01-14 02:16:26,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:26,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 7 letters. Loop has 12 letters. [2019-01-14 02:16:26,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:26,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 79 transitions. [2019-01-14 02:16:26,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:16:26,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 43 states and 60 transitions. [2019-01-14 02:16:26,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-14 02:16:26,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-14 02:16:26,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 60 transitions. [2019-01-14 02:16:26,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:16:26,457 INFO L706 BuchiCegarLoop]: Abstraction has 43 states and 60 transitions. [2019-01-14 02:16:26,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 60 transitions. [2019-01-14 02:16:26,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2019-01-14 02:16:26,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-14 02:16:26,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2019-01-14 02:16:26,463 INFO L729 BuchiCegarLoop]: Abstraction has 35 states and 52 transitions. [2019-01-14 02:16:26,464 INFO L609 BuchiCegarLoop]: Abstraction has 35 states and 52 transitions. [2019-01-14 02:16:26,465 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:16:26,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 52 transitions. [2019-01-14 02:16:26,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:16:26,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:26,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:26,468 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:16:26,468 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:16:26,468 INFO L794 eck$LassoCheckResult]: Stem: 1160#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 1158#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 1159#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 1174#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 1171#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 1168#L28-3 main_~i~0 := main_~k~0; 1167#L25-2 assume !(main_~j~0 < main_~m~0); 1161#L25-3 main_~i~0 := 1 + main_~i~0; 1154#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 1155#L25-2 [2019-01-14 02:16:26,468 INFO L796 eck$LassoCheckResult]: Loop: 1155#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 1150#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 1151#L28-3 main_~i~0 := main_~k~0; 1155#L25-2 [2019-01-14 02:16:26,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:26,470 INFO L82 PathProgramCache]: Analyzing trace with hash -17361401, now seen corresponding path program 4 times [2019-01-14 02:16:26,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:26,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:26,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:26,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:26,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:26,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:26,495 INFO L82 PathProgramCache]: Analyzing trace with hash 51867, now seen corresponding path program 2 times [2019-01-14 02:16:26,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:26,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:26,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:26,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:26,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:26,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:26,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1817399595, now seen corresponding path program 5 times [2019-01-14 02:16:26,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:26,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:26,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:26,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:26,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:26,605 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:26,605 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:26,605 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:26,605 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:26,605 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:16:26,606 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:26,606 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:26,606 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:26,606 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration8_Loop [2019-01-14 02:16:26,606 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:26,607 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:26,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:26,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:26,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:26,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:26,693 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:26,694 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:26,700 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:26,700 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:26,721 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:26,721 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:26,727 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:26,728 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:26,751 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:26,752 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_15=0} Honda state: {v_rep~unnamed0~0~false_15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:26,757 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:26,757 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:26,763 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:26,763 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0=-7, ULTIMATE.start_main_~i~0=-7, ULTIMATE.start_main_~N~0=-6} Honda state: {ULTIMATE.start_main_~k~0=-7, ULTIMATE.start_main_~i~0=-7, ULTIMATE.start_main_~N~0=-6} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:26,786 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:26,787 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:26,812 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:16:26,813 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:26,948 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:16:26,950 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:26,950 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:26,950 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:26,950 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:26,951 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:16:26,951 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:26,951 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:26,951 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:26,951 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration8_Loop [2019-01-14 02:16:26,951 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:26,951 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:26,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:26,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:27,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:27,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:27,433 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:27,434 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:16:27,434 INFO L122 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 [2019-01-14 02:16:27,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:27,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:27,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:27,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:27,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:27,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:27,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:27,443 INFO L122 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 [2019-01-14 02:16:27,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:27,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:27,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:27,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:27,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:27,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:27,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:27,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:27,454 INFO L122 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 [2019-01-14 02:16:27,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:27,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:27,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:27,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:27,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:27,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:27,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:27,460 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:16:27,462 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:16:27,462 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:16:27,462 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:16:27,462 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:16:27,462 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:16:27,463 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~m~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-01-14 02:16:27,465 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:16:27,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:27,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:27,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:27,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:27,571 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 [2019-01-14 02:16:27,571 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26 Second operand 3 states. [2019-01-14 02:16:27,578 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26. Second operand 3 states. Result 55 states and 81 transitions. Complement of second has 5 states. [2019-01-14 02:16:27,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:16:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2019-01-14 02:16:27,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-14 02:16:27,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:27,580 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:16:27,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:27,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:27,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:27,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:27,649 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:16:27,649 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26 Second operand 3 states. [2019-01-14 02:16:27,665 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26. Second operand 3 states. Result 51 states and 75 transitions. Complement of second has 7 states. [2019-01-14 02:16:27,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:27,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:16:27,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-01-14 02:16:27,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-14 02:16:27,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:27,667 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:16:27,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:27,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:27,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:27,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:27,703 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 2 loop predicates [2019-01-14 02:16:27,704 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26 Second operand 3 states. [2019-01-14 02:16:27,713 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26. Second operand 3 states. Result 69 states and 104 transitions. Complement of second has 4 states. [2019-01-14 02:16:27,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:27,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:16:27,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2019-01-14 02:16:27,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-14 02:16:27,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:27,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 12 letters. Loop has 3 letters. [2019-01-14 02:16:27,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:27,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-14 02:16:27,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:27,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 104 transitions. [2019-01-14 02:16:27,717 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:16:27,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2019-01-14 02:16:27,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:16:27,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:16:27,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:16:27,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:16:27,718 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:16:27,718 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:16:27,718 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:16:27,718 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 02:16:27,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:16:27,718 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:16:27,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:16:27,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:16:27 BoogieIcfgContainer [2019-01-14 02:16:27,725 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:16:27,726 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:16:27,726 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:16:27,726 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:16:27,727 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:16:05" (3/4) ... [2019-01-14 02:16:27,730 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:16:27,730 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:16:27,731 INFO L168 Benchmark]: Toolchain (without parser) took 22447.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.9 MB). Free memory was 951.4 MB in the beginning and 880.9 MB in the end (delta: 70.5 MB). Peak memory consumption was 284.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:16:27,732 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:16:27,733 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.98 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:16:27,733 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.99 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:16:27,734 INFO L168 Benchmark]: Boogie Preprocessor took 19.54 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:16:27,734 INFO L168 Benchmark]: RCFGBuilder took 330.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:16:27,735 INFO L168 Benchmark]: BuchiAutomizer took 21749.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 880.9 MB in the end (delta: 237.1 MB). Peak memory consumption was 308.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:16:27,736 INFO L168 Benchmark]: Witness Printer took 4.49 ms. Allocated memory is still 1.2 GB. Free memory is still 880.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:16:27,740 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 299.98 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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 37.99 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.54 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 330.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21749.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 880.9 MB in the end (delta: 237.1 MB). Peak memory consumption was 308.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.49 ms. Allocated memory is still 1.2 GB. Free memory is still 880.9 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 10 terminating modules (2 trivial, 6 deterministic, 2 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i + n and consists of 5 locations. One deterministic module has affine ranking function m + -1 * j and consists of 3 locations. One deterministic module has affine ranking function n + -1 * i and consists of 4 locations. One deterministic module has affine ranking function n + -1 * i and consists of 6 locations. One nondeterministic module has affine ranking function -1 * k + N and consists of 4 locations. One nondeterministic module has affine ranking function m + -1 * j and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 21.7s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 19.4s. Construction of modules took 0.4s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 49 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 7. Nontrivial modules had stage [5, 1, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/1 HoareTripleCheckerStatistics: 163 SDtfs, 160 SDslu, 63 SDs, 0 SdLazy, 133 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT6 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax169 hnf97 lsp41 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq156 hnf93 smp100 dnf100 smp100 tf111 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 16 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 14.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...