./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrncpy_malloc.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_da45cd1e-c214-48a9-ad14-9187e2270011/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_da45cd1e-c214-48a9-ad14-9187e2270011/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_da45cd1e-c214-48a9-ad14-9187e2270011/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_da45cd1e-c214-48a9-ad14-9187e2270011/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrncpy_malloc.i -s /tmp/vcloud-vcloud-master/worker/working_dir_da45cd1e-c214-48a9-ad14-9187e2270011/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_da45cd1e-c214-48a9-ad14-9187e2270011/bin/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 7c56c09a74d2fc3893706afbe8a4ee36044dd617 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:54:13,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:13,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:13,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:13,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:13,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:13,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:13,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:13,123 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:13,123 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:13,124 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:13,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:13,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:13,126 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:13,127 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:13,128 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:13,129 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:13,130 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:13,131 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:13,133 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:13,134 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:13,136 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:13,137 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:13,137 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:13,140 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:13,140 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:13,140 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:13,141 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:13,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:13,142 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:13,142 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:13,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:13,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:13,145 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:13,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:13,146 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:13,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:13,147 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:13,147 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:13,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:13,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:13,149 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_da45cd1e-c214-48a9-ad14-9187e2270011/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:54:13,161 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:13,161 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:13,162 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:13,163 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:13,163 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:13,163 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:54:13,163 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:54:13,163 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:54:13,163 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:54:13,164 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:54:13,164 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:54:13,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:13,164 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:54:13,164 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:13,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:13,164 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:54:13,165 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:54:13,165 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:54:13,165 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:13,165 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:54:13,165 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:13,165 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:54:13,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:13,166 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:13,166 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:54:13,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:13,166 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:13,166 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:54:13,167 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:54:13,168 INFO L138 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_da45cd1e-c214-48a9-ad14-9187e2270011/bin/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 -> 7c56c09a74d2fc3893706afbe8a4ee36044dd617 [2019-10-22 08:54:13,190 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:13,206 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:13,211 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:13,213 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:13,214 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:13,214 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_da45cd1e-c214-48a9-ad14-9187e2270011/bin/uautomizer/../../sv-benchmarks/c/termination-15/cstrncpy_malloc.i [2019-10-22 08:54:13,268 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_da45cd1e-c214-48a9-ad14-9187e2270011/bin/uautomizer/data/957d01c70/0ce1ce298d80412b93d30f00e65d38f8/FLAG451714902 [2019-10-22 08:54:13,743 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:13,744 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_da45cd1e-c214-48a9-ad14-9187e2270011/sv-benchmarks/c/termination-15/cstrncpy_malloc.i [2019-10-22 08:54:13,752 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_da45cd1e-c214-48a9-ad14-9187e2270011/bin/uautomizer/data/957d01c70/0ce1ce298d80412b93d30f00e65d38f8/FLAG451714902 [2019-10-22 08:54:13,763 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_da45cd1e-c214-48a9-ad14-9187e2270011/bin/uautomizer/data/957d01c70/0ce1ce298d80412b93d30f00e65d38f8 [2019-10-22 08:54:13,766 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:13,767 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:13,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:13,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:13,772 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:13,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:13" (1/1) ... [2019-10-22 08:54:13,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3edaafc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:13, skipping insertion in model container [2019-10-22 08:54:13,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:13" (1/1) ... [2019-10-22 08:54:13,784 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:13,813 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:14,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:14,237 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:14,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:14,327 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:14,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:14 WrapperNode [2019-10-22 08:54:14,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:14,328 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:14,328 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:14,329 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:14,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:14" (1/1) ... [2019-10-22 08:54:14,349 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:14" (1/1) ... [2019-10-22 08:54:14,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:14,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:14,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:14,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:14,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:14" (1/1) ... [2019-10-22 08:54:14,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:14" (1/1) ... [2019-10-22 08:54:14,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:14" (1/1) ... [2019-10-22 08:54:14,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:14" (1/1) ... [2019-10-22 08:54:14,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:14" (1/1) ... [2019-10-22 08:54:14,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:14" (1/1) ... [2019-10-22 08:54:14,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:14" (1/1) ... [2019-10-22 08:54:14,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:14,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:14,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:14,396 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:14,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da45cd1e-c214-48a9-ad14-9187e2270011/bin/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 [2019-10-22 08:54:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:54:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:54:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:54:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:54:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:14,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:14,842 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:14,842 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:54:14,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:14 BoogieIcfgContainer [2019-10-22 08:54:14,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:14,844 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:54:14,844 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:54:14,849 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:54:14,850 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:14,850 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:54:13" (1/3) ... [2019-10-22 08:54:14,851 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b1212e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:14, skipping insertion in model container [2019-10-22 08:54:14,851 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:14,852 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:14" (2/3) ... [2019-10-22 08:54:14,852 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b1212e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:14, skipping insertion in model container [2019-10-22 08:54:14,852 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:14,853 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:14" (3/3) ... [2019-10-22 08:54:14,854 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncpy_malloc.i [2019-10-22 08:54:14,905 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:54:14,906 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:54:14,906 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:54:14,906 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:14,906 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:14,906 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:54:14,906 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:14,907 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:54:14,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-10-22 08:54:14,951 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:54:14,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:14,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:14,960 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:14,960 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:14,960 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:54:14,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-10-22 08:54:14,962 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:54:14,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:14,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:14,964 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:14,964 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:14,973 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.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~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; 5#L385true assume !(main_~length~0 < 1); 7#L385-2true assume !(main_~n~0 < 1); 3#L388-1true call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.allocOnHeap(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.allocOnHeap(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 14#L370-2true [2019-10-22 08:54:14,973 INFO L793 eck$LassoCheckResult]: Loop: 14#L370-2true assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, 1 + cstrncpy_#t~post206.offset;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, 1 + cstrncpy_#t~post207.offset;call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1);call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); 9#L372true assume !(0 == cstrncpy_#t~mem208);havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;havoc cstrncpy_#t~mem208; 14#L370-2true [2019-10-22 08:54:14,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:14,982 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-10-22 08:54:14,994 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:14,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149299029] [2019-10-22 08:54:14,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:15,178 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:15,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:15,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2019-10-22 08:54:15,179 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:15,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930476269] [2019-10-22 08:54:15,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:15,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:15,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:15,201 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:15,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:15,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2019-10-22 08:54:15,202 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:15,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200984851] [2019-10-22 08:54:15,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:15,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:15,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:15,269 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:15,774 WARN L191 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2019-10-22 08:54:15,917 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-10-22 08:54:15,931 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:15,932 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:15,932 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:15,932 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:15,933 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:15,933 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:15,933 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:15,933 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:15,933 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_malloc.i_Iteration1_Lasso [2019-10-22 08:54:15,933 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:15,934 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:15,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,370 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-10-22 08:54:16,525 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-10-22 08:54:16,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,322 WARN L191 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 08:54:17,406 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:17,412 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:17,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:17,416 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,416 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:17,417 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,417 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,417 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,419 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:17,419 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:17,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:17,423 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,423 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:17,423 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,424 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,424 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,424 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:17,424 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:17,425 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:17,426 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,426 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:17,427 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,427 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,427 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,428 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:17,428 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:17,429 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:17,430 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,430 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,430 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,431 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,433 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:17,433 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:17,437 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:17,438 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,438 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,438 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,438 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,440 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:17,440 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:17,444 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:17,445 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,445 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:17,446 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,446 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,446 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,446 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:17,446 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:17,448 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:17,449 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,449 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:17,449 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,449 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,449 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,450 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:17,450 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:17,451 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:17,452 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,452 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:17,453 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,453 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,453 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,453 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:17,453 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:17,455 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:17,456 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,457 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:17,457 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,457 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,457 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,458 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:17,458 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:17,458 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:17,460 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,460 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:17,460 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,460 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,460 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,461 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:17,461 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:17,462 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:17,463 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,464 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:17,464 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,464 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,464 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,464 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:17,465 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:17,465 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:17,467 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,467 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:17,467 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,467 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,468 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,468 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:17,468 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:17,469 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:17,470 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,471 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:17,471 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,471 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,471 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,472 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:17,472 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:17,473 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:17,474 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,475 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:17,475 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,475 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,475 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,476 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:17,476 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:17,477 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:17,478 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,478 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:17,478 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,478 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,479 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,479 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:17,480 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:17,481 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:17,482 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,482 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:17,482 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,482 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,482 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,483 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:17,483 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:17,484 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:17,485 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,485 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:17,485 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,486 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,486 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,486 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:17,486 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:17,488 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:17,489 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,489 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:17,489 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,489 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,490 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,490 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:17,490 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:17,492 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:17,493 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,493 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,493 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,493 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,500 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:17,501 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:17,577 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:17,618 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:54:17,618 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:54:17,621 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:17,622 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:17,623 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:17,624 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~n) = 1*ULTIMATE.start_cstrncpy_~n Supporting invariants [] [2019-10-22 08:54:17,680 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2019-10-22 08:54:17,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:17,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:17,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:17,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:17,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:17,827 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:54:17,828 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2019-10-22 08:54:17,875 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 5 states. [2019-10-22 08:54:17,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:17,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:17,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-10-22 08:54:17,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:54:17,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:17,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:54:17,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:17,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 08:54:17,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:17,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-10-22 08:54:17,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:54:17,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 11 states and 14 transitions. [2019-10-22 08:54:17,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 08:54:17,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 08:54:17,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-10-22 08:54:17,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:17,896 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-10-22 08:54:17,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-10-22 08:54:17,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-10-22 08:54:17,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-10-22 08:54:17,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-10-22 08:54:17,922 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-10-22 08:54:17,922 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-10-22 08:54:17,922 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:54:17,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-10-22 08:54:17,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:54:17,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:17,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:17,923 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:17,924 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:17,924 INFO L791 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 144#L-1 havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.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~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; 145#L385 assume !(main_~length~0 < 1); 150#L385-2 assume !(main_~n~0 < 1); 148#L388-1 call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.allocOnHeap(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.allocOnHeap(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 149#L370-2 assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, 1 + cstrncpy_#t~post206.offset;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, 1 + cstrncpy_#t~post207.offset;call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1);call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); 141#L372 assume 0 == cstrncpy_#t~mem208;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;havoc cstrncpy_#t~mem208;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 143#L375-3 [2019-10-22 08:54:17,924 INFO L793 eck$LassoCheckResult]: Loop: 143#L375-3 cstrncpy_#t~post209 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post209 - 1; 146#L375-1 assume !!(0 != cstrncpy_#t~post209);havoc cstrncpy_#t~post209;cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset := cstrncpy_~us~0.base, cstrncpy_~us~0.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_#t~post210.base, 1 + cstrncpy_#t~post210.offset;call write~int(0, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, 1);havoc cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset; 143#L375-3 [2019-10-22 08:54:17,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:17,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2019-10-22 08:54:17,925 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:17,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602038127] [2019-10-22 08:54:17,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:17,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:17,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:17,988 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:17,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:17,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2019-10-22 08:54:17,989 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:17,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844853223] [2019-10-22 08:54:17,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:17,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:17,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:17,999 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:17,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:17,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2019-10-22 08:54:18,000 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:18,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282089315] [2019-10-22 08:54:18,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:18,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:18,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:18,079 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:18,655 WARN L191 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 127 [2019-10-22 08:54:18,781 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-10-22 08:54:18,799 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:18,799 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:18,799 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:18,800 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:18,800 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:18,800 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:18,800 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:18,800 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:18,800 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_malloc.i_Iteration2_Lasso [2019-10-22 08:54:18,800 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:18,800 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:18,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:19,129 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 87 [2019-10-22 08:54:19,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:19,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:19,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:19,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:19,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:19,787 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-10-22 08:54:19,952 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:19,953 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:19,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,954 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,954 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:19,954 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,954 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,954 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,956 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:19,956 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:19,957 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,958 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,958 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:19,958 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,958 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,958 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,959 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:19,959 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:19,963 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,964 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,964 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:19,965 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,965 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,965 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,965 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:19,965 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:19,966 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,967 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,967 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:19,968 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,968 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,969 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,969 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:19,969 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:19,969 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,970 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,970 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,970 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,970 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,971 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:19,971 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:19,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,973 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,973 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:19,973 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,973 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,973 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,974 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:19,974 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:19,974 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,975 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,977 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:19,977 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,977 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,978 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,978 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:19,978 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:19,979 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,980 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,980 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:19,980 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,980 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,980 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,981 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:19,981 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:19,981 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,982 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,982 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,982 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,982 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,986 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:19,986 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:19,988 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,989 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,989 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:19,989 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,989 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,989 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,989 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:19,989 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:19,990 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,991 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,998 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:19,999 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,999 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,999 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,999 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:19,999 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:20,000 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:20,001 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,001 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:20,001 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,001 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,002 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,002 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:20,002 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:20,002 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:20,007 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,007 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:20,007 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,007 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,007 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,008 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:20,008 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:20,008 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:20,009 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,009 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:20,010 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,010 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,010 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,010 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:20,010 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:20,016 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:20,017 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,017 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:54:20,017 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,017 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,023 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:54:20,023 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:20,074 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:20,075 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,075 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,075 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,076 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,077 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:20,077 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:20,079 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:20,080 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,080 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,080 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,080 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,081 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:20,081 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:20,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:20,084 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,084 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,084 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,084 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,085 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:20,085 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:20,086 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:20,088 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,088 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,088 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,088 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,089 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:20,089 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:20,091 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:20,092 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,092 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:20,092 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,092 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,092 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,093 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:20,093 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:20,093 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:20,094 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,094 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,095 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,095 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,096 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:20,096 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:20,102 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:20,103 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,107 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,108 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:20,108 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,125 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-10-22 08:54:20,125 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 08:54:20,479 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:20,844 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-10-22 08:54:20,845 INFO L444 ModelExtractionUtils]: 78 out of 91 variables were initially zero. Simplification set additionally 10 variables to zero. [2019-10-22 08:54:20,845 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:20,847 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-10-22 08:54:20,848 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:20,848 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~us~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_2) = -1*ULTIMATE.start_cstrncpy_~us~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_2 Supporting invariants [] [2019-10-22 08:54:20,887 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2019-10-22 08:54:20,892 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:54:20,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:20,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 08:54:20,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:20,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:54:20,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:20,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:20,959 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-10-22 08:54:20,959 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-10-22 08:54:20,990 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 12 states and 16 transitions. Complement of second has 5 states. [2019-10-22 08:54:20,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:20,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:54:20,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-10-22 08:54:20,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:54:20,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:20,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 08:54:20,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:20,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2019-10-22 08:54:20,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:20,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2019-10-22 08:54:20,994 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:20,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2019-10-22 08:54:20,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:54:20,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:54:20,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:54:20,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:20,994 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:20,994 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:20,994 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:20,994 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:54:20,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:54:20,995 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:20,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:54:21,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:54:21 BoogieIcfgContainer [2019-10-22 08:54:21,011 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:54:21,011 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:54:21,011 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:54:21,011 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:54:21,012 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:14" (3/4) ... [2019-10-22 08:54:21,015 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:54:21,016 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:54:21,017 INFO L168 Benchmark]: Toolchain (without parser) took 7250.17 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 334.5 MB). Free memory was 940.5 MB in the beginning and 934.7 MB in the end (delta: 5.7 MB). Peak memory consumption was 340.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:21,017 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:21,019 INFO L168 Benchmark]: CACSL2BoogieTranslator took 560.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -207.2 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:21,019 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.36 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:21,020 INFO L168 Benchmark]: Boogie Preprocessor took 24.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:21,020 INFO L168 Benchmark]: RCFGBuilder took 447.86 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: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:21,021 INFO L168 Benchmark]: BuchiAutomizer took 6166.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 163.1 MB). Free memory was 1.1 GB in the beginning and 934.7 MB in the end (delta: 184.9 MB). Peak memory consumption was 348.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:21,021 INFO L168 Benchmark]: Witness Printer took 4.72 ms. Allocated memory is still 1.4 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:21,024 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 560.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -207.2 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.36 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 447.86 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: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6166.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 163.1 MB). Free memory was 1.1 GB in the beginning and 934.7 MB in the end (delta: 184.9 MB). Peak memory consumption was 348.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.72 ms. Allocated memory is still 1.4 GB. Free memory is still 934.7 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 * 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 n and consists of 4 locations. One deterministic module has affine ranking function -1 * us + unknown-#length-unknown[malloc(n * sizeof(char))] and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 5.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 24 SDtfs, 24 SDslu, 14 SDs, 0 SdLazy, 9 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital233 mio100 ax100 hnf99 lsp97 ukn86 mio100 lsp40 div100 bol100 ite100 ukn100 eq199 hnf89 smp100 dnf223 smp97 tf100 neg97 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 745ms VariablesStem: 17 VariablesLoop: 11 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...