./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrcmp_diffterm_alloca.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_a11f7549-7780-447a-884d-77116b0ff53f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a11f7549-7780-447a-884d-77116b0ff53f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a11f7549-7780-447a-884d-77116b0ff53f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a11f7549-7780-447a-884d-77116b0ff53f/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcmp_diffterm_alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a11f7549-7780-447a-884d-77116b0ff53f/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a11f7549-7780-447a-884d-77116b0ff53f/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 88fe3ea55db85ac6b3c7cedd013ffb32927ae976 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:53,262 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:53,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:53,275 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:53,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:53,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:53,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:53,280 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:53,283 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:53,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:53,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:53,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:53,293 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:53,295 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:53,296 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:53,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:53,297 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:53,300 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:53,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:53,303 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:53,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:53,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:53,305 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:53,310 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:53,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:53,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:53,312 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:53,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:53,313 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:53,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:53,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:53,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:53,318 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:53,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:53,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:53,321 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:53,321 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:53,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:53,322 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:53,323 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:53,323 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:53,324 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a11f7549-7780-447a-884d-77116b0ff53f/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:54:53,340 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:53,341 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:53,342 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:53,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:53,342 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:53,343 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:54:53,343 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:54:53,343 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:54:53,343 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:54:53,343 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:54:53,343 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:54:53,343 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:53,343 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:54:53,344 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:53,344 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:53,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:54:53,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:54:53,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:54:53,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:53,344 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:54:53,345 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:53,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:54:53,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:53,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:53,345 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:54:53,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:53,345 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:53,350 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:54:53,351 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:54:53,351 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_a11f7549-7780-447a-884d-77116b0ff53f/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 -> 88fe3ea55db85ac6b3c7cedd013ffb32927ae976 [2019-10-22 08:54:53,375 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:53,386 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:53,389 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:53,393 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:53,393 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:53,394 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a11f7549-7780-447a-884d-77116b0ff53f/bin/uautomizer/../../sv-benchmarks/c/termination-15/cstrcmp_diffterm_alloca.i [2019-10-22 08:54:53,441 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a11f7549-7780-447a-884d-77116b0ff53f/bin/uautomizer/data/eda286a50/7c5c9a83b7a749a18f38d2f884c01f4c/FLAGb14c7f703 [2019-10-22 08:54:53,879 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:53,880 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a11f7549-7780-447a-884d-77116b0ff53f/sv-benchmarks/c/termination-15/cstrcmp_diffterm_alloca.i [2019-10-22 08:54:53,889 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a11f7549-7780-447a-884d-77116b0ff53f/bin/uautomizer/data/eda286a50/7c5c9a83b7a749a18f38d2f884c01f4c/FLAGb14c7f703 [2019-10-22 08:54:53,902 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a11f7549-7780-447a-884d-77116b0ff53f/bin/uautomizer/data/eda286a50/7c5c9a83b7a749a18f38d2f884c01f4c [2019-10-22 08:54:53,904 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:53,905 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:53,906 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:53,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:53,910 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:53,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:53" (1/1) ... [2019-10-22 08:54:53,914 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e07f7a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:53, skipping insertion in model container [2019-10-22 08:54:53,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:53" (1/1) ... [2019-10-22 08:54:53,921 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:53,955 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:54,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:54,354 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:54,390 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:54,448 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:54,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:54 WrapperNode [2019-10-22 08:54:54,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:54,450 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:54,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:54,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:54,458 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:54" (1/1) ... [2019-10-22 08:54:54,472 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:54" (1/1) ... [2019-10-22 08:54:54,491 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:54,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:54,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:54,492 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:54,499 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:54" (1/1) ... [2019-10-22 08:54:54,499 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:54" (1/1) ... [2019-10-22 08:54:54,501 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:54" (1/1) ... [2019-10-22 08:54:54,501 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:54" (1/1) ... [2019-10-22 08:54:54,506 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:54" (1/1) ... [2019-10-22 08:54:54,510 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:54" (1/1) ... [2019-10-22 08:54:54,511 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:54" (1/1) ... [2019-10-22 08:54:54,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:54,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:54,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:54,514 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:54,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a11f7549-7780-447a-884d-77116b0ff53f/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:54,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:54:54,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:54:54,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:54:54,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:54:54,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:54,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:54,837 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:54,838 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:54:54,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:54 BoogieIcfgContainer [2019-10-22 08:54:54,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:54,840 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:54:54,840 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:54:54,843 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:54:54,844 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:54,844 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:54:53" (1/3) ... [2019-10-22 08:54:54,845 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a05cfba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:54, skipping insertion in model container [2019-10-22 08:54:54,846 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:54,846 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:54" (2/3) ... [2019-10-22 08:54:54,846 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a05cfba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:54, skipping insertion in model container [2019-10-22 08:54:54,854 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:54,854 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:54" (3/3) ... [2019-10-22 08:54:54,855 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrcmp_diffterm_alloca.i [2019-10-22 08:54:54,917 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:54:54,918 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:54:54,919 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:54:54,919 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:54,919 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:54,920 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:54:54,920 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:54,920 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:54:54,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 08:54:54,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:54:54,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:54,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:54,956 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:54,957 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:54:54,957 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:54:54,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 08:54:54,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:54:54,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:54,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:54,958 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:54,959 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:54:54,964 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~length2~0 := main_#t~nondet215;havoc main_#t~nondet215; 17#L378true assume !(main_~length1~0 < 1); 5#L378-2true assume !(main_~length2~0 < 1); 14#L381-1true call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset, cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset, cstrcmp_#t~mem205, cstrcmp_#t~mem206, cstrcmp_#t~mem207, cstrcmp_#t~short208, cstrcmp_#t~mem211, cstrcmp_#t~mem212, cstrcmp_#t~ite213, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 8#L367-5true [2019-10-22 08:54:54,964 INFO L793 eck$LassoCheckResult]: Loop: 8#L367-5true call cstrcmp_#t~mem205 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short208 := 49 != cstrcmp_#t~mem205; 4#L367-1true assume cstrcmp_#t~short208;call cstrcmp_#t~mem206 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem207 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short208 := cstrcmp_#t~mem206 == cstrcmp_#t~mem207; 6#L367-3true assume !!cstrcmp_#t~short208;havoc cstrcmp_#t~mem205;havoc cstrcmp_#t~mem207;havoc cstrcmp_#t~mem206;havoc cstrcmp_#t~short208;cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post209.base, 1 + cstrcmp_#t~post209.offset;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset;cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post210.base, 1 + cstrcmp_#t~post210.offset;havoc cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset; 8#L367-5true [2019-10-22 08:54:54,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:54,970 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-10-22 08:54:54,978 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:54,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974714723] [2019-10-22 08:54:54,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:55,106 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:55,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:55,107 INFO L82 PathProgramCache]: Analyzing trace with hash 49755, now seen corresponding path program 1 times [2019-10-22 08:54:55,107 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:55,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707808248] [2019-10-22 08:54:55,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:55,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:55,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:55,129 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:55,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:55,131 INFO L82 PathProgramCache]: Analyzing trace with hash 180429558, now seen corresponding path program 1 times [2019-10-22 08:54:55,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:55,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139593867] [2019-10-22 08:54:55,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:55,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:55,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:55,205 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:55,349 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-10-22 08:54:55,692 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-10-22 08:54:55,803 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-10-22 08:54:55,813 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:55,814 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:55,814 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:55,814 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:55,814 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:55,815 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:55,815 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:55,815 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:55,815 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcmp_diffterm_alloca.i_Iteration1_Lasso [2019-10-22 08:54:55,815 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:55,815 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:55,834 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:55,840 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:55,842 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:55,844 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:55,851 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:55,855 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:55,861 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:55,863 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:55,866 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:55,869 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:55,870 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:55,872 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:55,874 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:55,876 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:55,878 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:55,879 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:55,881 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:55,883 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:55,885 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:55,887 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:56,181 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-10-22 08:54:56,314 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-10-22 08:54:56,314 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:56,912 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-10-22 08:54:57,045 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:57,050 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:57,052 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:57,053 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,053 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:57,053 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,054 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,054 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,056 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:57,056 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:57,058 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,058 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:57,059 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,059 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:57,059 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,059 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,059 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,060 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:57,060 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:57,061 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,061 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:57,062 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,062 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:57,062 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,063 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,063 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,063 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:57,063 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:57,064 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,064 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:57,065 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,065 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,065 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,066 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,068 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:57,069 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:57,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,072 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:57,073 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,073 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:57,073 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,073 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,073 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,074 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:57,074 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:57,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,075 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:57,075 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,076 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:57,076 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,076 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,076 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,076 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:57,077 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:57,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,078 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:57,078 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,079 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:57,079 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,079 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,079 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,079 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:57,080 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:57,080 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,081 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:57,081 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,082 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,082 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,082 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,083 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:57,083 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:57,086 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,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:57,087 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,087 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:57,088 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,088 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,088 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,088 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:57,088 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:57,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,089 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:57,090 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,090 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:57,090 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,090 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,090 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,091 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:57,091 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:57,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,092 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:57,093 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,093 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:57,093 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,093 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,093 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,094 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:57,094 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:57,095 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,095 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:57,096 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,096 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:57,096 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,096 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,096 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,097 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:57,097 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:57,097 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,098 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:57,098 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,099 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:57,099 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,099 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,099 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,099 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:57,100 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:57,100 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,101 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:57,101 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,101 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:57,102 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,102 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,102 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,102 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:57,102 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:57,104 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,104 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:57,105 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,105 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:57,105 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,105 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,105 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,106 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:57,106 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:57,107 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,108 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:57,108 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,109 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:57,109 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,109 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,109 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,109 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:57,110 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:57,110 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,111 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:57,111 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,111 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:57,112 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,112 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,112 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,112 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:57,112 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:57,113 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,113 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:57,114 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,114 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:57,114 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,114 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,115 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,115 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:57,115 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:57,116 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,117 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:57,117 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,117 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:57,118 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,118 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,118 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,118 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:57,118 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:57,119 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,120 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:57,120 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,120 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,120 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,121 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,123 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:57,123 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:57,136 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,136 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:57,137 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,137 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,137 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,137 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,139 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:57,139 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:57,142 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,142 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:57,143 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,143 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:57,143 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,143 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:57,143 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,144 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:57,144 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:57,146 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,146 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:57,147 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,147 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:54:57,147 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,147 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,154 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:54:57,155 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:57,224 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,225 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:57,225 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,226 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,226 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,226 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,228 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:57,228 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:57,247 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,247 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:57,248 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,248 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,248 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,248 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,249 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:57,249 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:57,252 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,253 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:57,253 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,253 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,259 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,259 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,260 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:57,260 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:57,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,264 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:57,264 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,265 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,265 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,265 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,272 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:57,272 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:57,360 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:57,453 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:54:57,453 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:54:57,458 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:57,459 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:57,460 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:57,460 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcmp_~s2.offset, v_rep(select #length ULTIMATE.start_cstrcmp_~s2.base)_1) = -1*ULTIMATE.start_cstrcmp_~s2.offset + 1*v_rep(select #length ULTIMATE.start_cstrcmp_~s2.base)_1 Supporting invariants [] [2019-10-22 08:54:57,511 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-10-22 08:54:57,519 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:54:57,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:57,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:57,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:57,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:54:57,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:57,599 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:57,615 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:57,616 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 4 states. [2019-10-22 08:54:57,672 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 4 states. Result 39 states and 52 transitions. Complement of second has 7 states. [2019-10-22 08:54:57,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:57,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:54:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2019-10-22 08:54:57,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 5 letters. Loop has 3 letters. [2019-10-22 08:54:57,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:57,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 8 letters. Loop has 3 letters. [2019-10-22 08:54:57,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:57,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 5 letters. Loop has 6 letters. [2019-10-22 08:54:57,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:57,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 52 transitions. [2019-10-22 08:54:57,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:54:57,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 15 states and 20 transitions. [2019-10-22 08:54:57,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:54:57,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:54:57,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-10-22 08:54:57,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:57,699 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 08:54:57,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-10-22 08:54:57,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-10-22 08:54:57,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 08:54:57,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-10-22 08:54:57,727 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-10-22 08:54:57,727 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-10-22 08:54:57,727 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:54:57,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-10-22 08:54:57,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:54:57,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:57,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:57,728 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:54:57,729 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:54:57,729 INFO L791 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 169#L-1 havoc main_#res;havoc main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~length2~0 := main_#t~nondet215;havoc main_#t~nondet215; 170#L378 assume !(main_~length1~0 < 1); 177#L378-2 assume !(main_~length2~0 < 1); 178#L381-1 call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset, cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset, cstrcmp_#t~mem205, cstrcmp_#t~mem206, cstrcmp_#t~mem207, cstrcmp_#t~short208, cstrcmp_#t~mem211, cstrcmp_#t~mem212, cstrcmp_#t~ite213, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 181#L367-5 call cstrcmp_#t~mem205 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short208 := 49 != cstrcmp_#t~mem205; 171#L367-1 [2019-10-22 08:54:57,729 INFO L793 eck$LassoCheckResult]: Loop: 171#L367-1 assume !cstrcmp_#t~short208; 172#L367-3 assume !!cstrcmp_#t~short208;havoc cstrcmp_#t~mem205;havoc cstrcmp_#t~mem207;havoc cstrcmp_#t~mem206;havoc cstrcmp_#t~short208;cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post209.base, 1 + cstrcmp_#t~post209.offset;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset;cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post210.base, 1 + cstrcmp_#t~post210.offset;havoc cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset; 179#L367-5 call cstrcmp_#t~mem205 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short208 := 49 != cstrcmp_#t~mem205; 171#L367-1 [2019-10-22 08:54:57,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:57,729 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 1 times [2019-10-22 08:54:57,729 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:57,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631606415] [2019-10-22 08:54:57,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:57,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:57,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:57,784 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:57,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:57,787 INFO L82 PathProgramCache]: Analyzing trace with hash 54797, now seen corresponding path program 1 times [2019-10-22 08:54:57,787 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:57,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334971025] [2019-10-22 08:54:57,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:57,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:57,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:57,809 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:57,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334971025] [2019-10-22 08:54:57,810 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:57,811 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:57,811 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721691438] [2019-10-22 08:54:57,813 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:54:57,813 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:57,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:57,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:57,817 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-10-22 08:54:57,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:57,830 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2019-10-22 08:54:57,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:57,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 15 transitions. [2019-10-22 08:54:57,831 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:57,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2019-10-22 08:54:57,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:54:57,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:54:57,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:54:57,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:57,832 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:57,832 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:57,832 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:57,832 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:54:57,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:54:57,832 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:57,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:54:57,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:54:57 BoogieIcfgContainer [2019-10-22 08:54:57,838 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:54:57,839 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:54:57,839 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:54:57,839 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:54:57,840 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:54" (3/4) ... [2019-10-22 08:54:57,846 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:54:57,846 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:54:57,847 INFO L168 Benchmark]: Toolchain (without parser) took 3942.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 941.7 MB in the beginning and 921.8 MB in the end (delta: 20.0 MB). Peak memory consumption was 170.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:57,847 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 959.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:57,848 INFO L168 Benchmark]: CACSL2BoogieTranslator took 542.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:57,848 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.93 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:57,849 INFO L168 Benchmark]: Boogie Preprocessor took 21.50 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:57,849 INFO L168 Benchmark]: RCFGBuilder took 325.63 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: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:57,850 INFO L168 Benchmark]: BuchiAutomizer took 2998.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 921.8 MB in the end (delta: 177.4 MB). Peak memory consumption was 177.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:57,851 INFO L168 Benchmark]: Witness Printer took 7.23 ms. Allocated memory is still 1.2 GB. Free memory is still 921.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:57,853 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 959.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 542.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.93 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.50 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 325.63 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: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2998.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 921.8 MB in the end (delta: 177.4 MB). Peak memory consumption was 177.4 MB. Max. memory is 11.5 GB. * Witness Printer took 7.23 ms. Allocated memory is still 1.2 GB. Free memory is still 921.8 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 (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s2 + unknown-#length-unknown[s2] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. 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 14 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 26 SDtfs, 17 SDslu, 16 SDs, 0 SdLazy, 14 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital214 mio100 ax100 hnf99 lsp97 ukn85 mio100 lsp46 div100 bol100 ite100 ukn100 eq195 hnf88 smp100 dnf171 smp97 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 78ms VariablesStem: 9 VariablesLoop: 8 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...