./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strdup_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_87fcfa5a-ec52-4753-ae59-6d30cb2c0b94/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_87fcfa5a-ec52-4753-ae59-6d30cb2c0b94/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_87fcfa5a-ec52-4753-ae59-6d30cb2c0b94/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_87fcfa5a-ec52-4753-ae59-6d30cb2c0b94/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strdup_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_87fcfa5a-ec52-4753-ae59-6d30cb2c0b94/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_87fcfa5a-ec52-4753-ae59-6d30cb2c0b94/bin-2019/uautomizer --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 eb36eb172eada83da57fd9fdc6a0c3dfe0bc61fe ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:09:17,850 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:09:17,851 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:09:17,857 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:09:17,857 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:09:17,858 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:09:17,859 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:09:17,860 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:09:17,861 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:09:17,862 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:09:17,863 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:09:17,863 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:09:17,863 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:09:17,864 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:09:17,865 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:09:17,865 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:09:17,866 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:09:17,866 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:09:17,868 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:09:17,868 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:09:17,869 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:09:17,870 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:09:17,872 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:09:17,872 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:09:17,872 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:09:17,873 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:09:17,873 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:09:17,874 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:09:17,874 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:09:17,875 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:09:17,875 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:09:17,876 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:09:17,876 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:09:17,876 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:09:17,877 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:09:17,877 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:09:17,877 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_87fcfa5a-ec52-4753-ae59-6d30cb2c0b94/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 05:09:17,886 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:09:17,886 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:09:17,887 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:09:17,887 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:09:17,887 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:09:17,887 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 05:09:17,887 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 05:09:17,888 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 05:09:17,888 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 05:09:17,888 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 05:09:17,888 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 05:09:17,888 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:09:17,888 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:09:17,888 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:09:17,889 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:09:17,889 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 05:09:17,889 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 05:09:17,889 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 05:09:17,889 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:09:17,889 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 05:09:17,889 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 05:09:17,890 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:09:17,890 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:09:17,890 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 05:09:17,890 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:09:17,890 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:09:17,890 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 05:09:17,891 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 05:09:17,891 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_87fcfa5a-ec52-4753-ae59-6d30cb2c0b94/bin-2019/uautomizer 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 -> eb36eb172eada83da57fd9fdc6a0c3dfe0bc61fe [2018-11-10 05:09:17,914 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:09:17,924 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:09:17,926 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:09:17,927 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:09:17,928 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:09:17,928 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_87fcfa5a-ec52-4753-ae59-6d30cb2c0b94/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strdup_true-termination.c.i [2018-11-10 05:09:17,973 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_87fcfa5a-ec52-4753-ae59-6d30cb2c0b94/bin-2019/uautomizer/data/c527fadec/976942eaafb74334971a43eced442ffa/FLAGd0491eb70 [2018-11-10 05:09:18,410 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:09:18,410 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_87fcfa5a-ec52-4753-ae59-6d30cb2c0b94/sv-benchmarks/c/termination-libowfat/strdup_true-termination.c.i [2018-11-10 05:09:18,421 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_87fcfa5a-ec52-4753-ae59-6d30cb2c0b94/bin-2019/uautomizer/data/c527fadec/976942eaafb74334971a43eced442ffa/FLAGd0491eb70 [2018-11-10 05:09:18,432 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_87fcfa5a-ec52-4753-ae59-6d30cb2c0b94/bin-2019/uautomizer/data/c527fadec/976942eaafb74334971a43eced442ffa [2018-11-10 05:09:18,435 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:09:18,436 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:09:18,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:09:18,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:09:18,439 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:09:18,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:09:18" (1/1) ... [2018-11-10 05:09:18,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40bf107b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:09:18, skipping insertion in model container [2018-11-10 05:09:18,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:09:18" (1/1) ... [2018-11-10 05:09:18,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:09:18,481 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:09:18,675 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:09:18,683 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:09:18,714 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:09:18,744 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:09:18,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:09:18 WrapperNode [2018-11-10 05:09:18,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:09:18,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:09:18,746 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:09:18,746 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:09:18,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:09:18" (1/1) ... [2018-11-10 05:09:18,811 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:09:18" (1/1) ... [2018-11-10 05:09:18,827 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:09:18,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:09:18,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:09:18,827 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:09:18,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:09:18" (1/1) ... [2018-11-10 05:09:18,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:09:18" (1/1) ... [2018-11-10 05:09:18,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:09:18" (1/1) ... [2018-11-10 05:09:18,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:09:18" (1/1) ... [2018-11-10 05:09:18,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:09:18" (1/1) ... [2018-11-10 05:09:18,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:09:18" (1/1) ... [2018-11-10 05:09:18,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:09:18" (1/1) ... [2018-11-10 05:09:18,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:09:18,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:09:18,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:09:18,843 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:09:18,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:09:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_87fcfa5a-ec52-4753-ae59-6d30cb2c0b94/bin-2019/uautomizer/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 [2018-11-10 05:09:18,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 05:09:18,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 05:09:18,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:09:18,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:09:19,053 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:09:19,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:09:19 BoogieIcfgContainer [2018-11-10 05:09:19,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:09:19,054 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 05:09:19,054 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 05:09:19,057 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 05:09:19,058 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:09:19,058 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 05:09:18" (1/3) ... [2018-11-10 05:09:19,058 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b85818d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:09:19, skipping insertion in model container [2018-11-10 05:09:19,059 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:09:19,059 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:09:18" (2/3) ... [2018-11-10 05:09:19,059 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b85818d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:09:19, skipping insertion in model container [2018-11-10 05:09:19,059 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:09:19,059 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:09:19" (3/3) ... [2018-11-10 05:09:19,060 INFO L375 chiAutomizerObserver]: Analyzing ICFG strdup_true-termination.c.i [2018-11-10 05:09:19,098 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:09:19,098 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 05:09:19,099 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 05:09:19,099 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 05:09:19,099 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:09:19,099 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:09:19,099 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 05:09:19,099 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:09:19,099 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 05:09:19,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-10 05:09:19,122 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 05:09:19,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:09:19,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:09:19,127 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:09:19,127 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 05:09:19,127 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 05:09:19,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-10 05:09:19,129 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 05:09:19,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:09:19,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:09:19,130 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:09:19,130 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 05:09:19,137 INFO L793 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset;main_~in_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 13#L528true assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 10#L530true SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L530 12#L530-1true assume { :begin_inline_strdup } true;strdup_#in~s.base, strdup_#in~s.offset := main_~in~0.base, main_~in~0.offset;havoc strdup_#res.base, strdup_#res.offset;havoc strdup_#t~ret9, strdup_#t~malloc10.base, strdup_#t~malloc10.offset, strdup_#t~ret11.base, strdup_#t~ret11.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0, strdup_~tmp~0.base, strdup_~tmp~0.offset;strdup_~s.base, strdup_~s.offset := strdup_#in~s.base, strdup_#in~s.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strdup_~s.base, strdup_~s.offset;havoc strlen_#res;havoc strlen_#t~pre7, strlen_#t~pre6.base, strlen_#t~pre6.offset, strlen_#t~mem8, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 15#L516true assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 7#L517-5true [2018-11-10 05:09:19,137 INFO L795 eck$LassoCheckResult]: Loop: 7#L517-5true assume true; 3#L517-1true SUMMARY for call strlen_#t~mem8 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L517-1 4#L517-2true assume !!(strlen_#t~mem8 != 0);havoc strlen_#t~mem8;strlen_#t~pre7 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre7; 6#L517-4true strlen_#t~pre6.base, strlen_#t~pre6.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre6.base, strlen_#t~pre6.offset; 7#L517-5true [2018-11-10 05:09:19,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:09:19,142 INFO L82 PathProgramCache]: Analyzing trace with hash 889567241, now seen corresponding path program 1 times [2018-11-10 05:09:19,144 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:09:19,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:09:19,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:09:19,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:09:19,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:09:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:09:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:09:19,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:09:19,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1478788, now seen corresponding path program 1 times [2018-11-10 05:09:19,230 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:09:19,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:09:19,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:09:19,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:09:19,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:09:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:09:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:09:19,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:09:19,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1274086540, now seen corresponding path program 1 times [2018-11-10 05:09:19,242 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:09:19,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:09:19,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:09:19,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:09:19,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:09:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:09:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:09:19,497 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2018-11-10 05:09:19,561 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:09:19,562 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:09:19,562 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:09:19,562 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:09:19,562 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:09:19,563 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:09:19,563 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:09:19,563 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:09:19,564 INFO L131 ssoRankerPreferences]: Filename of dumped script: strdup_true-termination.c.i_Iteration1_Lasso [2018-11-10 05:09:19,564 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:09:19,564 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:09:19,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:19,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:19,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:19,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:19,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:19,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:19,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:19,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:19,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:19,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:19,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:19,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:19,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:19,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:19,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:19,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:19,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:19,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:19,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:19,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:19,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:19,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:19,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:20,114 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:09:20,117 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:09:20,118 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 [2018-11-10 05:09:20,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:20,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:20,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:20,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:20,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:20,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:20,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:20,123 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:20,123 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 [2018-11-10 05:09:20,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:20,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:20,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:20,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:20,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:20,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:20,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:20,126 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:20,126 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 [2018-11-10 05:09:20,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:20,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:20,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:20,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:20,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:20,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:20,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:20,129 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:20,129 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 [2018-11-10 05:09:20,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:20,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:20,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:20,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:20,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:20,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:20,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:20,132 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:20,132 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 [2018-11-10 05:09:20,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:20,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:20,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:20,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:20,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:20,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:20,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:20,135 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:20,135 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 [2018-11-10 05:09:20,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:20,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:20,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:20,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:20,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:09:20,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:09:20,142 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:20,142 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 [2018-11-10 05:09:20,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:20,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:20,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:20,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:20,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:20,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:20,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:20,145 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:20,145 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 [2018-11-10 05:09:20,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:20,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:20,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:20,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:20,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:20,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:20,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:20,148 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:20,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 [2018-11-10 05:09:20,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:20,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:20,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:20,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:20,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:20,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:20,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:20,150 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:20,151 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 [2018-11-10 05:09:20,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:20,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:20,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:20,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:20,153 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:09:20,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:09:20,164 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:20,165 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 [2018-11-10 05:09:20,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:20,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:20,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:20,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:20,166 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:09:20,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:09:20,169 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:20,170 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 [2018-11-10 05:09:20,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:20,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:20,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:20,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:20,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:20,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:20,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:20,173 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:20,173 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 [2018-11-10 05:09:20,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:20,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:20,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:20,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:20,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:20,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:20,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:20,175 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:20,175 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 [2018-11-10 05:09:20,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:20,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:20,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:20,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:20,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:20,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:20,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:20,177 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:20,178 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 [2018-11-10 05:09:20,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:20,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:20,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:20,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:20,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:20,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:20,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:20,180 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:20,180 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 [2018-11-10 05:09:20,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:20,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:20,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:20,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:20,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:20,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:20,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:20,182 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:20,182 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 [2018-11-10 05:09:20,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:20,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:20,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:20,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:20,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:20,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:20,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:20,184 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:20,185 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 [2018-11-10 05:09:20,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:20,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:20,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:20,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:20,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:20,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:20,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:20,187 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:20,187 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 [2018-11-10 05:09:20,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:20,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:20,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:20,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:20,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:20,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:20,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:20,189 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:20,189 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 [2018-11-10 05:09:20,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:20,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:20,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:20,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:20,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:20,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:20,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:20,191 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:20,192 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 [2018-11-10 05:09:20,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:20,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:20,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:20,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:20,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:20,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:20,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:20,194 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:20,194 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 [2018-11-10 05:09:20,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:20,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:20,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:20,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:20,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:20,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:20,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:20,196 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:20,196 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 [2018-11-10 05:09:20,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:20,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:20,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:20,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:20,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:09:20,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:09:20,203 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:20,203 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 [2018-11-10 05:09:20,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:20,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:20,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:20,204 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:09:20,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:20,205 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:09:20,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:20,207 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:20,207 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 [2018-11-10 05:09:20,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:20,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:20,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:20,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:20,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:09:20,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:09:20,212 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:20,213 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 [2018-11-10 05:09:20,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:20,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:20,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:20,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:20,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:09:20,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:09:20,221 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:20,221 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 [2018-11-10 05:09:20,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:20,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:20,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:20,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:20,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:09:20,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:09:20,270 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:09:20,302 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 05:09:20,302 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 05:09:20,304 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:09:20,305 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:09:20,305 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:09:20,306 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strlen_~s.base)_1, ULTIMATE.start_strlen_~s.offset) = 1*v_rep(select #length ULTIMATE.start_strlen_~s.base)_1 - 1*ULTIMATE.start_strlen_~s.offset Supporting invariants [] [2018-11-10 05:09:20,333 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-10 05:09:20,338 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 05:09:20,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:09:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:09:20,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:09:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:09:20,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:09:20,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:09:20,402 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 [2018-11-10 05:09:20,403 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 4 states. [2018-11-10 05:09:20,437 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 4 states. Result 61 states and 73 transitions. Complement of second has 8 states. [2018-11-10 05:09:20,438 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 [2018-11-10 05:09:20,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 05:09:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2018-11-10 05:09:20,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-10 05:09:20,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:09:20,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-10 05:09:20,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:09:20,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-10 05:09:20,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:09:20,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 73 transitions. [2018-11-10 05:09:20,445 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-10 05:09:20,447 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 30 states and 33 transitions. [2018-11-10 05:09:20,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-10 05:09:20,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-10 05:09:20,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 33 transitions. [2018-11-10 05:09:20,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:09:20,449 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-10 05:09:20,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 33 transitions. [2018-11-10 05:09:20,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2018-11-10 05:09:20,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-10 05:09:20,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-10 05:09:20,465 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-10 05:09:20,465 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-10 05:09:20,465 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 05:09:20,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2018-11-10 05:09:20,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 05:09:20,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:09:20,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:09:20,466 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:09:20,467 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:09:20,467 INFO L793 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 174#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset;main_~in_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 175#L528 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 179#L530 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L530 180#L530-1 assume { :begin_inline_strdup } true;strdup_#in~s.base, strdup_#in~s.offset := main_~in~0.base, main_~in~0.offset;havoc strdup_#res.base, strdup_#res.offset;havoc strdup_#t~ret9, strdup_#t~malloc10.base, strdup_#t~malloc10.offset, strdup_#t~ret11.base, strdup_#t~ret11.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0, strdup_~tmp~0.base, strdup_~tmp~0.offset;strdup_~s.base, strdup_~s.offset := strdup_#in~s.base, strdup_#in~s.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strdup_~s.base, strdup_~s.offset;havoc strlen_#res;havoc strlen_#t~pre7, strlen_#t~pre6.base, strlen_#t~pre6.offset, strlen_#t~mem8, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 160#L516 assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; 161#L518 strdup_#t~ret9 := strlen_#res;assume { :end_inline_strlen } true;strdup_~l~0 := strdup_#t~ret9 + 1;havoc strdup_#t~ret9;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := strdup_~l~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];strdup_#t~malloc10.base, strdup_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;strdup_~tmp~0.base, strdup_~tmp~0.offset := strdup_#t~malloc10.base, strdup_#t~malloc10.offset; 173#L523 assume !(strdup_~tmp~0.base == 0 && strdup_~tmp~0.offset == 0);assume { :begin_inline_memcpy } true;memcpy_#in~dst.base, memcpy_#in~dst.offset, memcpy_#in~src.base, memcpy_#in~src.offset, memcpy_#in~n := strdup_~tmp~0.base, strdup_~tmp~0.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0;havoc memcpy_#res.base, memcpy_#res.offset;havoc memcpy_#t~post3.base, memcpy_#t~post3.offset, memcpy_#t~post4.base, memcpy_#t~post4.offset, memcpy_#t~mem5, memcpy_#t~post2, memcpy_~dst.base, memcpy_~dst.offset, memcpy_~src.base, memcpy_~src.offset, memcpy_~n, memcpy_~res~0.base, memcpy_~res~0.offset, memcpy_~c1~0.base, memcpy_~c1~0.offset, memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~dst.base, memcpy_~dst.offset := memcpy_#in~dst.base, memcpy_#in~dst.offset;memcpy_~src.base, memcpy_~src.offset := memcpy_#in~src.base, memcpy_#in~src.offset;memcpy_~n := memcpy_#in~n;memcpy_~res~0.base, memcpy_~res~0.offset := memcpy_~dst.base, memcpy_~dst.offset;havoc memcpy_~c1~0.base, memcpy_~c1~0.offset;havoc memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~c1~0.base, memcpy_~c1~0.offset := memcpy_~dst.base, memcpy_~dst.offset;memcpy_~c2~0.base, memcpy_~c2~0.offset := memcpy_~src.base, memcpy_~src.offset; 168#L511-7 [2018-11-10 05:09:20,467 INFO L795 eck$LassoCheckResult]: Loop: 168#L511-7 assume true; 171#L511-1 memcpy_#t~post2 := memcpy_~n;memcpy_~n := memcpy_#t~post2 - 1; 176#L511-2 assume !!(memcpy_#t~post2 % 4294967296 != 0);havoc memcpy_#t~post2;memcpy_#t~post3.base, memcpy_#t~post3.offset := memcpy_~c1~0.base, memcpy_~c1~0.offset;memcpy_~c1~0.base, memcpy_~c1~0.offset := memcpy_#t~post3.base, memcpy_#t~post3.offset + 1;memcpy_#t~post4.base, memcpy_#t~post4.offset := memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~c2~0.base, memcpy_~c2~0.offset := memcpy_#t~post4.base, memcpy_#t~post4.offset + 1; 178#L511-4 SUMMARY for call memcpy_#t~mem5 := read~int(memcpy_#t~post4.base, memcpy_#t~post4.offset, 1); srcloc: L511-4 181#L511-5 SUMMARY for call write~int(memcpy_#t~mem5, memcpy_#t~post3.base, memcpy_#t~post3.offset, 1); srcloc: L511-5 167#L511-6 havoc memcpy_#t~post4.base, memcpy_#t~post4.offset;havoc memcpy_#t~mem5;havoc memcpy_#t~post3.base, memcpy_#t~post3.offset; 168#L511-7 [2018-11-10 05:09:20,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:09:20,467 INFO L82 PathProgramCache]: Analyzing trace with hash 175625804, now seen corresponding path program 1 times [2018-11-10 05:09:20,468 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:09:20,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:09:20,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:09:20,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:09:20,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:09:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:09:20,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:09:20,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:09:20,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 05:09:20,503 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:09:20,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:09:20,503 INFO L82 PathProgramCache]: Analyzing trace with hash 2102488933, now seen corresponding path program 1 times [2018-11-10 05:09:20,503 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:09:20,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:09:20,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:09:20,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:09:20,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:09:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:09:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:09:20,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:09:20,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:09:20,630 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-10 05:09:20,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:09:20,644 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-10 05:09:20,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:09:20,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2018-11-10 05:09:20,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 05:09:20,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 24 transitions. [2018-11-10 05:09:20,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-10 05:09:20,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-10 05:09:20,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2018-11-10 05:09:20,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:09:20,647 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-10 05:09:20,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2018-11-10 05:09:20,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-10 05:09:20,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-10 05:09:20,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-10 05:09:20,649 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-10 05:09:20,649 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-10 05:09:20,649 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 05:09:20,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2018-11-10 05:09:20,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 05:09:20,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:09:20,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:09:20,650 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:09:20,650 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:09:20,650 INFO L793 eck$LassoCheckResult]: Stem: 230#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 227#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset;main_~in_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 228#L528 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 232#L530 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L530 233#L530-1 assume { :begin_inline_strdup } true;strdup_#in~s.base, strdup_#in~s.offset := main_~in~0.base, main_~in~0.offset;havoc strdup_#res.base, strdup_#res.offset;havoc strdup_#t~ret9, strdup_#t~malloc10.base, strdup_#t~malloc10.offset, strdup_#t~ret11.base, strdup_#t~ret11.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0, strdup_~tmp~0.base, strdup_~tmp~0.offset;strdup_~s.base, strdup_~s.offset := strdup_#in~s.base, strdup_#in~s.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strdup_~s.base, strdup_~s.offset;havoc strlen_#res;havoc strlen_#t~pre7, strlen_#t~pre6.base, strlen_#t~pre6.offset, strlen_#t~mem8, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 213#L516 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 214#L517-5 assume true; 215#L517-1 SUMMARY for call strlen_#t~mem8 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L517-1 216#L517-2 assume !(strlen_#t~mem8 != 0);havoc strlen_#t~mem8; 221#L517-6 strlen_#res := strlen_~i~0; 226#L518 strdup_#t~ret9 := strlen_#res;assume { :end_inline_strlen } true;strdup_~l~0 := strdup_#t~ret9 + 1;havoc strdup_#t~ret9;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := strdup_~l~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];strdup_#t~malloc10.base, strdup_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;strdup_~tmp~0.base, strdup_~tmp~0.offset := strdup_#t~malloc10.base, strdup_#t~malloc10.offset; 225#L523 assume !(strdup_~tmp~0.base == 0 && strdup_~tmp~0.offset == 0);assume { :begin_inline_memcpy } true;memcpy_#in~dst.base, memcpy_#in~dst.offset, memcpy_#in~src.base, memcpy_#in~src.offset, memcpy_#in~n := strdup_~tmp~0.base, strdup_~tmp~0.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0;havoc memcpy_#res.base, memcpy_#res.offset;havoc memcpy_#t~post3.base, memcpy_#t~post3.offset, memcpy_#t~post4.base, memcpy_#t~post4.offset, memcpy_#t~mem5, memcpy_#t~post2, memcpy_~dst.base, memcpy_~dst.offset, memcpy_~src.base, memcpy_~src.offset, memcpy_~n, memcpy_~res~0.base, memcpy_~res~0.offset, memcpy_~c1~0.base, memcpy_~c1~0.offset, memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~dst.base, memcpy_~dst.offset := memcpy_#in~dst.base, memcpy_#in~dst.offset;memcpy_~src.base, memcpy_~src.offset := memcpy_#in~src.base, memcpy_#in~src.offset;memcpy_~n := memcpy_#in~n;memcpy_~res~0.base, memcpy_~res~0.offset := memcpy_~dst.base, memcpy_~dst.offset;havoc memcpy_~c1~0.base, memcpy_~c1~0.offset;havoc memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~c1~0.base, memcpy_~c1~0.offset := memcpy_~dst.base, memcpy_~dst.offset;memcpy_~c2~0.base, memcpy_~c2~0.offset := memcpy_~src.base, memcpy_~src.offset; 220#L511-7 [2018-11-10 05:09:20,651 INFO L795 eck$LassoCheckResult]: Loop: 220#L511-7 assume true; 223#L511-1 memcpy_#t~post2 := memcpy_~n;memcpy_~n := memcpy_#t~post2 - 1; 229#L511-2 assume !!(memcpy_#t~post2 % 4294967296 != 0);havoc memcpy_#t~post2;memcpy_#t~post3.base, memcpy_#t~post3.offset := memcpy_~c1~0.base, memcpy_~c1~0.offset;memcpy_~c1~0.base, memcpy_~c1~0.offset := memcpy_#t~post3.base, memcpy_#t~post3.offset + 1;memcpy_#t~post4.base, memcpy_#t~post4.offset := memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~c2~0.base, memcpy_~c2~0.offset := memcpy_#t~post4.base, memcpy_#t~post4.offset + 1; 231#L511-4 SUMMARY for call memcpy_#t~mem5 := read~int(memcpy_#t~post4.base, memcpy_#t~post4.offset, 1); srcloc: L511-4 234#L511-5 SUMMARY for call write~int(memcpy_#t~mem5, memcpy_#t~post3.base, memcpy_#t~post3.offset, 1); srcloc: L511-5 219#L511-6 havoc memcpy_#t~post4.base, memcpy_#t~post4.offset;havoc memcpy_#t~mem5;havoc memcpy_#t~post3.base, memcpy_#t~post3.offset; 220#L511-7 [2018-11-10 05:09:20,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:09:20,651 INFO L82 PathProgramCache]: Analyzing trace with hash 331430871, now seen corresponding path program 1 times [2018-11-10 05:09:20,651 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:09:20,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:09:20,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:09:20,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:09:20,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:09:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:09:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:09:20,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:09:20,671 INFO L82 PathProgramCache]: Analyzing trace with hash 2102488933, now seen corresponding path program 2 times [2018-11-10 05:09:20,671 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:09:20,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:09:20,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:09:20,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:09:20,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:09:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:09:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:09:20,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:09:20,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1148187323, now seen corresponding path program 1 times [2018-11-10 05:09:20,684 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:09:20,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:09:20,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:09:20,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:09:20,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:09:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:09:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:09:21,087 WARN L179 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 138 [2018-11-10 05:09:21,180 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:09:21,180 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:09:21,180 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:09:21,180 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:09:21,180 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:09:21,181 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:09:21,181 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:09:21,181 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:09:21,181 INFO L131 ssoRankerPreferences]: Filename of dumped script: strdup_true-termination.c.i_Iteration3_Lasso [2018-11-10 05:09:21,181 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:09:21,181 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:09:21,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:21,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:21,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:21,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:21,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:21,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:21,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:21,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:21,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:21,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:21,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:21,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:21,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:21,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:21,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:21,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:21,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:21,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:21,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:21,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:21,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:21,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:21,583 WARN L179 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 130 [2018-11-10 05:09:21,719 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2018-11-10 05:09:21,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:21,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:09:22,020 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-11-10 05:09:22,338 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:09:22,338 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:09:22,339 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 [2018-11-10 05:09:22,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:22,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:22,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:22,341 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,342 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 [2018-11-10 05:09:22,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:22,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:22,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:22,344 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,344 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 [2018-11-10 05:09:22,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:22,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:22,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:22,346 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,346 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 [2018-11-10 05:09:22,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:22,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:22,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:22,348 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,348 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 [2018-11-10 05:09:22,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:09:22,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:09:22,351 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,351 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 [2018-11-10 05:09:22,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:22,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:22,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:22,353 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,353 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 [2018-11-10 05:09:22,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:22,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:22,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:22,355 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,355 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 [2018-11-10 05:09:22,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:22,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:22,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:22,357 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,357 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 [2018-11-10 05:09:22,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:22,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:22,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:22,358 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,359 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 [2018-11-10 05:09:22,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:22,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:22,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:22,360 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,361 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 [2018-11-10 05:09:22,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:22,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:22,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:22,362 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,362 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 [2018-11-10 05:09:22,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:09:22,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:09:22,365 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,366 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 [2018-11-10 05:09:22,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:22,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:22,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:22,367 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,368 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 [2018-11-10 05:09:22,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:22,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:22,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:22,369 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,369 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 [2018-11-10 05:09:22,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:22,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:22,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:22,371 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,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 [2018-11-10 05:09:22,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:22,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:22,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:22,373 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,373 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 [2018-11-10 05:09:22,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:22,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:22,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:22,375 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,375 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 [2018-11-10 05:09:22,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:22,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:22,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:22,377 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,377 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 [2018-11-10 05:09:22,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:22,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:22,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:22,379 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,379 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 [2018-11-10 05:09:22,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:22,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:22,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:22,380 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,381 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 [2018-11-10 05:09:22,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:22,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:22,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:22,382 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,383 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 [2018-11-10 05:09:22,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:09:22,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:09:22,386 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,386 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 [2018-11-10 05:09:22,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:09:22,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:09:22,393 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,393 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 [2018-11-10 05:09:22,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:09:22,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:09:22,397 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,398 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 [2018-11-10 05:09:22,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:09:22,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:09:22,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:09:22,399 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,400 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 [2018-11-10 05:09:22,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,400 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:09:22,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,403 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:09:22,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:09:22,415 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,415 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 [2018-11-10 05:09:22,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,416 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:09:22,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,418 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:09:22,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:09:22,426 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,426 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 [2018-11-10 05:09:22,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:09:22,429 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:09:22,435 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,435 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 [2018-11-10 05:09:22,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:09:22,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:09:22,438 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,438 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 [2018-11-10 05:09:22,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:09:22,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:09:22,442 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:09:22,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 [2018-11-10 05:09:22,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:09:22,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:09:22,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:09:22,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:09:22,449 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:09:22,450 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:09:22,501 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:09:22,560 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 05:09:22,560 INFO L444 ModelExtractionUtils]: 83 out of 88 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 05:09:22,561 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:09:22,561 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:09:22,562 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:09:22,562 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_memcpy_~c1~0.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2) = -1*ULTIMATE.start_memcpy_~c1~0.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 Supporting invariants [] [2018-11-10 05:09:22,644 INFO L297 tatePredicateManager]: 17 out of 18 supporting invariants were superfluous and have been removed [2018-11-10 05:09:22,646 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 05:09:22,646 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 05:09:22,647 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 05:09:22,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:09:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:09:22,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:09:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:09:22,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:09:22,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:09:22,762 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 05:09:22,762 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-11-10 05:09:22,812 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 24 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 29 states and 32 transitions. Complement of second has 7 states. [2018-11-10 05:09:22,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 05:09:22,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 05:09:22,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-11-10 05:09:22,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-10 05:09:22,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:09:22,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 18 letters. Loop has 6 letters. [2018-11-10 05:09:22,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:09:22,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 12 letters. Loop has 12 letters. [2018-11-10 05:09:22,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:09:22,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 32 transitions. [2018-11-10 05:09:22,815 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:09:22,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 0 states and 0 transitions. [2018-11-10 05:09:22,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 05:09:22,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 05:09:22,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 05:09:22,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:09:22,815 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:09:22,815 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:09:22,815 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:09:22,815 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 05:09:22,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:09:22,815 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:09:22,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 05:09:22,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 05:09:22 BoogieIcfgContainer [2018-11-10 05:09:22,819 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 05:09:22,820 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:09:22,820 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:09:22,820 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:09:22,820 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:09:19" (3/4) ... [2018-11-10 05:09:22,823 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 05:09:22,823 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:09:22,823 INFO L168 Benchmark]: Toolchain (without parser) took 4387.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Free memory was 957.6 MB in the beginning and 1.0 GB in the end (delta: -46.7 MB). Peak memory consumption was 143.6 MB. Max. memory is 11.5 GB. [2018-11-10 05:09:22,824 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:09:22,824 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.92 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:09:22,824 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -197.8 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-10 05:09:22,825 INFO L168 Benchmark]: Boogie Preprocessor took 16.10 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. [2018-11-10 05:09:22,825 INFO L168 Benchmark]: RCFGBuilder took 210.07 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:09:22,826 INFO L168 Benchmark]: BuchiAutomizer took 3765.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 108.9 MB). Peak memory consumption was 159.3 MB. Max. memory is 11.5 GB. [2018-11-10 05:09:22,826 INFO L168 Benchmark]: Witness Printer took 3.00 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. [2018-11-10 05:09:22,829 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 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 308.92 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -197.8 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.10 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 210.07 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3765.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 108.9 MB). Peak memory consumption was 159.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.00 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.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 5 locations. One deterministic module has affine ranking function -1 * c1 + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 22 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 58 SDtfs, 74 SDslu, 24 SDs, 0 SdLazy, 23 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital203 mio100 ax100 hnf100 lsp93 ukn113 mio100 lsp44 div113 bol100 ite100 ukn100 eq196 hnf83 smp98 dnf102 smp100 tf100 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 9 VariablesLoop: 5 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...