./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstpncpy-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e0fac4c3-e5d7-4dec-b501-cfe61626a70d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e0fac4c3-e5d7-4dec-b501-cfe61626a70d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e0fac4c3-e5d7-4dec-b501-cfe61626a70d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e0fac4c3-e5d7-4dec-b501-cfe61626a70d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstpncpy-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e0fac4c3-e5d7-4dec-b501-cfe61626a70d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e0fac4c3-e5d7-4dec-b501-cfe61626a70d/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 1a0687c7a9248a5f8cc8ee4c8e4eeb67512aff8e ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 02:07:56,740 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 02:07:56,742 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 02:07:56,750 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 02:07:56,750 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 02:07:56,751 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 02:07:56,752 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 02:07:56,753 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 02:07:56,755 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 02:07:56,756 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 02:07:56,756 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 02:07:56,757 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 02:07:56,757 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 02:07:56,758 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 02:07:56,759 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 02:07:56,759 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 02:07:56,760 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 02:07:56,761 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 02:07:56,763 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 02:07:56,764 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 02:07:56,765 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 02:07:56,766 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 02:07:56,767 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 02:07:56,767 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 02:07:56,767 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 02:07:56,768 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 02:07:56,769 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 02:07:56,770 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 02:07:56,771 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 02:07:56,771 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 02:07:56,772 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 02:07:56,772 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 02:07:56,772 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 02:07:56,773 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 02:07:56,773 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 02:07:56,774 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 02:07:56,774 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e0fac4c3-e5d7-4dec-b501-cfe61626a70d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 02:07:56,783 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 02:07:56,783 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 02:07:56,784 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 02:07:56,784 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 02:07:56,784 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 02:07:56,784 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 02:07:56,785 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 02:07:56,785 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 02:07:56,785 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 02:07:56,785 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 02:07:56,785 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 02:07:56,785 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 02:07:56,785 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 02:07:56,786 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 02:07:56,786 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 02:07:56,786 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 02:07:56,786 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 02:07:56,786 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 02:07:56,786 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 02:07:56,786 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 02:07:56,787 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 02:07:56,787 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 02:07:56,787 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 02:07:56,787 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 02:07:56,787 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 02:07:56,787 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 02:07:56,788 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 02:07:56,788 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 02:07:56,788 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_e0fac4c3-e5d7-4dec-b501-cfe61626a70d/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 -> 1a0687c7a9248a5f8cc8ee4c8e4eeb67512aff8e [2018-11-10 02:07:56,811 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 02:07:56,820 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 02:07:56,823 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 02:07:56,824 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 02:07:56,824 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 02:07:56,824 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e0fac4c3-e5d7-4dec-b501-cfe61626a70d/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstpncpy-alloca_true-termination.c.i [2018-11-10 02:07:56,868 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e0fac4c3-e5d7-4dec-b501-cfe61626a70d/bin-2019/uautomizer/data/b8054d896/180c050e2bf24c1ea61036bf7277f906/FLAG28f83e21d [2018-11-10 02:07:57,265 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 02:07:57,265 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e0fac4c3-e5d7-4dec-b501-cfe61626a70d/sv-benchmarks/c/termination-memory-alloca/openbsd_cstpncpy-alloca_true-termination.c.i [2018-11-10 02:07:57,275 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e0fac4c3-e5d7-4dec-b501-cfe61626a70d/bin-2019/uautomizer/data/b8054d896/180c050e2bf24c1ea61036bf7277f906/FLAG28f83e21d [2018-11-10 02:07:57,287 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e0fac4c3-e5d7-4dec-b501-cfe61626a70d/bin-2019/uautomizer/data/b8054d896/180c050e2bf24c1ea61036bf7277f906 [2018-11-10 02:07:57,290 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 02:07:57,292 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 02:07:57,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 02:07:57,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 02:07:57,296 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 02:07:57,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:07:57" (1/1) ... [2018-11-10 02:07:57,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70607c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:57, skipping insertion in model container [2018-11-10 02:07:57,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:07:57" (1/1) ... [2018-11-10 02:07:57,305 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 02:07:57,337 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 02:07:57,558 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:07:57,567 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 02:07:57,604 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:07:57,642 INFO L193 MainTranslator]: Completed translation [2018-11-10 02:07:57,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:57 WrapperNode [2018-11-10 02:07:57,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 02:07:57,644 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 02:07:57,644 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 02:07:57,644 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 02:07:57,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:57" (1/1) ... [2018-11-10 02:07:57,711 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:57" (1/1) ... [2018-11-10 02:07:57,730 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 02:07:57,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 02:07:57,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 02:07:57,730 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 02:07:57,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:57" (1/1) ... [2018-11-10 02:07:57,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:57" (1/1) ... [2018-11-10 02:07:57,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:57" (1/1) ... [2018-11-10 02:07:57,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:57" (1/1) ... [2018-11-10 02:07:57,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:57" (1/1) ... [2018-11-10 02:07:57,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:57" (1/1) ... [2018-11-10 02:07:57,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:57" (1/1) ... [2018-11-10 02:07:57,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 02:07:57,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 02:07:57,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 02:07:57,751 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 02:07:57,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0fac4c3-e5d7-4dec-b501-cfe61626a70d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:07:57,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 02:07:57,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 02:07:57,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 02:07:57,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 02:07:57,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 02:07:57,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 02:07:58,130 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 02:07:58,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:07:58 BoogieIcfgContainer [2018-11-10 02:07:58,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 02:07:58,131 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 02:07:58,131 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 02:07:58,135 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 02:07:58,135 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:07:58,135 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 02:07:57" (1/3) ... [2018-11-10 02:07:58,137 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2865aa5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 02:07:58, skipping insertion in model container [2018-11-10 02:07:58,137 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:07:58,137 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:57" (2/3) ... [2018-11-10 02:07:58,138 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2865aa5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 02:07:58, skipping insertion in model container [2018-11-10 02:07:58,138 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:07:58,138 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:07:58" (3/3) ... [2018-11-10 02:07:58,140 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstpncpy-alloca_true-termination.c.i [2018-11-10 02:07:58,203 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 02:07:58,203 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 02:07:58,203 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 02:07:58,203 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 02:07:58,203 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 02:07:58,204 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 02:07:58,204 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 02:07:58,204 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 02:07:58,204 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 02:07:58,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2018-11-10 02:07:58,234 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-10 02:07:58,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:07:58,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:07:58,240 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:07:58,241 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 02:07:58,241 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 02:07:58,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2018-11-10 02:07:58,243 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-10 02:07:58,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:07:58,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:07:58,244 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:07:58,244 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 02:07:58,254 INFO L793 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 3#L568true assume !(main_~length~0 < 1); 6#L568-2true assume !(main_~n~0 < 1); 35#L571-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset; 26#L576true SUMMARY for call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L576 27#L576-1true assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst.base, cstpncpy_#in~dst.offset, cstpncpy_#in~src.base, cstpncpy_#in~src.offset, cstpncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstpncpy_#res.base, cstpncpy_#res.offset;havoc cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset, cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset, cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset, cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset, cstpncpy_#t~mem7, cstpncpy_#t~post9.base, cstpncpy_#t~post9.offset, cstpncpy_#t~pre8, cstpncpy_#t~pre4, cstpncpy_~d~0.base, cstpncpy_~d~0.offset, cstpncpy_~s~0.base, cstpncpy_~s~0.offset, cstpncpy_#t~mem10.base, cstpncpy_#t~mem10.offset, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, cstpncpy_~src.base, cstpncpy_~src.offset, cstpncpy_~n;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];cstpncpy_~#dst.base, cstpncpy_~#dst.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 21#L547true SUMMARY for call write~$Pointer$(cstpncpy_#in~dst.base, cstpncpy_#in~dst.offset, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 8); srcloc: L547 23#L547-1true cstpncpy_~src.base, cstpncpy_~src.offset := cstpncpy_#in~src.base, cstpncpy_#in~src.offset;cstpncpy_~n := cstpncpy_#in~n; 16#L550true assume cstpncpy_~n % 4294967296 != 0; 32#L551true SUMMARY for call cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset := read~$Pointer$(cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 8); srcloc: L551 34#L551-1true cstpncpy_~d~0.base, cstpncpy_~d~0.offset := cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset;havoc cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset;cstpncpy_~s~0.base, cstpncpy_~s~0.offset := cstpncpy_~src.base, cstpncpy_~src.offset; 28#L553true SUMMARY for call cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset := read~$Pointer$(cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 8); srcloc: L553 31#L553-1true SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset + cstpncpy_~n % 4294967296 * 1, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 8); srcloc: L553-1 33#L553-2true havoc cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset; 17#L554-4true [2018-11-10 02:07:58,254 INFO L795 eck$LassoCheckResult]: Loop: 17#L554-4true assume true;cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset := cstpncpy_~d~0.base, cstpncpy_~d~0.offset;cstpncpy_~d~0.base, cstpncpy_~d~0.offset := cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset + 1;cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset := cstpncpy_~s~0.base, cstpncpy_~s~0.offset;cstpncpy_~s~0.base, cstpncpy_~s~0.offset := cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset + 1; 7#L555true SUMMARY for call cstpncpy_#t~mem7 := read~int(cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset, 1); srcloc: L555 8#L555-1true SUMMARY for call write~int(cstpncpy_#t~mem7, cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset, 1); srcloc: L555-1 29#L555-2true assume !(cstpncpy_#t~mem7 == 0);havoc cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset;havoc cstpncpy_#t~mem7;havoc cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset; 11#L554-1true cstpncpy_#t~pre4 := cstpncpy_~n - 1;cstpncpy_~n := cstpncpy_~n - 1; 13#L554-2true assume !!(cstpncpy_#t~pre4 % 4294967296 != 0);havoc cstpncpy_#t~pre4; 17#L554-4true [2018-11-10 02:07:58,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:07:58,260 INFO L82 PathProgramCache]: Analyzing trace with hash -952729461, now seen corresponding path program 1 times [2018-11-10 02:07:58,262 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:07:58,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:07:58,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:07:58,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:07:58,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:07:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:07:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:07:58,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:07:58,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1805597821, now seen corresponding path program 1 times [2018-11-10 02:07:58,427 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:07:58,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:07:58,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:07:58,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:07:58,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:07:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:07:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:07:58,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:07:58,451 INFO L82 PathProgramCache]: Analyzing trace with hash 336702855, now seen corresponding path program 1 times [2018-11-10 02:07:58,452 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:07:58,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:07:58,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:07:58,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:07:58,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:07:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:07:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:07:58,646 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-10 02:07:59,356 WARN L179 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 151 [2018-11-10 02:07:59,486 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-11-10 02:07:59,496 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:07:59,498 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:07:59,498 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:07:59,498 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:07:59,498 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:07:59,498 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:07:59,499 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:07:59,499 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:07:59,499 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstpncpy-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-10 02:07:59,499 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:07:59,500 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:07:59,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:07:59,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:07:59,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:07:59,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:07:59,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:07:59,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:07:59,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:07:59,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:07:59,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-10 02:07:59,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-10 02:07:59,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-10 02:07:59,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-10 02:07:59,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-10 02:07:59,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-10 02:07:59,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-10 02:07:59,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-10 02:07:59,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-10 02:08:00,019 WARN L179 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 115 [2018-11-10 02:08:00,182 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2018-11-10 02:08:00,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:00,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:00,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:00,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:00,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-10 02:08:00,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:00,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:00,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-10 02:08:00,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:00,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:00,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:00,508 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2018-11-10 02:08:00,669 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2018-11-10 02:08:01,042 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:08:01,047 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:08:01,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:01,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:01,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:08:01,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:01,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:01,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:01,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:08:01,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:08:01,054 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:01,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:01,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:01,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:08:01,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:01,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:01,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:01,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:08:01,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:08:01,057 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:01,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:01,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:01,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:08:01,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:01,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:01,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:01,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:08:01,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:08:01,059 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:01,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:01,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:01,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:01,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:01,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:01,062 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:08:01,062 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:08:01,065 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:01,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:01,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:01,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:08:01,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:01,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:01,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:01,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:08:01,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:08:01,067 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:01,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:01,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:01,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:08:01,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:01,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:01,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:01,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:08:01,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:08:01,072 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:01,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:01,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:01,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:08:01,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:01,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:01,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:01,073 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:08:01,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:08:01,074 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:01,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:01,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:01,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:08:01,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:01,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:01,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:01,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:08:01,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:08:01,077 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:01,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:01,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:01,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:01,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:01,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:01,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:08:01,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:08:01,088 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:01,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:01,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:01,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:08:01,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:01,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:01,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:01,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:08:01,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:08:01,091 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:01,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:01,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:01,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:01,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:01,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:01,094 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:08:01,094 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:08:01,097 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:01,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:01,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:01,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:08:01,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:01,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:01,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:01,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:08:01,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:08:01,099 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:01,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:01,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:01,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:08:01,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:01,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:01,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:01,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:08:01,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:08:01,105 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:01,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:01,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:01,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:08:01,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:01,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:01,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:01,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:08:01,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:08:01,107 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:01,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:01,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:01,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:08:01,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:01,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:01,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:01,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:08:01,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:08:01,109 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:01,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:01,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:01,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:08:01,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:01,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:01,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:01,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:08:01,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:08:01,112 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:01,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:01,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:01,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:01,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:01,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:01,122 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:08:01,122 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:08:01,124 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:01,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:01,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:01,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:08:01,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:01,125 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:08:01,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:01,126 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:08:01,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:08:01,135 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:01,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:01,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:01,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:01,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:01,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:01,139 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:08:01,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:08:01,142 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:01,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:01,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:01,143 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:08:01,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:01,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:01,145 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:08:01,146 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:08:01,164 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:01,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:01,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:01,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:01,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:01,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:01,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:08:01,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:08:01,172 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:01,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:01,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:01,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:01,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:01,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:01,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:08:01,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:08:01,189 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:01,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:01,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:01,190 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:08:01,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:01,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:01,191 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:08:01,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:08:01,196 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:01,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:01,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:01,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:01,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:01,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:01,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:08:01,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:08:01,263 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:08:01,304 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 02:08:01,305 INFO L444 ModelExtractionUtils]: 65 out of 70 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 02:08:01,306 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:08:01,307 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 02:08:01,308 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:08:01,308 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstpncpy_~s~0.base)_1, ULTIMATE.start_cstpncpy_~d~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstpncpy_~s~0.base)_1 - 1*ULTIMATE.start_cstpncpy_~d~0.offset Supporting invariants [] [2018-11-10 02:08:01,370 INFO L297 tatePredicateManager]: 17 out of 18 supporting invariants were superfluous and have been removed [2018-11-10 02:08:01,377 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 02:08:01,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:08:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:01,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:08:01,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 02:08:01,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 02:08:01,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 02:08:01,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:08:01,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:08:01,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-11-10 02:08:01,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 02:08:01,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 02:08:01,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 02:08:01,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:08:01,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:08:01,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:8 [2018-11-10 02:08:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:01,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:08:01,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:08:01,671 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 3 loop predicates [2018-11-10 02:08:01,672 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 10 states. [2018-11-10 02:08:01,953 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states.. Second operand 10 states. Result 71 states and 79 transitions. Complement of second has 15 states. [2018-11-10 02:08:01,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:08:01,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 02:08:01,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 49 transitions. [2018-11-10 02:08:01,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 49 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-10 02:08:01,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:08:01,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 49 transitions. Stem has 21 letters. Loop has 6 letters. [2018-11-10 02:08:01,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:08:01,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 49 transitions. Stem has 15 letters. Loop has 12 letters. [2018-11-10 02:08:01,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:08:01,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 79 transitions. [2018-11-10 02:08:01,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 02:08:01,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 32 states and 35 transitions. [2018-11-10 02:08:01,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-10 02:08:01,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-10 02:08:01,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 35 transitions. [2018-11-10 02:08:01,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:08:01,974 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-10 02:08:01,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 35 transitions. [2018-11-10 02:08:01,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2018-11-10 02:08:01,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 02:08:01,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-10 02:08:01,995 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-10 02:08:01,995 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-10 02:08:01,996 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 02:08:01,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 32 transitions. [2018-11-10 02:08:01,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 02:08:01,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:08:01,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:08:01,997 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:08:01,997 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 02:08:01,998 INFO L793 eck$LassoCheckResult]: Stem: 325#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 310#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 299#L568 assume !(main_~length~0 < 1); 300#L568-2 assume !(main_~n~0 < 1); 304#L571-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset; 321#L576 SUMMARY for call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L576 322#L576-1 assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst.base, cstpncpy_#in~dst.offset, cstpncpy_#in~src.base, cstpncpy_#in~src.offset, cstpncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstpncpy_#res.base, cstpncpy_#res.offset;havoc cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset, cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset, cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset, cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset, cstpncpy_#t~mem7, cstpncpy_#t~post9.base, cstpncpy_#t~post9.offset, cstpncpy_#t~pre8, cstpncpy_#t~pre4, cstpncpy_~d~0.base, cstpncpy_~d~0.offset, cstpncpy_~s~0.base, cstpncpy_~s~0.offset, cstpncpy_#t~mem10.base, cstpncpy_#t~mem10.offset, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, cstpncpy_~src.base, cstpncpy_~src.offset, cstpncpy_~n;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];cstpncpy_~#dst.base, cstpncpy_~#dst.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 318#L547 SUMMARY for call write~$Pointer$(cstpncpy_#in~dst.base, cstpncpy_#in~dst.offset, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 8); srcloc: L547 319#L547-1 cstpncpy_~src.base, cstpncpy_~src.offset := cstpncpy_#in~src.base, cstpncpy_#in~src.offset;cstpncpy_~n := cstpncpy_#in~n; 315#L550 assume cstpncpy_~n % 4294967296 != 0; 316#L551 SUMMARY for call cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset := read~$Pointer$(cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 8); srcloc: L551 327#L551-1 cstpncpy_~d~0.base, cstpncpy_~d~0.offset := cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset;havoc cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset;cstpncpy_~s~0.base, cstpncpy_~s~0.offset := cstpncpy_~src.base, cstpncpy_~src.offset; 323#L553 SUMMARY for call cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset := read~$Pointer$(cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 8); srcloc: L553 324#L553-1 SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset + cstpncpy_~n % 4294967296 * 1, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 8); srcloc: L553-1 326#L553-2 havoc cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset; 314#L554-4 assume true;cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset := cstpncpy_~d~0.base, cstpncpy_~d~0.offset;cstpncpy_~d~0.base, cstpncpy_~d~0.offset := cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset + 1;cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset := cstpncpy_~s~0.base, cstpncpy_~s~0.offset;cstpncpy_~s~0.base, cstpncpy_~s~0.offset := cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset + 1; 305#L555 SUMMARY for call cstpncpy_#t~mem7 := read~int(cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset, 1); srcloc: L555 306#L555-1 SUMMARY for call write~int(cstpncpy_#t~mem7, cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset, 1); srcloc: L555-1 309#L555-2 assume cstpncpy_#t~mem7 == 0;havoc cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset;havoc cstpncpy_#t~mem7;havoc cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset; 320#L556 SUMMARY for call write~$Pointer$(cstpncpy_~d~0.base, cstpncpy_~d~0.offset - 1, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 8); srcloc: L556 307#L557-3 [2018-11-10 02:08:01,998 INFO L795 eck$LassoCheckResult]: Loop: 307#L557-3 assume true; 301#L557 cstpncpy_#t~pre8 := cstpncpy_~n - 1;cstpncpy_~n := cstpncpy_~n - 1; 302#L557-1 assume !!(cstpncpy_#t~pre8 % 4294967296 != 0);havoc cstpncpy_#t~pre8;cstpncpy_#t~post9.base, cstpncpy_#t~post9.offset := cstpncpy_~d~0.base, cstpncpy_~d~0.offset;cstpncpy_~d~0.base, cstpncpy_~d~0.offset := cstpncpy_#t~post9.base, cstpncpy_#t~post9.offset + 1; 303#L558 SUMMARY for call write~int(0, cstpncpy_#t~post9.base, cstpncpy_#t~post9.offset, 1); srcloc: L558 317#L558-1 havoc cstpncpy_#t~post9.base, cstpncpy_#t~post9.offset; 307#L557-3 [2018-11-10 02:08:01,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:08:01,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1513159882, now seen corresponding path program 1 times [2018-11-10 02:08:01,998 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:08:01,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:08:02,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:02,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:02,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:08:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:08:02,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:08:02,031 INFO L82 PathProgramCache]: Analyzing trace with hash 67822222, now seen corresponding path program 1 times [2018-11-10 02:08:02,031 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:08:02,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:08:02,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:02,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:02,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:08:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:08:02,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:08:02,042 INFO L82 PathProgramCache]: Analyzing trace with hash 546740345, now seen corresponding path program 1 times [2018-11-10 02:08:02,042 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:08:02,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:08:02,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:02,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:02,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:08:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:08:03,516 WARN L179 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 212 DAG size of output: 196 [2018-11-10 02:08:03,703 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-11-10 02:08:03,704 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:08:03,705 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:08:03,705 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:08:03,705 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:08:03,705 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:08:03,705 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:08:03,705 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:08:03,705 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:08:03,705 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstpncpy-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-10 02:08:03,705 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:08:03,705 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:08:03,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:03,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:03,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:03,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:03,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:03,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:04,210 WARN L179 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 124 [2018-11-10 02:08:04,323 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2018-11-10 02:08:04,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:04,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:04,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:04,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:04,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:04,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:04,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:04,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:04,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:04,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:04,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:04,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:04,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:04,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:04,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:04,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:04,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:04,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:04,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:04,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:04,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:04,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:04,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:04,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:08:04,648 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2018-11-10 02:08:05,119 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:08:05,119 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:08:05,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:05,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:05,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:08:05,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:05,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:05,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:05,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:08:05,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:08:05,125 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:05,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:05,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:05,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:08:05,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:05,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:05,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:05,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:08:05,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:08:05,126 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:05,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:05,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:05,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:05,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:05,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:05,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:08:05,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:08:05,130 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:05,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:05,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:05,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:08:05,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:05,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:05,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:05,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:08:05,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:08:05,132 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:05,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:05,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:05,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:08:05,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:05,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:05,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:05,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:08:05,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:08:05,133 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:05,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:05,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:05,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:05,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:05,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:05,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:08:05,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:08:05,137 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:08:05,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:08:05,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:08:05,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:08:05,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:08:05,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:08:05,143 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:08:05,143 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:08:05,183 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:08:05,227 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2018-11-10 02:08:05,227 INFO L444 ModelExtractionUtils]: 58 out of 67 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-10 02:08:05,228 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:08:05,229 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 02:08:05,229 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:08:05,229 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstpncpy_~d~0.base)_2, ULTIMATE.start_cstpncpy_~d~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstpncpy_~d~0.base)_2 - 1*ULTIMATE.start_cstpncpy_~d~0.offset Supporting invariants [] [2018-11-10 02:08:05,315 INFO L297 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2018-11-10 02:08:05,316 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 02:08:05,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:08:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:05,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:08:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:05,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:08:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:08:05,384 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 02:08:05,384 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 32 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-10 02:08:05,404 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 32 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 35 states and 39 transitions. Complement of second has 6 states. [2018-11-10 02:08:05,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:08:05,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 02:08:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2018-11-10 02:08:05,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 20 letters. Loop has 5 letters. [2018-11-10 02:08:05,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:08:05,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 25 letters. Loop has 5 letters. [2018-11-10 02:08:05,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:08:05,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 20 letters. Loop has 10 letters. [2018-11-10 02:08:05,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:08:05,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 39 transitions. [2018-11-10 02:08:05,408 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 02:08:05,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2018-11-10 02:08:05,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 02:08:05,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 02:08:05,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 02:08:05,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:08:05,411 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:08:05,411 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:08:05,411 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:08:05,411 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 02:08:05,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 02:08:05,411 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 02:08:05,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 02:08:05,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 02:08:05 BoogieIcfgContainer [2018-11-10 02:08:05,417 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 02:08:05,417 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 02:08:05,417 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 02:08:05,418 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 02:08:05,418 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:07:58" (3/4) ... [2018-11-10 02:08:05,421 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 02:08:05,421 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 02:08:05,422 INFO L168 Benchmark]: Toolchain (without parser) took 8131.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.6 MB). Free memory was 956.6 MB in the beginning and 866.1 MB in the end (delta: 90.5 MB). Peak memory consumption was 297.0 MB. Max. memory is 11.5 GB. [2018-11-10 02:08:05,423 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-10 02:08:05,424 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.76 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 02:08:05,424 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -199.6 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 02:08:05,425 INFO L168 Benchmark]: Boogie Preprocessor took 20.65 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-10 02:08:05,425 INFO L168 Benchmark]: RCFGBuilder took 379.62 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: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2018-11-10 02:08:05,426 INFO L168 Benchmark]: BuchiAutomizer took 7285.97 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 866.1 MB in the end (delta: 242.4 MB). Peak memory consumption was 311.1 MB. Max. memory is 11.5 GB. [2018-11-10 02:08:05,426 INFO L168 Benchmark]: Witness Printer took 4.14 ms. Allocated memory is still 1.2 GB. Free memory is still 866.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:08:05,429 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 350.76 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -199.6 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.65 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 379.62 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: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7285.97 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 866.1 MB in the end (delta: 242.4 MB). Peak memory consumption was 311.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.14 ms. Allocated memory is still 1.2 GB. Free memory is still 866.1 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 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * d and consists of 12 locations. One deterministic module has affine ranking function unknown-#length-unknown[d] + -1 * d and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 6.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 53 SDtfs, 86 SDslu, 83 SDs, 0 SdLazy, 59 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital291 mio100 ax106 hnf99 lsp91 ukn100 mio100 lsp49 div156 bol100 ite100 ukn100 eq179 hnf72 smp93 dnf100 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 5 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...