./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strdup_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_34cdf95e-fee6-4883-b6fa-1911a8bdc034/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_34cdf95e-fee6-4883-b6fa-1911a8bdc034/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_34cdf95e-fee6-4883-b6fa-1911a8bdc034/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_34cdf95e-fee6-4883-b6fa-1911a8bdc034/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_34cdf95e-fee6-4883-b6fa-1911a8bdc034/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_34cdf95e-fee6-4883-b6fa-1911a8bdc034/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-aa41828 [2018-11-23 15:24:02,548 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:24:02,549 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:24:02,556 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:24:02,556 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:24:02,557 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:24:02,558 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:24:02,559 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:24:02,560 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:24:02,560 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:24:02,560 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:24:02,561 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:24:02,561 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:24:02,562 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:24:02,563 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:24:02,563 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:24:02,564 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:24:02,565 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:24:02,566 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:24:02,567 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:24:02,568 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:24:02,569 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:24:02,571 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:24:02,571 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:24:02,571 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:24:02,572 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:24:02,573 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:24:02,574 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:24:02,574 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:24:02,575 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:24:02,575 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:24:02,576 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:24:02,576 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:24:02,576 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:24:02,577 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:24:02,578 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:24:02,578 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_34cdf95e-fee6-4883-b6fa-1911a8bdc034/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 15:24:02,589 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:24:02,589 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:24:02,589 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:24:02,590 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:24:02,590 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:24:02,590 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 15:24:02,590 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 15:24:02,590 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 15:24:02,590 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 15:24:02,590 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 15:24:02,591 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 15:24:02,591 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:24:02,591 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 15:24:02,591 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:24:02,591 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:24:02,591 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 15:24:02,591 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 15:24:02,591 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 15:24:02,592 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:24:02,592 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 15:24:02,593 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:24:02,594 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 15:24:02,594 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:24:02,594 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:24:02,594 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 15:24:02,594 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:24:02,594 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:24:02,594 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 15:24:02,595 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 15:24:02,595 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_34cdf95e-fee6-4883-b6fa-1911a8bdc034/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-23 15:24:02,617 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:24:02,626 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:24:02,629 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:24:02,630 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:24:02,630 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:24:02,630 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_34cdf95e-fee6-4883-b6fa-1911a8bdc034/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strdup_true-termination.c.i [2018-11-23 15:24:02,669 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_34cdf95e-fee6-4883-b6fa-1911a8bdc034/bin-2019/uautomizer/data/b9b32eb66/fbc34c1e35614449b5a0c12bc3b6d970/FLAG2d6b61919 [2018-11-23 15:24:02,996 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:24:02,997 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_34cdf95e-fee6-4883-b6fa-1911a8bdc034/sv-benchmarks/c/termination-libowfat/strdup_true-termination.c.i [2018-11-23 15:24:03,003 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_34cdf95e-fee6-4883-b6fa-1911a8bdc034/bin-2019/uautomizer/data/b9b32eb66/fbc34c1e35614449b5a0c12bc3b6d970/FLAG2d6b61919 [2018-11-23 15:24:03,013 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_34cdf95e-fee6-4883-b6fa-1911a8bdc034/bin-2019/uautomizer/data/b9b32eb66/fbc34c1e35614449b5a0c12bc3b6d970 [2018-11-23 15:24:03,016 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:24:03,017 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:24:03,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:24:03,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:24:03,020 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:24:03,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:24:03" (1/1) ... [2018-11-23 15:24:03,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79f980c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:03, skipping insertion in model container [2018-11-23 15:24:03,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:24:03" (1/1) ... [2018-11-23 15:24:03,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:24:03,055 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:24:03,244 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:24:03,251 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:24:03,321 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:24:03,354 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:24:03,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:03 WrapperNode [2018-11-23 15:24:03,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:24:03,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:24:03,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:24:03,355 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:24:03,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:03" (1/1) ... [2018-11-23 15:24:03,371 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:03" (1/1) ... [2018-11-23 15:24:03,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:24:03,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:24:03,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:24:03,386 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:24:03,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:03" (1/1) ... [2018-11-23 15:24:03,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:03" (1/1) ... [2018-11-23 15:24:03,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:03" (1/1) ... [2018-11-23 15:24:03,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:03" (1/1) ... [2018-11-23 15:24:03,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:03" (1/1) ... [2018-11-23 15:24:03,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:03" (1/1) ... [2018-11-23 15:24:03,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:03" (1/1) ... [2018-11-23 15:24:03,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:24:03,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:24:03,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:24:03,404 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:24:03,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34cdf95e-fee6-4883-b6fa-1911a8bdc034/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-23 15:24:03,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:24:03,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 15:24:03,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:24:03,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:24:03,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:24:03,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:24:03,627 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:24:03,627 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-23 15:24:03,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:24:03 BoogieIcfgContainer [2018-11-23 15:24:03,627 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:24:03,628 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 15:24:03,628 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 15:24:03,631 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 15:24:03,632 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:24:03,632 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:24:03" (1/3) ... [2018-11-23 15:24:03,633 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1133964d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:24:03, skipping insertion in model container [2018-11-23 15:24:03,633 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:24:03,634 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:03" (2/3) ... [2018-11-23 15:24:03,634 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1133964d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:24:03, skipping insertion in model container [2018-11-23 15:24:03,634 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:24:03,634 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:24:03" (3/3) ... [2018-11-23 15:24:03,636 INFO L375 chiAutomizerObserver]: Analyzing ICFG strdup_true-termination.c.i [2018-11-23 15:24:03,684 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:24:03,684 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 15:24:03,684 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 15:24:03,684 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 15:24:03,685 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:24:03,685 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:24:03,685 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 15:24:03,685 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:24:03,685 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 15:24:03,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 15:24:03,716 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 15:24:03,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:24:03,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:24:03,723 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 15:24:03,723 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:24:03,723 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 15:24:03,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 15:24:03,724 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 15:24:03,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:24:03,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:24:03,725 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 15:24:03,725 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:24:03,731 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true 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; 19#L528true assume !(main_~in_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);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;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; 3#L516true assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 7#L517-4true [2018-11-23 15:24:03,732 INFO L796 eck$LassoCheckResult]: Loop: 7#L517-4true call strlen_#t~mem8 := read~int(strlen_~s.base, strlen_~s.offset, 1); 4#L517-1true assume !!(0 != strlen_#t~mem8);havoc strlen_#t~mem8;strlen_#t~pre7 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre7; 5#L517-3true strlen_#t~pre6.base, strlen_#t~pre6.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre6.base, strlen_#t~pre6.offset; 7#L517-4true [2018-11-23 15:24:03,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:24:03,737 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-11-23 15:24:03,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:24:03,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:24:03,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:03,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:24:03,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:03,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:24:03,845 INFO L82 PathProgramCache]: Analyzing trace with hash 45841, now seen corresponding path program 1 times [2018-11-23 15:24:03,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:24:03,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:24:03,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:03,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:24:03,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:03,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:24:03,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1806906826, now seen corresponding path program 1 times [2018-11-23 15:24:03,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:24:03,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:24:03,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:03,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:24:03,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:04,096 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-11-23 15:24:04,158 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:24:04,158 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:24:04,159 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:24:04,159 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:24:04,159 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:24:04,159 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:24:04,159 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:24:04,159 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:24:04,159 INFO L131 ssoRankerPreferences]: Filename of dumped script: strdup_true-termination.c.i_Iteration1_Lasso [2018-11-23 15:24:04,159 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:24:04,160 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:24:04,177 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-23 15:24:04,180 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-23 15:24:04,182 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-23 15:24:04,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-23 15:24:04,188 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-23 15:24:04,191 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-23 15:24:04,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-23 15:24:04,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-23 15:24:04,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-23 15:24:04,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-23 15:24:04,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-23 15:24:04,211 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-23 15:24:04,212 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-23 15:24:04,214 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-23 15:24:04,217 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-23 15:24:04,218 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-23 15:24:04,220 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-23 15:24:04,385 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-23 15:24:04,386 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-23 15:24:04,388 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-23 15:24:04,389 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-23 15:24:04,391 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-23 15:24:04,394 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-23 15:24:04,669 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:24:04,673 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:24:04,675 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-23 15:24:04,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:04,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:04,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:04,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:04,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:04,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:04,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:04,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:04,682 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-23 15:24:04,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:04,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:04,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:04,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:04,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:04,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:04,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:04,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:04,684 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-23 15:24:04,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:04,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:04,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:04,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:04,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:04,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:04,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:04,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:04,687 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-23 15:24:04,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:04,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:04,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:04,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:04,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:04,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:04,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:04,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:04,691 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-23 15:24:04,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:04,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:04,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:04,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:04,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:04,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:04,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:04,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:04,693 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-23 15:24:04,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:04,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:04,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:04,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:04,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:24:04,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:24:04,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:04,699 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-23 15:24:04,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:04,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:04,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:04,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:04,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:04,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:04,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:04,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:04,702 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-23 15:24:04,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:04,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:04,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:04,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:04,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:04,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:04,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:04,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:04,705 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-23 15:24:04,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:04,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:04,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:04,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:04,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:04,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:04,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:04,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:04,707 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-23 15:24:04,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:04,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:04,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:04,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:04,710 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:24:04,710 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:24:04,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:04,722 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-23 15:24:04,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:04,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:04,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:04,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:04,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:24:04,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:24:04,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:04,727 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-23 15:24:04,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:04,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:04,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:04,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:04,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:04,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:04,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:04,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:04,729 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-23 15:24:04,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:04,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:04,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:04,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:04,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:04,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:04,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:04,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:04,732 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-23 15:24:04,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:04,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:04,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:04,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:04,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:04,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:04,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:04,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:04,734 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-23 15:24:04,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:04,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:04,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:04,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:04,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:04,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:04,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:04,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:04,737 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-23 15:24:04,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:04,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:04,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:04,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:04,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:04,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:04,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:04,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:04,739 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-23 15:24:04,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:04,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:04,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:04,740 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 15:24:04,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:04,741 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:24:04,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:04,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:04,744 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-23 15:24:04,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:04,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:04,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:04,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:04,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:24:04,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:24:04,773 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:24:04,797 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 15:24:04,797 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 15:24:04,799 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:24:04,800 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:24:04,801 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:24:04,801 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlen_~s.offset, v_rep(select #length ULTIMATE.start_strlen_~s.base)_1) = -1*ULTIMATE.start_strlen_~s.offset + 1*v_rep(select #length ULTIMATE.start_strlen_~s.base)_1 Supporting invariants [] [2018-11-23 15:24:04,820 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 15:24:04,824 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 15:24:04,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:24:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:24:04,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:24:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:24:04,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:24:04,881 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-23 15:24:04,891 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-23 15:24:04,892 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2018-11-23 15:24:04,922 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 45 states and 57 transitions. Complement of second has 6 states. [2018-11-23 15:24:04,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 15:24:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:24:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2018-11-23 15:24:04,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-23 15:24:04,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:24:04,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 15:24:04,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:24:04,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-23 15:24:04,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:24:04,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 57 transitions. [2018-11-23 15:24:04,929 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 15:24:04,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 18 states and 21 transitions. [2018-11-23 15:24:04,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 15:24:04,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-23 15:24:04,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-11-23 15:24:04,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:24:04,933 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-23 15:24:04,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-11-23 15:24:04,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-11-23 15:24:04,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 15:24:04,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-11-23 15:24:04,952 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-23 15:24:04,952 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-23 15:24:04,952 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 15:24:04,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2018-11-23 15:24:04,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 15:24:04,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:24:04,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:24:04,954 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 15:24:04,954 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 15:24:04,954 INFO L794 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 125#L-1 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; 126#L528 assume !(main_~in_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);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;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; 127#L516 assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; 128#L518 strdup_#t~ret9 := strlen_#res;strdup_~l~0 := 1 + strdup_#t~ret9;havoc strdup_#t~ret9;call strdup_#t~malloc10.base, strdup_#t~malloc10.offset := #Ultimate.alloc(strdup_~l~0);strdup_~tmp~0.base, strdup_~tmp~0.offset := strdup_#t~malloc10.base, strdup_#t~malloc10.offset; 138#L523 assume !(strdup_~tmp~0.base == 0 && strdup_~tmp~0.offset == 0);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; 135#L511-3 [2018-11-23 15:24:04,954 INFO L796 eck$LassoCheckResult]: Loop: 135#L511-3 memcpy_#t~post2 := memcpy_~n;memcpy_~n := memcpy_#t~post2 - 1; 134#L511-1 assume !!(0 != memcpy_#t~post2 % 4294967296);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, 1 + memcpy_#t~post3.offset;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, 1 + memcpy_#t~post4.offset;call memcpy_#t~mem5 := read~int(memcpy_#t~post4.base, memcpy_#t~post4.offset, 1);call write~int(memcpy_#t~mem5, memcpy_#t~post3.base, memcpy_#t~post3.offset, 1);havoc memcpy_#t~post4.base, memcpy_#t~post4.offset;havoc memcpy_#t~post3.base, memcpy_#t~post3.offset;havoc memcpy_#t~mem5; 135#L511-3 [2018-11-23 15:24:04,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:24:04,955 INFO L82 PathProgramCache]: Analyzing trace with hash 889569803, now seen corresponding path program 1 times [2018-11-23 15:24:04,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:24:04,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:24:04,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:04,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:24:04,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:24:04,984 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-23 15:24:04,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:24:04,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:24:04,986 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:24:04,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:24:04,987 INFO L82 PathProgramCache]: Analyzing trace with hash 2214, now seen corresponding path program 1 times [2018-11-23 15:24:04,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:24:04,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:24:04,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:04,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:24:04,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:05,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:24:05,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:24:05,068 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 15:24:05,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:24:05,081 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-11-23 15:24:05,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:24:05,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2018-11-23 15:24:05,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 15:24:05,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 16 transitions. [2018-11-23 15:24:05,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 15:24:05,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 15:24:05,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2018-11-23 15:24:05,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:24:05,084 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-23 15:24:05,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2018-11-23 15:24:05,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 15:24:05,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 15:24:05,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-11-23 15:24:05,085 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-23 15:24:05,086 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-23 15:24:05,086 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 15:24:05,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2018-11-23 15:24:05,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 15:24:05,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:24:05,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:24:05,087 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:24:05,087 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 15:24:05,087 INFO L794 eck$LassoCheckResult]: Stem: 169#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 159#L-1 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; 160#L528 assume !(main_~in_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);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;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; 161#L516 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 162#L517-4 call strlen_#t~mem8 := read~int(strlen_~s.base, strlen_~s.offset, 1); 163#L517-1 assume !(0 != strlen_#t~mem8);havoc strlen_#t~mem8; 164#L517-5 strlen_#res := strlen_~i~0; 171#L518 strdup_#t~ret9 := strlen_#res;strdup_~l~0 := 1 + strdup_#t~ret9;havoc strdup_#t~ret9;call strdup_#t~malloc10.base, strdup_#t~malloc10.offset := #Ultimate.alloc(strdup_~l~0);strdup_~tmp~0.base, strdup_~tmp~0.offset := strdup_#t~malloc10.base, strdup_#t~malloc10.offset; 172#L523 assume !(strdup_~tmp~0.base == 0 && strdup_~tmp~0.offset == 0);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-3 [2018-11-23 15:24:05,087 INFO L796 eck$LassoCheckResult]: Loop: 168#L511-3 memcpy_#t~post2 := memcpy_~n;memcpy_~n := memcpy_#t~post2 - 1; 167#L511-1 assume !!(0 != memcpy_#t~post2 % 4294967296);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, 1 + memcpy_#t~post3.offset;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, 1 + memcpy_#t~post4.offset;call memcpy_#t~mem5 := read~int(memcpy_#t~post4.base, memcpy_#t~post4.offset, 1);call write~int(memcpy_#t~mem5, memcpy_#t~post3.base, memcpy_#t~post3.offset, 1);havoc memcpy_#t~post4.base, memcpy_#t~post4.offset;havoc memcpy_#t~post3.base, memcpy_#t~post3.offset;havoc memcpy_#t~mem5; 168#L511-3 [2018-11-23 15:24:05,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:24:05,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1270617397, now seen corresponding path program 1 times [2018-11-23 15:24:05,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:24:05,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:24:05,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:05,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:24:05,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:05,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:24:05,110 INFO L82 PathProgramCache]: Analyzing trace with hash 2214, now seen corresponding path program 2 times [2018-11-23 15:24:05,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:24:05,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:24:05,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:05,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:24:05,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:05,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:24:05,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1292607706, now seen corresponding path program 1 times [2018-11-23 15:24:05,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:24:05,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:24:05,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:05,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:24:05,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:05,461 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 120 [2018-11-23 15:24:05,548 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:24:05,548 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:24:05,548 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:24:05,548 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:24:05,549 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:24:05,549 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:24:05,549 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:24:05,549 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:24:05,549 INFO L131 ssoRankerPreferences]: Filename of dumped script: strdup_true-termination.c.i_Iteration3_Lasso [2018-11-23 15:24:05,549 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:24:05,549 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:24:05,552 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-23 15:24:05,554 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-23 15:24:05,555 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-23 15:24:05,557 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-23 15:24:05,558 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-23 15:24:05,559 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-23 15:24:05,561 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-23 15:24:05,562 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-23 15:24:05,563 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-23 15:24:05,564 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-23 15:24:05,565 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-23 15:24:05,566 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-23 15:24:05,567 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-23 15:24:05,568 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-23 15:24:05,569 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-23 15:24:05,570 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-23 15:24:05,571 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-23 15:24:05,572 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-23 15:24:05,573 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-23 15:24:05,574 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-23 15:24:05,575 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-23 15:24:05,575 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-23 15:24:05,842 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 103 [2018-11-23 15:24:05,951 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-23 15:24:05,952 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-23 15:24:05,953 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-23 15:24:06,113 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2018-11-23 15:24:06,479 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:24:06,479 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:24:06,480 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-23 15:24:06,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:06,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:06,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:06,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:06,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:06,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:06,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:06,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:06,482 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-23 15:24:06,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:06,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:06,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:06,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:06,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:06,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:06,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:06,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:06,486 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-23 15:24:06,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:06,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:06,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:06,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:06,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:06,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:06,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:06,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:06,487 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-23 15:24:06,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:06,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:06,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:06,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:06,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:06,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:06,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:06,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:06,493 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-23 15:24:06,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:06,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:06,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:06,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:06,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:06,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:06,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:06,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:06,495 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-23 15:24:06,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:06,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:06,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:06,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:06,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:24:06,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:24:06,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:06,498 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-23 15:24:06,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:06,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:06,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:06,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:06,499 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:24:06,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:24:06,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:06,505 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-23 15:24:06,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:06,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:06,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:06,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:06,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:06,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:06,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:06,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:06,507 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-23 15:24:06,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:06,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:06,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:06,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:06,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:06,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:06,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:06,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:06,509 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-23 15:24:06,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:06,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:06,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:06,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:06,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:06,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:06,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:06,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:06,510 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-23 15:24:06,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:06,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:06,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:06,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:06,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:06,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:06,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:06,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:06,512 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-23 15:24:06,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:06,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:06,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:06,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:06,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:06,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:06,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:06,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:06,514 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-23 15:24:06,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:06,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:06,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:06,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:06,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:06,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:06,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:06,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:06,516 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-23 15:24:06,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:06,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:06,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:06,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:06,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:06,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:06,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:06,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:06,517 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-23 15:24:06,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:06,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:06,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:06,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:06,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:06,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:06,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:06,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:06,519 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-23 15:24:06,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:06,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:06,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:06,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:06,520 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:24:06,520 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:24:06,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:06,522 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-23 15:24:06,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:06,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:06,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:06,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:06,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:06,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:06,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:06,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:06,524 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-23 15:24:06,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:06,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:06,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:06,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:06,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:06,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:06,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:06,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:06,525 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-23 15:24:06,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:06,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:06,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:06,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:06,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:06,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:06,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:06,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:06,527 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-23 15:24:06,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:06,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:06,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:06,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:06,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:06,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:06,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:06,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:06,529 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-23 15:24:06,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:06,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:06,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:06,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:06,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:06,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:06,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:06,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:06,530 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-23 15:24:06,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:06,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:06,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:06,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:06,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:24:06,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:24:06,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:06,537 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-23 15:24:06,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:06,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:06,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:06,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:06,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:06,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:06,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:06,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:06,539 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-23 15:24:06,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:06,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:06,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:06,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:06,546 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:24:06,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:24:06,587 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:24:06,627 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 15:24:06,627 INFO L444 ModelExtractionUtils]: 62 out of 73 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-11-23 15:24:06,627 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:24:06,628 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:24:06,629 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:24:06,629 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_memcpy_~c1~0.offset, v_rep(select #length ULTIMATE.start_strdup_#t~malloc10.base)_1) = -1*ULTIMATE.start_memcpy_~c1~0.offset + 1*v_rep(select #length ULTIMATE.start_strdup_#t~malloc10.base)_1 Supporting invariants [] [2018-11-23 15:24:06,687 INFO L297 tatePredicateManager]: 17 out of 18 supporting invariants were superfluous and have been removed [2018-11-23 15:24:06,688 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 15:24:06,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:24:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:24:06,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:24:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:24:06,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:24:06,732 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-23 15:24:06,732 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2018-11-23 15:24:06,733 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-23 15:24:06,754 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 16 states and 19 transitions. Complement of second has 5 states. [2018-11-23 15:24:06,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 15:24:06,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 15:24:06,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-23 15:24:06,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-23 15:24:06,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:24:06,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-23 15:24:06,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:24:06,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-23 15:24:06,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:24:06,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2018-11-23 15:24:06,756 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:24:06,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2018-11-23 15:24:06,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 15:24:06,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 15:24:06,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 15:24:06,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:24:06,756 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:24:06,757 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:24:06,757 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:24:06,757 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 15:24:06,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 15:24:06,757 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:24:06,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 15:24:06,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:24:06 BoogieIcfgContainer [2018-11-23 15:24:06,762 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 15:24:06,763 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:24:06,763 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:24:06,763 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:24:06,764 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:24:03" (3/4) ... [2018-11-23 15:24:06,767 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 15:24:06,767 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:24:06,768 INFO L168 Benchmark]: Toolchain (without parser) took 3751.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.2 MB). Free memory was 956.6 MB in the beginning and 913.0 MB in the end (delta: 43.5 MB). Peak memory consumption was 231.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:24:06,769 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:24:06,769 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-11-23 15:24:06,769 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.91 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:24:06,770 INFO L168 Benchmark]: Boogie Preprocessor took 17.33 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:24:06,770 INFO L168 Benchmark]: RCFGBuilder took 223.84 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: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-11-23 15:24:06,771 INFO L168 Benchmark]: BuchiAutomizer took 3134.50 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.2 MB). Free memory was 1.1 GB in the beginning and 913.0 MB in the end (delta: 190.7 MB). Peak memory consumption was 238.9 MB. Max. memory is 11.5 GB. [2018-11-23 15:24:06,771 INFO L168 Benchmark]: Witness Printer took 4.52 ms. Allocated memory is still 1.2 GB. Free memory is still 913.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:24:06,774 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 337.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.91 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.33 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 223.84 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: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3134.50 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.2 MB). Free memory was 1.1 GB in the beginning and 913.0 MB in the end (delta: 190.7 MB). Peak memory consumption was 238.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.52 ms. Allocated memory is still 1.2 GB. Free memory is still 913.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 4 locations. One deterministic module has affine ranking function -1 * c1 + unknown-#length-unknown[malloc(l)] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 41 SDtfs, 38 SDslu, 14 SDs, 0 SdLazy, 13 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital195 mio100 ax100 hnf99 lsp92 ukn94 mio100 lsp49 div115 bol100 ite100 ukn100 eq190 hnf83 smp94 dnf102 smp100 tf100 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...