./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrncmp-alloca_true-termination.c.i --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-memory-alloca/openbsd_cstrncmp-alloca_true-termination.c.i -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 28df36858bcf0d10e60c800fcc2b4034b3218824 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:35:43,937 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:35:43,938 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:35:43,957 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:35:43,958 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:35:43,959 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:35:43,960 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:35:43,962 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:35:43,964 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:35:43,965 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:35:43,966 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:35:43,966 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:35:43,967 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:35:43,968 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:35:43,970 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:35:43,970 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:35:43,971 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:35:43,973 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:35:43,975 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:35:43,977 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:35:43,978 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:35:43,979 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:35:43,982 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:35:43,983 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:35:43,983 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:35:43,984 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:35:43,985 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:35:43,986 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:35:43,987 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:35:43,989 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:35:43,989 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:35:43,990 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:35:43,990 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:35:43,990 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:35:43,991 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:35:43,992 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:35:43,992 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:35:44,009 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:35:44,009 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:35:44,010 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:35:44,011 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:35:44,011 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:35:44,011 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:35:44,011 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:35:44,011 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:35:44,012 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:35:44,012 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:35:44,012 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:35:44,012 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:35:44,012 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:35:44,012 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:35:44,013 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:35:44,013 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:35:44,013 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:35:44,013 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:35:44,013 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:35:44,013 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:35:44,014 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:35:44,014 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:35:44,014 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:35:44,014 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:35:44,014 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:35:44,015 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:35:44,015 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:35:44,015 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:35:44,016 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:35:44,016 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 -> 28df36858bcf0d10e60c800fcc2b4034b3218824 [2019-01-14 02:35:44,057 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:35:44,072 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:35:44,079 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:35:44,080 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:35:44,081 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:35:44,081 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrncmp-alloca_true-termination.c.i [2019-01-14 02:35:44,141 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e1791774/eef5a23c2ca746198995cd40591853dc/FLAG49fec8f13 [2019-01-14 02:35:44,675 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:35:44,676 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrncmp-alloca_true-termination.c.i [2019-01-14 02:35:44,689 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e1791774/eef5a23c2ca746198995cd40591853dc/FLAG49fec8f13 [2019-01-14 02:35:44,956 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e1791774/eef5a23c2ca746198995cd40591853dc [2019-01-14 02:35:44,959 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:35:44,960 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:35:44,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:35:44,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:35:44,965 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:35:44,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:35:44" (1/1) ... [2019-01-14 02:35:44,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d2907c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:44, skipping insertion in model container [2019-01-14 02:35:44,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:35:44" (1/1) ... [2019-01-14 02:35:44,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:35:45,032 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:35:45,427 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:35:45,438 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:35:45,556 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:35:45,627 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:35:45,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:45 WrapperNode [2019-01-14 02:35:45,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:35:45,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:35:45,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:35:45,629 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:35:45,638 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:35:45" (1/1) ... [2019-01-14 02:35:45,653 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:35:45" (1/1) ... [2019-01-14 02:35:45,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:35:45,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:35:45,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:35:45,679 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:35:45,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:45" (1/1) ... [2019-01-14 02:35:45,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:45" (1/1) ... [2019-01-14 02:35:45,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:45" (1/1) ... [2019-01-14 02:35:45,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:45" (1/1) ... [2019-01-14 02:35:45,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:45" (1/1) ... [2019-01-14 02:35:45,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:45" (1/1) ... [2019-01-14 02:35:45,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:45" (1/1) ... [2019-01-14 02:35:45,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:35:45,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:35:45,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:35:45,713 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:35:45,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:45" (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:35:45,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:35:45,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:35:45,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:35:45,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:35:45,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:35:45,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:35:46,205 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:35:46,205 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 02:35:46,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:35:46 BoogieIcfgContainer [2019-01-14 02:35:46,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:35:46,207 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:35:46,208 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:35:46,211 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:35:46,212 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:35:46,213 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:35:44" (1/3) ... [2019-01-14 02:35:46,214 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@531c354c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:35:46, skipping insertion in model container [2019-01-14 02:35:46,214 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:35:46,214 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:45" (2/3) ... [2019-01-14 02:35:46,215 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@531c354c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:35:46, skipping insertion in model container [2019-01-14 02:35:46,215 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:35:46,215 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:35:46" (3/3) ... [2019-01-14 02:35:46,217 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrncmp-alloca_true-termination.c.i [2019-01-14 02:35:46,274 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:35:46,274 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:35:46,274 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:35:46,275 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:35:46,275 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:35:46,275 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:35:46,275 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:35:46,275 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:35:46,275 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:35:46,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-01-14 02:35:46,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:35:46,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:35:46,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:35:46,322 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:35:46,322 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:35:46,322 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:35:46,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-01-14 02:35:46,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:35:46,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:35:46,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:35:46,325 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:35:46,325 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:35:46,334 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet15, main_#t~ret16, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 11#L563true assume !(main_~length1~0 < 1); 15#L563-2true assume !(main_~length2~0 < 1); 7#L566-1true call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet15;havoc cstrncmp_#res;havoc cstrncmp_#t~mem4, cstrncmp_#t~post3.base, cstrncmp_#t~post3.offset, cstrncmp_#t~mem5, cstrncmp_#t~mem7, cstrncmp_#t~pre6.base, cstrncmp_#t~pre6.offset, cstrncmp_#t~mem8, cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset, cstrncmp_#t~mem10, cstrncmp_#t~pre2, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 16#L550true assume !(0 == cstrncmp_~n % 4294967296); 3#L552-4true [2019-01-14 02:35:46,334 INFO L796 eck$LassoCheckResult]: Loop: 3#L552-4true call cstrncmp_#t~mem4 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post3.base, cstrncmp_#t~post3.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post3.base, 1 + cstrncmp_#t~post3.offset;call cstrncmp_#t~mem5 := read~int(cstrncmp_#t~post3.base, cstrncmp_#t~post3.offset, 1); 9#L553true assume !(cstrncmp_#t~mem4 != cstrncmp_#t~mem5);havoc cstrncmp_#t~mem4;havoc cstrncmp_#t~mem5;havoc cstrncmp_#t~post3.base, cstrncmp_#t~post3.offset;cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post9.base, 1 + cstrncmp_#t~post9.offset;call cstrncmp_#t~mem10 := read~int(cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset, 1); 6#L555true assume !(0 == cstrncmp_#t~mem10);havoc cstrncmp_#t~mem10;havoc cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset; 13#L552-1true cstrncmp_#t~pre2 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 17#L552-2true assume !!(0 != cstrncmp_#t~pre2 % 4294967296);havoc cstrncmp_#t~pre2; 3#L552-4true [2019-01-14 02:35:46,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:46,341 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 1 times [2019-01-14 02:35:46,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:35:46,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:35:46,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:46,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:35:46,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:46,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:46,517 INFO L82 PathProgramCache]: Analyzing trace with hash 51691425, now seen corresponding path program 1 times [2019-01-14 02:35:46,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:35:46,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:35:46,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:46,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:35:46,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:46,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:46,577 INFO L82 PathProgramCache]: Analyzing trace with hash -2121194444, now seen corresponding path program 1 times [2019-01-14 02:35:46,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:35:46,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:35:46,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:46,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:35:46,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:47,514 WARN L181 SmtUtils]: Spent 799.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-01-14 02:35:47,639 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-14 02:35:48,428 WARN L181 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-01-14 02:35:48,606 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-01-14 02:35:48,619 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:35:48,620 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:35:48,621 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:35:48,621 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:35:48,621 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:35:48,621 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:35:48,621 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:35:48,622 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:35:48,622 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrncmp-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:35:48,623 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:35:48,623 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:35:48,660 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:35:48,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:35:48,708 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:35:48,712 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:35:48,716 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:35:48,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:35:48,735 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:35:48,741 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:35:48,745 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:35:48,748 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:35:48,757 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:35:48,760 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:35:48,776 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:35:48,779 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:35:48,782 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:35:48,785 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:35:48,788 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:35:48,793 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:35:48,808 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:35:48,812 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:35:48,815 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:35:48,819 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:35:49,304 WARN L181 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-01-14 02:35:49,499 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-14 02:35:49,500 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:35:49,503 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:35:50,677 WARN L181 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-01-14 02:35:50,864 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:35:50,870 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:35:50,873 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:35:50,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:50,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:50,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:50,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:50,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:50,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:50,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:50,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:50,882 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:35:50,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:50,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:50,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:50,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:50,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:50,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:50,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:50,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:50,886 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:35:50,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:50,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:50,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:50,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:50,891 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:50,891 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:50,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:50,896 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:35:50,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:50,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:50,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:50,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:50,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:50,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:50,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:50,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:50,901 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:35:50,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:50,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:50,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:50,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:50,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:50,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:50,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:50,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:50,907 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:35:50,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:50,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:50,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:50,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:50,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:50,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:50,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:50,917 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:35:50,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:50,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:50,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:50,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:50,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:50,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:50,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:50,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:50,922 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:35:50,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:50,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:50,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:50,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:50,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:50,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:50,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:50,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:50,927 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:35:50,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:50,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:50,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:50,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:50,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:50,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:50,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:50,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:50,933 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:35:50,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:50,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:50,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:50,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:50,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:50,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:50,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:50,942 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:35:50,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:50,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:50,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:50,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:50,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:50,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:50,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:50,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:50,948 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:35:50,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:50,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:50,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:50,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:50,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:50,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:50,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:50,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:50,954 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:35:50,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:50,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:50,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:50,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:50,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:50,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:50,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:50,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:50,960 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:35:50,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:50,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:50,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:50,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:50,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:50,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:50,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:50,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:50,966 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:35:50,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:50,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:50,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:50,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:50,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:50,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:50,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:50,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:50,972 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:35:50,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:50,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:50,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:50,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:50,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:50,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:50,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:50,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:50,978 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:35:50,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:50,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:50,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:50,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:50,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:50,982 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:50,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:50,986 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:35:50,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:50,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:50,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:50,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:50,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:50,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:50,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:50,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:50,992 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:35:50,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:50,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:50,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:50,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:50,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:50,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:50,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:50,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:50,999 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:35:50,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:51,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:51,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:51,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:51,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:51,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:51,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:51,009 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:35:51,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:51,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:51,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:51,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:51,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:51,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:51,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:51,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:51,015 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:35:51,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:51,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:51,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:51,018 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:35:51,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:51,020 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:35:51,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:51,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:51,026 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:35:51,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:51,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:51,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:51,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:51,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:51,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:51,114 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:35:51,190 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:35:51,191 INFO L444 ModelExtractionUtils]: 35 out of 40 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:35:51,196 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:35:51,200 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:35:51,200 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:35:51,201 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~s2.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_1) = -1*ULTIMATE.start_cstrncmp_~s2.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_1 Supporting invariants [] [2019-01-14 02:35:51,501 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2019-01-14 02:35:51,511 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:35:51,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:35:51,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:35:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:35:51,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:35:51,731 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:35:51,746 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 02:35:51,748 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 4 states. [2019-01-14 02:35:51,863 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 4 states. Result 33 states and 39 transitions. Complement of second has 7 states. [2019-01-14 02:35:51,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:35:51,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:35:51,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-01-14 02:35:51,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 6 letters. Loop has 5 letters. [2019-01-14 02:35:51,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:35:51,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 5 letters. [2019-01-14 02:35:51,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:35:51,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 6 letters. Loop has 10 letters. [2019-01-14 02:35:51,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:35:51,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2019-01-14 02:35:51,876 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:35:51,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. [2019-01-14 02:35:51,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:35:51,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:35:51,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:35:51,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:35:51,881 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:35:51,881 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:35:51,881 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:35:51,881 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:35:51,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:35:51,881 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:35:51,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:35:51,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:35:51 BoogieIcfgContainer [2019-01-14 02:35:51,887 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:35:51,888 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:35:51,888 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:35:51,888 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:35:51,889 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:35:46" (3/4) ... [2019-01-14 02:35:51,892 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:35:51,892 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:35:51,893 INFO L168 Benchmark]: Toolchain (without parser) took 6933.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.2 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -86.3 MB). Peak memory consumption was 122.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:35:51,894 INFO L168 Benchmark]: CDTParser took 0.19 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:35:51,894 INFO L168 Benchmark]: CACSL2BoogieTranslator took 666.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 952.7 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:35:51,896 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:35:51,896 INFO L168 Benchmark]: Boogie Preprocessor took 33.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:35:51,897 INFO L168 Benchmark]: RCFGBuilder took 493.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:35:51,899 INFO L168 Benchmark]: BuchiAutomizer took 5679.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.3 MB). Peak memory consumption was 124.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:35:51,900 INFO L168 Benchmark]: Witness Printer took 4.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:35:51,906 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.19 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 666.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 952.7 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 493.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5679.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.3 MB). Peak memory consumption was 124.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s2 + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 5.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 17 SDtfs, 17 SDslu, 13 SDs, 0 SdLazy, 12 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital239 mio100 ax107 hnf99 lsp80 ukn85 mio100 lsp42 div140 bol100 ite100 ukn100 eq154 hnf78 smp100 dnf187 smp97 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...