./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/run_dir_7c63ab92-2212-4ca5-a880-ee9523bc249d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7c63ab92-2212-4ca5-a880-ee9523bc249d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7c63ab92-2212-4ca5-a880-ee9523bc249d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7c63ab92-2212-4ca5-a880-ee9523bc249d/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-3-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7c63ab92-2212-4ca5-a880-ee9523bc249d/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7c63ab92-2212-4ca5-a880-ee9523bc249d/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 32bit --witnessprinter.graph.data.programhash 2187ad12904216f135de1d4e0a00e45b56b4da69 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:20:07,819 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:20:07,820 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:20:07,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:20:07,835 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:20:07,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:20:07,838 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:20:07,846 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:20:07,851 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:20:07,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:20:07,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:20:07,858 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:20:07,858 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:20:07,860 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:20:07,861 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:20:07,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:20:07,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:20:07,863 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:20:07,865 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:20:07,868 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:20:07,871 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:20:07,873 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:20:07,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:20:07,875 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:20:07,878 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:20:07,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:20:07,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:20:07,880 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:20:07,880 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:20:07,881 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:20:07,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:20:07,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:20:07,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:20:07,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:20:07,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:20:07,885 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:20:07,885 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:20:07,886 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:20:07,886 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:20:07,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:20:07,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:20:07,888 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7c63ab92-2212-4ca5-a880-ee9523bc249d/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-16 00:20:07,913 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:20:07,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:20:07,914 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:20:07,914 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:20:07,914 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:20:07,914 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:20:07,915 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:20:07,915 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:20:07,915 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:20:07,915 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:20:07,915 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:20:07,916 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:20:07,916 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:20:07,916 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:20:07,916 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:20:07,916 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:20:07,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:20:07,917 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:20:07,917 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:20:07,917 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:20:07,917 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:20:07,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:20:07,918 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:20:07,918 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:20:07,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:20:07,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:20:07,919 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:20:07,919 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:20:07,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:20:07,919 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:20:07,919 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:20:07,920 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:20:07,921 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/run_dir_7c63ab92-2212-4ca5-a880-ee9523bc249d/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2187ad12904216f135de1d4e0a00e45b56b4da69 [2019-11-16 00:20:07,943 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:20:07,953 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:20:07,956 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:20:07,958 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:20:07,958 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:20:07,959 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7c63ab92-2212-4ca5-a880-ee9523bc249d/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-3-1.i [2019-11-16 00:20:08,011 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7c63ab92-2212-4ca5-a880-ee9523bc249d/bin/uautomizer/data/31223a8dc/0eb9f16fe9ff4c89a19a4449a53882b2/FLAG8c2fdde25 [2019-11-16 00:20:08,371 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:20:08,372 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7c63ab92-2212-4ca5-a880-ee9523bc249d/sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-3-1.i [2019-11-16 00:20:08,378 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7c63ab92-2212-4ca5-a880-ee9523bc249d/bin/uautomizer/data/31223a8dc/0eb9f16fe9ff4c89a19a4449a53882b2/FLAG8c2fdde25 [2019-11-16 00:20:08,806 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7c63ab92-2212-4ca5-a880-ee9523bc249d/bin/uautomizer/data/31223a8dc/0eb9f16fe9ff4c89a19a4449a53882b2 [2019-11-16 00:20:08,808 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:20:08,810 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:20:08,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:20:08,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:20:08,818 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:20:08,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:20:08" (1/1) ... [2019-11-16 00:20:08,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b053f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:08, skipping insertion in model container [2019-11-16 00:20:08,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:20:08" (1/1) ... [2019-11-16 00:20:08,830 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:20:08,846 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:20:09,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:20:09,061 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:20:09,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:20:09,097 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:20:09,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:09 WrapperNode [2019-11-16 00:20:09,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:20:09,101 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:20:09,101 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:20:09,101 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:20:09,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:09" (1/1) ... [2019-11-16 00:20:09,118 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:09" (1/1) ... [2019-11-16 00:20:09,139 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:20:09,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:20:09,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:20:09,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:20:09,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:09" (1/1) ... [2019-11-16 00:20:09,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:09" (1/1) ... [2019-11-16 00:20:09,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:09" (1/1) ... [2019-11-16 00:20:09,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:09" (1/1) ... [2019-11-16 00:20:09,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:09" (1/1) ... [2019-11-16 00:20:09,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:09" (1/1) ... [2019-11-16 00:20:09,166 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:09" (1/1) ... [2019-11-16 00:20:09,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:20:09,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:20:09,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:20:09,170 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:20:09,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c63ab92-2212-4ca5-a880-ee9523bc249d/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-11-16 00:20:09,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-16 00:20:09,245 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-16 00:20:09,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-16 00:20:09,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-11-16 00:20:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:20:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:20:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-11-16 00:20:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:20:09,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:20:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:20:09,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:20:09,569 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:20:09,596 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:20:09,602 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-16 00:20:09,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:20:09 BoogieIcfgContainer [2019-11-16 00:20:09,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:20:09,603 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:20:09,603 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:20:09,611 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:20:09,613 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:20:09,613 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:20:08" (1/3) ... [2019-11-16 00:20:09,614 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b3934f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:20:09, skipping insertion in model container [2019-11-16 00:20:09,615 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:20:09,615 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:09" (2/3) ... [2019-11-16 00:20:09,615 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b3934f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:20:09, skipping insertion in model container [2019-11-16 00:20:09,615 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:20:09,616 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:20:09" (3/3) ... [2019-11-16 00:20:09,618 INFO L371 chiAutomizerObserver]: Analyzing ICFG test-bitfields-3-1.i [2019-11-16 00:20:09,681 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:20:09,682 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:20:09,682 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:20:09,682 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:20:09,682 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:20:09,682 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:20:09,682 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:20:09,683 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:20:09,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-11-16 00:20:09,734 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-11-16 00:20:09,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:20:09,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:20:09,740 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:20:09,741 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-16 00:20:09,741 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:20:09,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-11-16 00:20:09,748 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-11-16 00:20:09,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:20:09,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:20:09,749 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:20:09,749 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-16 00:20:09,757 INFO L791 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(10);call write~init~int(0, ~#d~0.base, ~#d~0.offset, 1);call write~init~int(3, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 4 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 5 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 6 + ~#d~0.offset, 4); 10#L-1true havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset, main_#t~mem2, main_#t~mem3, main_#t~mem4, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_~p~0.base, main_~p~0.offset;havoc main_~p~0.base, main_~p~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(10);main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 24#L41true call main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset := #Ultimate.C_memcpy(main_~p~0.base, main_~p~0.offset, ~#d~0.base, ~#d~0.offset, 10);< 14##Ultimate.C_memcpyENTRYtrue assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 5#$Ultimate##0true #t~loopctr13 := 0; 25#L-1-1true [2019-11-16 00:20:09,757 INFO L793 eck$LassoCheckResult]: Loop: 25#L-1-1true assume #t~loopctr13 < size;call #t~mem14 := read~unchecked~int(src.base, src.offset + #t~loopctr13, 1);call write~unchecked~int(#t~mem14, dest.base, dest.offset + #t~loopctr13, 1);call #t~mem15 := read~unchecked~int(src.base, src.offset + #t~loopctr13, 4);call write~unchecked~int(#t~mem15, dest.base, dest.offset + #t~loopctr13, 4);#t~loopctr13 := 1 + #t~loopctr13; 25#L-1-1true [2019-11-16 00:20:09,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:09,762 INFO L82 PathProgramCache]: Analyzing trace with hash 28780603, now seen corresponding path program 1 times [2019-11-16 00:20:09,770 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:09,771 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815385033] [2019-11-16 00:20:09,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:09,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:09,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:20:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:20:09,937 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:20:09,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:09,939 INFO L82 PathProgramCache]: Analyzing trace with hash 114, now seen corresponding path program 1 times [2019-11-16 00:20:09,940 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:09,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448223630] [2019-11-16 00:20:09,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:09,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:09,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:20:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:20:09,975 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:20:09,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:09,977 INFO L82 PathProgramCache]: Analyzing trace with hash 892198776, now seen corresponding path program 1 times [2019-11-16 00:20:09,977 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:09,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426702439] [2019-11-16 00:20:09,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:09,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:09,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:20:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:20:10,033 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:20:10,401 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-16 00:20:10,541 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-16 00:20:10,893 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2019-11-16 00:20:11,006 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-16 00:20:11,017 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:20:11,020 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:20:11,020 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:20:11,020 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:20:11,020 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:20:11,020 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:20:11,020 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:20:11,021 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:20:11,021 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-3-1.i_Iteration1_Lasso [2019-11-16 00:20:11,021 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:20:11,021 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:20:11,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:11,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:11,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:11,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:11,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:11,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:11,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:11,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:11,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:11,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:11,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:11,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:11,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:11,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:11,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:11,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:11,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:11,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:11,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:11,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:11,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:11,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:11,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:11,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:11,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:11,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:11,614 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-11-16 00:20:11,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:12,286 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:20:12,291 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:20:12,293 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-11-16 00:20:12,294 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,295 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:20:12,295 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,295 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,296 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,297 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:20:12,298 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:20:12,304 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,304 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-11-16 00:20:12,305 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,305 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:20:12,305 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,305 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,306 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,306 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:20:12,306 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:20:12,307 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,307 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-11-16 00:20:12,308 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,308 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:20:12,308 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,309 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,309 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,309 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:20:12,309 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:20:12,316 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,316 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-11-16 00:20:12,317 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,317 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:20:12,317 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,317 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,318 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,318 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:20:12,318 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:20:12,319 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,319 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-11-16 00:20:12,320 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,320 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,320 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,321 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,323 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:20:12,323 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:20:12,327 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,327 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-11-16 00:20:12,328 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,328 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:20:12,328 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,328 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,328 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,329 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:20:12,329 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:20:12,330 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,330 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-11-16 00:20:12,331 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,331 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:20:12,331 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,331 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,332 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,332 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:20:12,332 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:20:12,333 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,333 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-11-16 00:20:12,334 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,334 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:20:12,334 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,335 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,335 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,335 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:20:12,360 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:20:12,361 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,361 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-11-16 00:20:12,363 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,363 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:20:12,363 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,363 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,364 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,364 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:20:12,364 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:20:12,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,365 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-11-16 00:20:12,366 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,366 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:20:12,366 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,366 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,367 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,367 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:20:12,367 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:20:12,368 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,368 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-11-16 00:20:12,375 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,375 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:20:12,375 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,375 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,375 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,376 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:20:12,376 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:20:12,377 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,377 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-11-16 00:20:12,378 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,378 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:20:12,378 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,378 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,378 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,379 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:20:12,379 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:20:12,379 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,380 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-11-16 00:20:12,380 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,380 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:20:12,381 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,381 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,381 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,381 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:20:12,381 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:20:12,382 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,383 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-11-16 00:20:12,383 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,383 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:20:12,383 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,384 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,384 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,384 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:20:12,384 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:20:12,385 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,385 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-11-16 00:20:12,386 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,386 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,386 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,386 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,388 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:20:12,388 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:20:12,404 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,404 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-11-16 00:20:12,405 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,405 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:20:12,405 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,405 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,405 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,406 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:20:12,406 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:20:12,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,407 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-11-16 00:20:12,408 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,408 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:20:12,408 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,408 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,408 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,409 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:20:12,409 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:20:12,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,410 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-11-16 00:20:12,414 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,414 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:20:12,414 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,414 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,415 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,415 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:20:12,415 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:20:12,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,416 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-11-16 00:20:12,417 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,417 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:20:12,417 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,417 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,417 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,418 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:20:12,418 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:20:12,419 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,419 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-11-16 00:20:12,420 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,420 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:20:12,420 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,420 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,420 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,421 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:20:12,421 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:20:12,421 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,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-11-16 00:20:12,422 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,422 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:20:12,423 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,423 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,423 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,423 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:20:12,423 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:20:12,424 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,425 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-11-16 00:20:12,425 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,425 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:20:12,425 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,425 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,426 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,426 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:20:12,426 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:20:12,427 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,427 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-11-16 00:20:12,428 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,428 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:20:12,428 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,428 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,428 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,429 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:20:12,429 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:20:12,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,430 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-11-16 00:20:12,431 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,431 INFO L202 nArgumentSynthesizer]: 3 stem disjuncts [2019-11-16 00:20:12,431 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,431 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,435 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-16 00:20:12,435 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:20:12,460 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,465 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-11-16 00:20:12,466 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,466 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,466 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,466 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,473 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:20:12,473 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:20:12,503 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,503 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-11-16 00:20:12,504 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,504 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,504 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,504 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,506 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:20:12,506 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:20:12,510 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,510 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-11-16 00:20:12,511 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,511 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,511 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,511 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,513 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:20:12,513 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:20:12,517 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,517 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-11-16 00:20:12,518 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,518 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,518 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,518 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,519 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:20:12,520 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:20:12,523 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,524 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-11-16 00:20:12,524 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,524 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,524 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,524 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,526 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:20:12,526 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:20:12,530 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,530 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-11-16 00:20:12,531 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,531 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,531 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,531 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,532 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:20:12,532 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:20:12,534 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:20:12,535 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-11-16 00:20:12,535 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:12,536 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:12,536 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:12,536 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:12,538 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:20:12,538 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:20:12,559 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:20:12,576 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:20:12,577 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:20:12,579 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:20:12,580 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:20:12,580 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:20:12,581 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_#t~loopctr13, #Ultimate.C_memcpy_size) = -1*#Ultimate.C_memcpy_#t~loopctr13 + 1*#Ultimate.C_memcpy_size Supporting invariants [] [2019-11-16 00:20:12,666 INFO L297 tatePredicateManager]: 27 out of 27 supporting invariants were superfluous and have been removed [2019-11-16 00:20:12,673 WARN L1295 BoogieBacktranslator]: unknown boogie variable size [2019-11-16 00:20:12,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:12,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:20:12,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:20:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:12,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:20:12,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:20:12,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:20:12,755 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-16 00:20:12,756 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 2 states. [2019-11-16 00:20:12,813 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states.. Second operand 2 states. Result 38 states and 53 transitions. Complement of second has 6 states. [2019-11-16 00:20:12,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:20:12,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-16 00:20:12,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-11-16 00:20:12,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2019-11-16 00:20:12,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:20:12,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2019-11-16 00:20:12,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:20:12,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-16 00:20:12,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:20:12,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2019-11-16 00:20:12,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-16 00:20:12,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 9 states and 11 transitions. [2019-11-16 00:20:12,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-16 00:20:12,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-16 00:20:12,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-11-16 00:20:12,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:20:12,837 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-16 00:20:12,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-11-16 00:20:12,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-11-16 00:20:12,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-16 00:20:12,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-11-16 00:20:12,862 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-16 00:20:12,862 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-16 00:20:12,862 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:20:12,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-11-16 00:20:12,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-16 00:20:12,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:20:12,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:20:12,864 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:20:12,864 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-16 00:20:12,864 INFO L791 eck$LassoCheckResult]: Stem: 225#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(10);call write~init~int(0, ~#d~0.base, ~#d~0.offset, 1);call write~init~int(3, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 4 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 5 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 6 + ~#d~0.offset, 4); 221#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset, main_#t~mem2, main_#t~mem3, main_#t~mem4, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_~p~0.base, main_~p~0.offset;havoc main_~p~0.base, main_~p~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(10);main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 222#L41 call main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset := #Ultimate.C_memcpy(main_~p~0.base, main_~p~0.offset, ~#d~0.base, ~#d~0.offset, 10);< 227##Ultimate.C_memcpyENTRY assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 223#$Ultimate##0 #t~loopctr13 := 0; 224#L-1-1 assume !(#t~loopctr13 < size);#t~loopctr16 := 0; 226#L-1-3 [2019-11-16 00:20:12,865 INFO L793 eck$LassoCheckResult]: Loop: 226#L-1-3 assume #t~loopctr16 < size;#t~loopctr16 := 4 + #t~loopctr16; 226#L-1-3 [2019-11-16 00:20:12,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:12,865 INFO L82 PathProgramCache]: Analyzing trace with hash 892198778, now seen corresponding path program 1 times [2019-11-16 00:20:12,866 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:12,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070896516] [2019-11-16 00:20:12,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:12,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:12,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:20:12,940 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070896516] [2019-11-16 00:20:12,941 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:12,941 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:20:12,941 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857704874] [2019-11-16 00:20:12,943 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:20:12,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:12,944 INFO L82 PathProgramCache]: Analyzing trace with hash 120, now seen corresponding path program 1 times [2019-11-16 00:20:12,944 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:12,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120417997] [2019-11-16 00:20:12,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:12,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:12,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:20:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:20:12,949 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:20:12,959 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:20:12,959 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:20:12,959 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:20:12,959 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:20:12,959 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:20:12,959 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:20:12,960 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:20:12,960 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:20:12,960 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-3-1.i_Iteration2_Loop [2019-11-16 00:20:12,960 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:20:12,960 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:20:12,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:12,980 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:20:12,981 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c63ab92-2212-4ca5-a880-ee9523bc249d/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:20:12,987 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:20:12,987 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c63ab92-2212-4ca5-a880-ee9523bc249d/bin/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:20:13,002 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:20:13,002 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:20:13,110 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:20:13,112 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:20:13,112 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:20:13,112 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:20:13,112 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:20:13,112 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:20:13,112 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:20:13,113 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:20:13,113 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:20:13,113 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-3-1.i_Iteration2_Loop [2019-11-16 00:20:13,113 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:20:13,113 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:20:13,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:20:13,152 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:20:13,153 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:20:13,153 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-11-16 00:20:13,154 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:20:13,154 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:20:13,154 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:20:13,154 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:20:13,154 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:20:13,155 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:20:13,155 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:20:13,157 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:20:13,160 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:20:13,160 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:20:13,160 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:20:13,161 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:20:13,161 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:20:13,161 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_#t~loopctr16, #Ultimate.C_memcpy_size) = -1*#Ultimate.C_memcpy_#t~loopctr16 + 1*#Ultimate.C_memcpy_size Supporting invariants [] [2019-11-16 00:20:13,171 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:20:13,178 WARN L1295 BoogieBacktranslator]: unknown boogie variable size [2019-11-16 00:20:13,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:13,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:20:13,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:20:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:13,227 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:20:13,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:20:13,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:20:13,227 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-16 00:20:13,228 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-11-16 00:20:13,235 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 9 states and 11 transitions. Complement of second has 3 states. [2019-11-16 00:20:13,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2019-11-16 00:20:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-16 00:20:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2019-11-16 00:20:13,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 1 letters. [2019-11-16 00:20:13,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:20:13,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 7 letters. Loop has 1 letters. [2019-11-16 00:20:13,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:20:13,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-16 00:20:13,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:20:13,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2019-11-16 00:20:13,238 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:20:13,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-11-16 00:20:13,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:20:13,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:20:13,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:20:13,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:20:13,238 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:20:13,238 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:20:13,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:13,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:20:13,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:20:13,242 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2019-11-16 00:20:13,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:13,245 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-16 00:20:13,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:20:13,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-16 00:20:13,245 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:20:13,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:20:13,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:20:13,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:20:13,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:20:13,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:20:13,246 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:20:13,246 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:20:13,246 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:20:13,246 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:20:13,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:20:13,247 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:20:13,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:20:13,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:20:13 BoogieIcfgContainer [2019-11-16 00:20:13,252 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:20:13,253 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:20:13,253 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:20:13,253 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:20:13,253 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:20:09" (3/4) ... [2019-11-16 00:20:13,256 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:20:13,256 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:20:13,258 INFO L168 Benchmark]: Toolchain (without parser) took 4448.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.6 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -150.5 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:20:13,259 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:20:13,259 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:20:13,260 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.78 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-11-16 00:20:13,260 INFO L168 Benchmark]: Boogie Preprocessor took 30.38 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-11-16 00:20:13,261 INFO L168 Benchmark]: RCFGBuilder took 433.26 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: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:20:13,261 INFO L168 Benchmark]: BuchiAutomizer took 3648.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.4 MB). Peak memory consumption was 67.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:20:13,262 INFO L168 Benchmark]: Witness Printer took 3.93 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-11-16 00:20:13,265 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 286.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.78 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. * Boogie Preprocessor took 30.38 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 433.26 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: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3648.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.4 MB). Peak memory consumption was 67.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.93 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable size - GenericResult: Unfinished Backtranslation unknown boogie variable size * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * aux-#t~loopctr13-aux + unknown-size-unknown and consists of 3 locations. One deterministic module has affine ranking function -1 * aux-#t~loopctr16-aux + unknown-size-unknown and consists of 2 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 3. 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 8 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13 SDtfs, 14 SDslu, 1 SDs, 0 SdLazy, 11 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso1 LassoPreprocessingBenchmarks: Lassos: inital76 mio100 ax100 hnf100 lsp99 ukn88 mio100 lsp75 div100 bol100 ite100 ukn100 eq175 hnf89 smp100 dnf118 smp89 tf108 neg97 sie119 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 3 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 10 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...