./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2.1_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2fe2b104-47d3-4991-9bc0-32965ab47039/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2fe2b104-47d3-4991-9bc0-32965ab47039/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2fe2b104-47d3-4991-9bc0-32965ab47039/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2fe2b104-47d3-4991-9bc0-32965ab47039/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2.1_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2fe2b104-47d3-4991-9bc0-32965ab47039/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2fe2b104-47d3-4991-9bc0-32965ab47039/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6cbc2f8335eda1137ed277d7eb74d7775ef6f777 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 19:47:27,497 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 19:47:27,498 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 19:47:27,504 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 19:47:27,505 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 19:47:27,505 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 19:47:27,506 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 19:47:27,506 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 19:47:27,507 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 19:47:27,508 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 19:47:27,508 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 19:47:27,508 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 19:47:27,509 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 19:47:27,509 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 19:47:27,510 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 19:47:27,510 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 19:47:27,510 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 19:47:27,511 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 19:47:27,512 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 19:47:27,513 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 19:47:27,513 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 19:47:27,514 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 19:47:27,515 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 19:47:27,515 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 19:47:27,515 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 19:47:27,515 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 19:47:27,516 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 19:47:27,516 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 19:47:27,517 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 19:47:27,517 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 19:47:27,517 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 19:47:27,517 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 19:47:27,518 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 19:47:27,518 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 19:47:27,518 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 19:47:27,518 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 19:47:27,519 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2fe2b104-47d3-4991-9bc0-32965ab47039/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-01 19:47:27,526 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 19:47:27,526 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 19:47:27,527 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 19:47:27,527 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 19:47:27,527 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 19:47:27,527 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 19:47:27,527 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 19:47:27,527 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 19:47:27,528 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 19:47:27,528 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 19:47:27,528 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 19:47:27,528 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 19:47:27,528 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 19:47:27,528 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 19:47:27,528 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 19:47:27,528 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 19:47:27,528 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 19:47:27,528 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 19:47:27,528 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 19:47:27,528 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 19:47:27,528 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 19:47:27,529 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 19:47:27,529 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 19:47:27,529 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 19:47:27,529 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 19:47:27,529 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 19:47:27,529 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 19:47:27,529 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 19:47:27,529 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 19:47:27,529 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 19:47:27,529 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 19:47:27,530 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 19:47:27,530 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_2fe2b104-47d3-4991-9bc0-32965ab47039/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6cbc2f8335eda1137ed277d7eb74d7775ef6f777 [2018-12-01 19:47:27,546 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 19:47:27,553 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 19:47:27,555 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 19:47:27,556 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 19:47:27,556 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 19:47:27,557 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2fe2b104-47d3-4991-9bc0-32965ab47039/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2.1_true-valid-memsafety_true-termination.i [2018-12-01 19:47:27,590 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2fe2b104-47d3-4991-9bc0-32965ab47039/bin-2019/uautomizer/data/52bad39ea/4af59e1524e548dcb2f6115261410b30/FLAG47820a184 [2018-12-01 19:47:28,004 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 19:47:28,004 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2fe2b104-47d3-4991-9bc0-32965ab47039/sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2.1_true-valid-memsafety_true-termination.i [2018-12-01 19:47:28,008 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2fe2b104-47d3-4991-9bc0-32965ab47039/bin-2019/uautomizer/data/52bad39ea/4af59e1524e548dcb2f6115261410b30/FLAG47820a184 [2018-12-01 19:47:28,016 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2fe2b104-47d3-4991-9bc0-32965ab47039/bin-2019/uautomizer/data/52bad39ea/4af59e1524e548dcb2f6115261410b30 [2018-12-01 19:47:28,018 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 19:47:28,019 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 19:47:28,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 19:47:28,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 19:47:28,021 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 19:47:28,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:47:28" (1/1) ... [2018-12-01 19:47:28,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b4b7748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:47:28, skipping insertion in model container [2018-12-01 19:47:28,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:47:28" (1/1) ... [2018-12-01 19:47:28,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 19:47:28,037 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 19:47:28,122 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 19:47:28,130 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 19:47:28,140 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 19:47:28,150 INFO L195 MainTranslator]: Completed translation [2018-12-01 19:47:28,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:47:28 WrapperNode [2018-12-01 19:47:28,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 19:47:28,151 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 19:47:28,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 19:47:28,151 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 19:47:28,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:47:28" (1/1) ... [2018-12-01 19:47:28,161 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:47:28" (1/1) ... [2018-12-01 19:47:28,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 19:47:28,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 19:47:28,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 19:47:28,173 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 19:47:28,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:47:28" (1/1) ... [2018-12-01 19:47:28,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:47:28" (1/1) ... [2018-12-01 19:47:28,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:47:28" (1/1) ... [2018-12-01 19:47:28,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:47:28" (1/1) ... [2018-12-01 19:47:28,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:47:28" (1/1) ... [2018-12-01 19:47:28,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:47:28" (1/1) ... [2018-12-01 19:47:28,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:47:28" (1/1) ... [2018-12-01 19:47:28,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 19:47:28,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 19:47:28,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 19:47:28,220 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 19:47:28,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:47:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fe2b104-47d3-4991-9bc0-32965ab47039/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:47:28,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-12-01 19:47:28,251 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-12-01 19:47:28,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-01 19:47:28,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-12-01 19:47:28,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 19:47:28,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 19:47:28,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2018-12-01 19:47:28,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 19:47:28,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 19:47:28,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 19:47:28,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 19:47:28,352 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 19:47:28,364 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 19:47:28,364 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-01 19:47:28,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:47:28 BoogieIcfgContainer [2018-12-01 19:47:28,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 19:47:28,365 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 19:47:28,365 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 19:47:28,368 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 19:47:28,368 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 19:47:28,368 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 07:47:28" (1/3) ... [2018-12-01 19:47:28,369 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fc376db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 07:47:28, skipping insertion in model container [2018-12-01 19:47:28,369 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 19:47:28,369 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:47:28" (2/3) ... [2018-12-01 19:47:28,369 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fc376db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 07:47:28, skipping insertion in model container [2018-12-01 19:47:28,369 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 19:47:28,369 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:47:28" (3/3) ... [2018-12-01 19:47:28,370 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-bitfields-2.1_true-valid-memsafety_true-termination.i [2018-12-01 19:47:28,404 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 19:47:28,404 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 19:47:28,404 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 19:47:28,404 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 19:47:28,405 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 19:47:28,405 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 19:47:28,405 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 19:47:28,405 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 19:47:28,405 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 19:47:28,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-12-01 19:47:28,429 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2018-12-01 19:47:28,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 19:47:28,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 19:47:28,433 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 19:47:28,433 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-01 19:47:28,433 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 19:47:28,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-12-01 19:47:28,434 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2018-12-01 19:47:28,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 19:47:28,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 19:47:28,435 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 19:47:28,435 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-01 19:47:28,439 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d~0.base, ~#d~0.offset := #Ultimate.alloc(5);call write~init~int(0, ~#d~0.base, ~#d~0.offset, 1);call write~init~int(0, ~#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); 11#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_~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.alloc(3);main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~int(1, ~#d~0.base, ~#d~0.offset, 1);call write~int(2, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~int(3, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~int(4, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~int(5, ~#d~0.base, 4 + ~#d~0.offset, 1); 12#L31true 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, 3);< 17##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; 3#$Ultimate##0true #t~loopctr7 := 0; 9#L-1-1true [2018-12-01 19:47:28,439 INFO L796 eck$LassoCheckResult]: Loop: 9#L-1-1true assume #t~loopctr7 < size;call #t~mem8 := read~unchecked~int(src.base, src.offset + #t~loopctr7, 1);call write~unchecked~int(#t~mem8, dest.base, dest.offset + #t~loopctr7, 1);#t~loopctr7 := 1 + #t~loopctr7; 9#L-1-1true [2018-12-01 19:47:28,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:47:28,443 INFO L82 PathProgramCache]: Analyzing trace with hash 28738897, now seen corresponding path program 1 times [2018-12-01 19:47:28,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:47:28,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:47:28,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:47:28,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:47:28,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:47:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:47:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:47:28,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:47:28,542 INFO L82 PathProgramCache]: Analyzing trace with hash 72, now seen corresponding path program 1 times [2018-12-01 19:47:28,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:47:28,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:47:28,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:47:28,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:47:28,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:47:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:47:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:47:28,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:47:28,550 INFO L82 PathProgramCache]: Analyzing trace with hash 890905848, now seen corresponding path program 1 times [2018-12-01 19:47:28,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:47:28,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:47:28,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:47:28,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:47:28,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:47:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:47:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:47:28,867 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2018-12-01 19:47:29,087 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2018-12-01 19:47:29,165 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:47:29,166 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:47:29,166 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:47:29,166 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:47:29,166 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 19:47:29,167 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:47:29,167 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:47:29,167 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:47:29,167 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2.1_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-12-01 19:47:29,167 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:47:29,167 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:47:29,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:47:29,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:47:29,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:47:29,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:47:29,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:47:29,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:47:29,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:47:29,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:47:29,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:47:29,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:47:29,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:47:29,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:47:29,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:47:29,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:47:29,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:47:29,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:47:29,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:47:29,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:47:29,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:47:29,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:47:29,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:47:29,566 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:47:29,569 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 19:47:29,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:47:29,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:47:29,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:47:29,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:47:29,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:47:29,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:47:29,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:47:29,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:47:29,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:47:29,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:47:29,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:47:29,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:47:29,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:47:29,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:47:29,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:47:29,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:47:29,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:47:29,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:47:29,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:47:29,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:47:29,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:47:29,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:47:29,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:47:29,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:47:29,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:47:29,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:47:29,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:47:29,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:47:29,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:47:29,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:47:29,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:47:29,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:47:29,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:47:29,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:47:29,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:47:29,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:47:29,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:47:29,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:47:29,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:47:29,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:47:29,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:47:29,581 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:47:29,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:47:29,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:47:29,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:47:29,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:47:29,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:47:29,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:47:29,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:47:29,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:47:29,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:47:29,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:47:29,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:47:29,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:47:29,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:47:29,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:47:29,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:47:29,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:47:29,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:47:29,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:47:29,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:47:29,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:47:29,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:47:29,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:47:29,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:47:29,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:47:29,601 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:47:29,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:47:29,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:47:29,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:47:29,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:47:29,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:47:29,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:47:29,607 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:47:29,607 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:47:29,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:47:29,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:47:29,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:47:29,611 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 19:47:29,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:47:29,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:47:29,612 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 19:47:29,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:47:29,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:47:29,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:47:29,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:47:29,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:47:29,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:47:29,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:47:29,621 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:47:29,621 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:47:29,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:47:29,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:47:29,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:47:29,624 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 19:47:29,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:47:29,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:47:29,625 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 19:47:29,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:47:29,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:47:29,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:47:29,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:47:29,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:47:29,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:47:29,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:47:29,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:47:29,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:47:29,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:47:29,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:47:29,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:47:29,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:47:29,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:47:29,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:47:29,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:47:29,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:47:29,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:47:29,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:47:29,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:47:29,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:47:29,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:47:29,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:47:29,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:47:29,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:47:29,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:47:29,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:47:29,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:47:29,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:47:29,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:47:29,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:47:29,648 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:47:29,648 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:47:29,658 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 19:47:29,666 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-01 19:47:29,666 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-01 19:47:29,668 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 19:47:29,669 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 19:47:29,669 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 19:47:29,669 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_#t~loopctr7, #Ultimate.C_memcpy_size) = -1*#Ultimate.C_memcpy_#t~loopctr7 + 1*#Ultimate.C_memcpy_size Supporting invariants [] [2018-12-01 19:47:29,706 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-12-01 19:47:29,711 WARN L1298 BoogieBacktranslator]: unknown boogie variable size [2018-12-01 19:47:29,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:47:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:47:29,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:47:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:47:29,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:47:29,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:47:29,762 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 [2018-12-01 19:47:29,763 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 2 states. [2018-12-01 19:47:29,796 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 2 states. Result 26 states and 35 transitions. Complement of second has 6 states. [2018-12-01 19:47:29,796 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 [2018-12-01 19:47:29,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-12-01 19:47:29,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-12-01 19:47:29,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2018-12-01 19:47:29,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:47:29,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2018-12-01 19:47:29,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:47:29,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-01 19:47:29,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:47:29,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 35 transitions. [2018-12-01 19:47:29,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-01 19:47:29,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 9 states and 11 transitions. [2018-12-01 19:47:29,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-01 19:47:29,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-01 19:47:29,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2018-12-01 19:47:29,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 19:47:29,809 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-01 19:47:29,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2018-12-01 19:47:29,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-12-01 19:47:29,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-01 19:47:29,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-12-01 19:47:29,825 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-01 19:47:29,825 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-01 19:47:29,825 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 19:47:29,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2018-12-01 19:47:29,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-01 19:47:29,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 19:47:29,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 19:47:29,825 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-01 19:47:29,826 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-01 19:47:29,826 INFO L794 eck$LassoCheckResult]: Stem: 156#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d~0.base, ~#d~0.offset := #Ultimate.alloc(5);call write~init~int(0, ~#d~0.base, ~#d~0.offset, 1);call write~init~int(0, ~#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); 153#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_~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.alloc(3);main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~int(1, ~#d~0.base, ~#d~0.offset, 1);call write~int(2, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~int(3, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~int(4, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~int(5, ~#d~0.base, 4 + ~#d~0.offset, 1); 154#L31 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, 3);< 155##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; 157#$Ultimate##0 #t~loopctr7 := 0; 158#L-1-1 assume !(#t~loopctr7 < size);#t~loopctr9 := 0; 159#L-1-3 [2018-12-01 19:47:29,826 INFO L796 eck$LassoCheckResult]: Loop: 159#L-1-3 assume #t~loopctr9 < size;#t~loopctr9 := 4 + #t~loopctr9; 159#L-1-3 [2018-12-01 19:47:29,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:47:29,826 INFO L82 PathProgramCache]: Analyzing trace with hash 890905850, now seen corresponding path program 1 times [2018-12-01 19:47:29,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:47:29,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:47:29,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:47:29,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:47:29,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:47:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:47:29,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:47:29,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:47:29,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:47:29,874 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 19:47:29,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:47:29,874 INFO L82 PathProgramCache]: Analyzing trace with hash 78, now seen corresponding path program 1 times [2018-12-01 19:47:29,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:47:29,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:47:29,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:47:29,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:47:29,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:47:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:47:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:47:29,885 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:47:29,885 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:47:29,885 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:47:29,885 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:47:29,885 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 19:47:29,885 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:47:29,885 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:47:29,885 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:47:29,885 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2.1_true-valid-memsafety_true-termination.i_Iteration2_Loop [2018-12-01 19:47:29,885 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:47:29,885 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:47:29,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:47:29,899 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:47:29,900 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fe2b104-47d3-4991-9bc0-32965ab47039/bin-2019/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:47:29,903 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:47:29,903 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fe2b104-47d3-4991-9bc0-32965ab47039/bin-2019/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 [2018-12-01 19:47:29,930 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 19:47:29,930 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:47:30,008 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 19:47:30,009 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:47:30,009 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:47:30,009 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:47:30,009 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:47:30,009 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 19:47:30,010 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:47:30,010 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:47:30,010 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:47:30,010 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2.1_true-valid-memsafety_true-termination.i_Iteration2_Loop [2018-12-01 19:47:30,010 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:47:30,010 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:47:30,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:47:30,037 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:47:30,037 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 19:47:30,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:47:30,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:47:30,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:47:30,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:47:30,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:47:30,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:47:30,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:47:30,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:47:30,040 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 19:47:30,041 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 19:47:30,042 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 19:47:30,042 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 19:47:30,042 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 19:47:30,042 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 19:47:30,042 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_size, #Ultimate.C_memcpy_#t~loopctr9) = 1*#Ultimate.C_memcpy_size - 1*#Ultimate.C_memcpy_#t~loopctr9 Supporting invariants [] [2018-12-01 19:47:30,042 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 19:47:30,043 WARN L1298 BoogieBacktranslator]: unknown boogie variable size [2018-12-01 19:47:30,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:47:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:47:30,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:47:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:47:30,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:47:30,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:47:30,084 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 [2018-12-01 19:47:30,084 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 2 states. [2018-12-01 19:47:30,087 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. [2018-12-01 19:47:30,087 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 [2018-12-01 19:47:30,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-12-01 19:47:30,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2018-12-01 19:47:30,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 1 letters. [2018-12-01 19:47:30,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:47:30,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 7 letters. Loop has 1 letters. [2018-12-01 19:47:30,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:47:30,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2018-12-01 19:47:30,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:47:30,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2018-12-01 19:47:30,090 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 19:47:30,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2018-12-01 19:47:30,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 19:47:30,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 19:47:30,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 19:47:30,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 19:47:30,090 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 19:47:30,090 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 19:47:30,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:47:30,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:47:30,094 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2018-12-01 19:47:30,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:47:30,096 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-01 19:47:30,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-01 19:47:30,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-12-01 19:47:30,096 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 19:47:30,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-12-01 19:47:30,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 19:47:30,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 19:47:30,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 19:47:30,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 19:47:30,097 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 19:47:30,097 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 19:47:30,097 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 19:47:30,097 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 19:47:30,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 19:47:30,097 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 19:47:30,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 19:47:30,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 07:47:30 BoogieIcfgContainer [2018-12-01 19:47:30,102 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 19:47:30,102 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 19:47:30,103 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 19:47:30,103 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 19:47:30,103 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:47:28" (3/4) ... [2018-12-01 19:47:30,106 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 19:47:30,106 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 19:47:30,106 INFO L168 Benchmark]: Toolchain (without parser) took 2087.95 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 228.6 MB). Free memory was 953.3 MB in the beginning and 1.2 GB in the end (delta: -251.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 19:47:30,107 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 19:47:30,107 INFO L168 Benchmark]: CACSL2BoogieTranslator took 131.22 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-01 19:47:30,108 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.09 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-01 19:47:30,108 INFO L168 Benchmark]: Boogie Preprocessor took 47.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -203.9 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-01 19:47:30,109 INFO L168 Benchmark]: RCFGBuilder took 144.46 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: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-12-01 19:47:30,110 INFO L168 Benchmark]: BuchiAutomizer took 1737.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 79.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -78.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 11.5 GB. [2018-12-01 19:47:30,110 INFO L168 Benchmark]: Witness Printer took 3.24 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 19:47:30,113 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 131.22 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.09 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -203.9 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 144.46 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: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1737.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 79.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -78.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.24 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 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~loopctr7-aux + unknown-size-unknown and consists of 3 locations. One deterministic module has affine ranking function unknown-size-unknown + -1 * aux-#t~loopctr9-aux 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 1.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. 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: inital69 mio100 ax100 hnf100 lsp98 ukn85 mio100 lsp77 div100 bol100 ite100 ukn100 eq175 hnf88 smp100 dnf100 smp100 tf108 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...