./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-3.1-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_1d1c5634-c87e-45a4-b20b-10ec8c31720c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1d1c5634-c87e-45a4-b20b-10ec8c31720c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1d1c5634-c87e-45a4-b20b-10ec8c31720c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1d1c5634-c87e-45a4-b20b-10ec8c31720c/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-3.1-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1d1c5634-c87e-45a4-b20b-10ec8c31720c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1d1c5634-c87e-45a4-b20b-10ec8c31720c/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 72da1f6907bc4b842c40cca6c3dd762e325d6dec ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:18:54,424 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:18:54,426 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:18:54,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:18:54,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:18:54,446 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:18:54,448 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:18:54,459 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:18:54,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:18:54,467 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:18:54,468 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:18:54,469 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:18:54,470 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:18:54,471 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:18:54,471 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:18:54,472 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:18:54,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:18:54,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:18:54,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:18:54,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:18:54,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:18:54,486 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:18:54,489 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:18:54,490 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:18:54,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:18:54,493 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:18:54,494 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:18:54,496 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:18:54,496 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:18:54,498 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:18:54,498 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:18:54,499 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:18:54,500 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:18:54,500 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:18:54,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:18:54,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:18:54,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:18:54,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:18:54,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:18:54,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:18:54,505 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:18:54,507 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1d1c5634-c87e-45a4-b20b-10ec8c31720c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 22:18:54,543 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:18:54,543 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:18:54,545 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:18:54,545 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:18:54,545 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:18:54,545 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:18:54,546 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:18:54,546 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:18:54,546 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:18:54,546 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:18:54,547 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:18:54,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:18:54,547 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:18:54,547 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:18:54,548 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:18:54,549 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:18:54,550 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:18:54,550 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:18:54,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:18:54,550 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:18:54,551 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:18:54,551 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:18:54,551 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:18:54,552 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:18:54,552 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:18:54,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:18:54,553 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:18:54,553 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:18:54,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:18:54,554 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:18:54,554 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:18:54,558 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:18:54,558 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_1d1c5634-c87e-45a4-b20b-10ec8c31720c/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 -> 72da1f6907bc4b842c40cca6c3dd762e325d6dec [2019-11-15 22:18:54,607 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:18:54,622 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:18:54,626 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:18:54,627 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:18:54,628 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:18:54,629 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1d1c5634-c87e-45a4-b20b-10ec8c31720c/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-3.1-1.i [2019-11-15 22:18:54,694 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1d1c5634-c87e-45a4-b20b-10ec8c31720c/bin/uautomizer/data/85da9fbd0/af37923a448944918ef093ee6dd37be5/FLAG5ad77f9dc [2019-11-15 22:18:55,147 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:18:55,148 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1d1c5634-c87e-45a4-b20b-10ec8c31720c/sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-3.1-1.i [2019-11-15 22:18:55,155 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1d1c5634-c87e-45a4-b20b-10ec8c31720c/bin/uautomizer/data/85da9fbd0/af37923a448944918ef093ee6dd37be5/FLAG5ad77f9dc [2019-11-15 22:18:55,512 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1d1c5634-c87e-45a4-b20b-10ec8c31720c/bin/uautomizer/data/85da9fbd0/af37923a448944918ef093ee6dd37be5 [2019-11-15 22:18:55,515 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:18:55,517 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:18:55,518 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:18:55,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:18:55,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:18:55,528 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:18:55" (1/1) ... [2019-11-15 22:18:55,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e2771e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:55, skipping insertion in model container [2019-11-15 22:18:55,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:18:55" (1/1) ... [2019-11-15 22:18:55,540 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:18:55,559 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:18:55,774 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:18:55,888 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:18:55,916 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:18:55,939 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:18:55,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:55 WrapperNode [2019-11-15 22:18:55,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:18:55,940 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:18:55,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:18:55,940 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:18:55,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:55" (1/1) ... [2019-11-15 22:18:55,958 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:55" (1/1) ... [2019-11-15 22:18:55,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:18:55,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:18:55,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:18:55,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:18:55,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:55" (1/1) ... [2019-11-15 22:18:55,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:55" (1/1) ... [2019-11-15 22:18:55,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:55" (1/1) ... [2019-11-15 22:18:55,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:55" (1/1) ... [2019-11-15 22:18:56,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:55" (1/1) ... [2019-11-15 22:18:56,005 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:55" (1/1) ... [2019-11-15 22:18:56,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:55" (1/1) ... [2019-11-15 22:18:56,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:18:56,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:18:56,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:18:56,011 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:18:56,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d1c5634-c87e-45a4-b20b-10ec8c31720c/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-15 22:18:56,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-15 22:18:56,076 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-15 22:18:56,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-11-15 22:18:56,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:18:56,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:18:56,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-11-15 22:18:56,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:18:56,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:18:56,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:18:56,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:18:56,314 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 22:18:56,355 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:18:56,355 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 22:18:56,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:18:56 BoogieIcfgContainer [2019-11-15 22:18:56,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:18:56,357 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:18:56,357 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:18:56,361 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:18:56,362 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:18:56,362 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:18:55" (1/3) ... [2019-11-15 22:18:56,363 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b60cff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:18:56, skipping insertion in model container [2019-11-15 22:18:56,363 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:18:56,364 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:55" (2/3) ... [2019-11-15 22:18:56,376 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b60cff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:18:56, skipping insertion in model container [2019-11-15 22:18:56,376 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:18:56,376 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:18:56" (3/3) ... [2019-11-15 22:18:56,378 INFO L371 chiAutomizerObserver]: Analyzing ICFG test-bitfields-3.1-1.i [2019-11-15 22:18:56,483 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:18:56,484 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:18:56,484 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:18:56,484 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:18:56,496 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:18:56,496 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:18:56,496 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:18:56,497 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:18:56,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-15 22:18:56,549 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-11-15 22:18:56,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:18:56,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:18:56,559 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:18:56,560 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 22:18:56,560 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:18:56,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-15 22:18:56,566 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-11-15 22:18:56,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:18:56,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:18:56,567 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:18:56,568 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 22:18:56,577 INFO L791 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(10);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#d~0.base);call write~unchecked~int(2, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~unchecked~int(3, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~unchecked~int(4, ~#d~0.base, 3 + ~#d~0.offset, 1); 7#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_~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; 18#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);< 10##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~loopctr9 := 0; 19#L-1-1true [2019-11-15 22:18:56,577 INFO L793 eck$LassoCheckResult]: Loop: 19#L-1-1true assume #t~loopctr9 < size;call #t~mem10 := read~unchecked~int(src.base, src.offset + #t~loopctr9, 4);call write~unchecked~int(#t~mem10, dest.base, dest.offset + #t~loopctr9, 4);call #t~mem11 := read~unchecked~int(src.base, src.offset + #t~loopctr9, 1);call write~unchecked~int(#t~mem11, dest.base, dest.offset + #t~loopctr9, 1);#t~loopctr9 := 1 + #t~loopctr9; 19#L-1-1true [2019-11-15 22:18:56,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:18:56,584 INFO L82 PathProgramCache]: Analyzing trace with hash 28752799, now seen corresponding path program 1 times [2019-11-15 22:18:56,594 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:18:56,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975498046] [2019-11-15 22:18:56,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:18:56,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:18:56,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:18:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:18:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:18:56,783 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:18:56,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:18:56,784 INFO L82 PathProgramCache]: Analyzing trace with hash 86, now seen corresponding path program 1 times [2019-11-15 22:18:56,785 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:18:56,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650977975] [2019-11-15 22:18:56,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:18:56,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:18:56,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:18:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:18:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:18:56,803 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:18:56,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:18:56,805 INFO L82 PathProgramCache]: Analyzing trace with hash 891336824, now seen corresponding path program 1 times [2019-11-15 22:18:56,805 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:18:56,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533503629] [2019-11-15 22:18:56,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:18:56,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:18:56,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:18:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:18:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:18:56,878 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:18:57,158 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-15 22:18:57,272 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-15 22:18:57,613 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-11-15 22:18:57,731 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-15 22:18:57,744 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:18:57,745 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:18:57,745 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:18:57,746 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:18:57,746 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:18:57,746 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:18:57,746 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:18:57,747 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:18:57,747 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-3.1-1.i_Iteration1_Lasso [2019-11-15 22:18:57,747 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:18:57,748 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:18:57,776 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-15 22:18:57,783 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-15 22:18:57,786 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-15 22:18:57,789 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-15 22:18:57,792 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-15 22:18:57,797 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-15 22:18:57,800 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-15 22:18:57,803 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-15 22:18:57,805 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-15 22:18:57,808 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-15 22:18:57,811 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-15 22:18:57,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:18:57,817 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-15 22:18:57,819 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-15 22:18:57,828 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-15 22:18:57,830 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-15 22:18:57,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:18:57,835 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-15 22:18:57,837 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-15 22:18:57,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:18:58,022 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-11-15 22:18:58,084 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-15 22:18:58,089 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-15 22:18:58,092 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-15 22:18:58,500 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2019-11-15 22:18:58,633 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:18:58,639 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:18:58,642 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-15 22:18:58,644 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:18:58,644 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:18:58,645 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:18:58,645 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:18:58,645 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:18:58,647 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:18:58,647 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:18:58,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:18:58,649 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-15 22:18:58,650 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:18:58,651 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:18:58,651 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:18:58,651 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:18:58,652 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:18:58,652 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:18:58,653 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:18:58,654 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:18:58,654 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-15 22:18:58,655 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:18:58,656 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:18:58,656 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:18:58,656 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:18:58,657 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:18:58,657 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:18:58,658 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:18:58,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:18:58,659 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-15 22:18:58,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:18:58,661 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:18:58,661 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:18:58,661 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:18:58,662 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:18:58,662 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:18:58,663 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:18:58,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:18:58,664 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-15 22:18:58,665 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:18:58,666 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:18:58,666 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:18:58,666 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:18:58,669 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:18:58,670 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:18:58,675 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:18:58,675 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-15 22:18:58,676 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:18:58,677 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:18:58,677 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:18:58,677 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:18:58,678 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:18:58,678 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:18:58,679 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:18:58,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:18:58,680 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-15 22:18:58,681 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:18:58,682 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:18:58,682 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:18:58,682 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:18:58,683 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:18:58,683 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:18:58,683 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:18:58,684 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:18:58,685 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-15 22:18:58,686 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:18:58,686 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:18:58,687 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:18:58,687 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:18:58,687 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:18:58,688 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:18:58,688 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:18:58,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:18:58,690 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-15 22:18:58,691 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:18:58,691 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:18:58,691 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:18:58,692 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:18:58,692 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:18:58,693 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:18:58,693 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:18:58,694 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:18:58,695 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-15 22:18:58,695 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:18:58,696 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:18:58,696 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:18:58,696 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:18:58,697 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:18:58,697 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:18:58,698 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:18:58,699 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:18:58,699 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-15 22:18:58,700 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:18:58,701 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:18:58,701 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:18:58,701 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:18:58,701 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:18:58,702 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:18:58,702 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:18:58,703 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:18:58,704 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-15 22:18:58,705 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:18:58,706 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:18:58,706 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:18:58,706 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:18:58,707 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:18:58,707 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:18:58,708 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:18:58,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:18:58,710 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-15 22:18:58,711 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:18:58,711 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:18:58,711 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:18:58,711 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:18:58,712 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:18:58,712 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:18:58,713 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:18:58,714 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:18:58,715 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-15 22:18:58,716 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:18:58,716 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:18:58,716 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:18:58,717 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:18:58,719 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:18:58,720 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:18:58,725 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:18:58,726 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-15 22:18:58,726 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:18:58,727 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:18:58,727 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:18:58,727 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:18:58,728 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:18:58,728 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:18:58,729 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:18:58,730 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:18:58,730 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-15 22:18:58,731 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:18:58,732 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:18:58,732 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:18:58,732 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:18:58,733 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:18:58,733 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:18:58,734 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:18:58,735 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:18:58,735 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-15 22:18:58,736 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:18:58,737 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:18:58,747 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:18:58,747 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:18:58,748 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:18:58,748 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:18:58,749 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:18:58,750 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:18:58,751 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-15 22:18:58,752 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:18:58,752 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:18:58,752 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:18:58,753 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:18:58,753 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:18:58,753 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:18:58,754 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:18:58,755 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:18:58,756 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-15 22:18:58,757 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:18:58,757 INFO L202 nArgumentSynthesizer]: 3 stem disjuncts [2019-11-15 22:18:58,757 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:18:58,757 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:18:58,763 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-15 22:18:58,763 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:18:58,797 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:18:58,798 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-15 22:18:58,799 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:18:58,799 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:18:58,799 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:18:58,800 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:18:58,802 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:18:58,803 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:18:58,814 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:18:58,826 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-15 22:18:58,827 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:18:58,828 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:18:58,828 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:18:58,828 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:18:58,834 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:18:58,842 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:18:58,905 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:18:58,950 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 22:18:58,950 INFO L444 ModelExtractionUtils]: 11 out of 19 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-15 22:18:58,953 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:18:58,955 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:18:58,956 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:18:58,956 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_#t~loopctr9, #Ultimate.C_memcpy_size) = -1*#Ultimate.C_memcpy_#t~loopctr9 + 1*#Ultimate.C_memcpy_size Supporting invariants [] [2019-11-15 22:18:58,993 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 22:18:59,001 WARN L1295 BoogieBacktranslator]: unknown boogie variable size [2019-11-15 22:18:59,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:18:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:18:59,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:18:59,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:18:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:18:59,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:18:59,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:18:59,094 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-15 22:18:59,113 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-15 22:18:59,114 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 2 states. [2019-11-15 22:18:59,179 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 2 states. Result 30 states and 41 transitions. Complement of second has 6 states. [2019-11-15 22:18:59,180 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-15 22:18:59,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-15 22:18:59,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-11-15 22:18:59,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2019-11-15 22:18:59,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:18:59,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2019-11-15 22:18:59,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:18:59,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 22:18:59,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:18:59,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 41 transitions. [2019-11-15 22:18:59,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 22:18:59,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 9 states and 11 transitions. [2019-11-15 22:18:59,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-15 22:18:59,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-15 22:18:59,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-11-15 22:18:59,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:18:59,197 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-15 22:18:59,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-11-15 22:18:59,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-11-15 22:18:59,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 22:18:59,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-11-15 22:18:59,227 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-15 22:18:59,227 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-15 22:18:59,227 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:18:59,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-11-15 22:18:59,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 22:18:59,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:18:59,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:18:59,229 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:18:59,229 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 22:18:59,229 INFO L791 eck$LassoCheckResult]: Stem: 123#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(10);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#d~0.base);call write~unchecked~int(2, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~unchecked~int(3, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~unchecked~int(4, ~#d~0.base, 3 + ~#d~0.offset, 1); 121#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_~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; 122#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);< 127##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; 124#$Ultimate##0 #t~loopctr9 := 0; 125#L-1-1 assume !(#t~loopctr9 < size);#t~loopctr12 := 0; 126#L-1-3 [2019-11-15 22:18:59,230 INFO L793 eck$LassoCheckResult]: Loop: 126#L-1-3 assume #t~loopctr12 < size;#t~loopctr12 := 4 + #t~loopctr12; 126#L-1-3 [2019-11-15 22:18:59,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:18:59,230 INFO L82 PathProgramCache]: Analyzing trace with hash 891336826, now seen corresponding path program 1 times [2019-11-15 22:18:59,230 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:18:59,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208305255] [2019-11-15 22:18:59,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:18:59,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:18:59,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:18:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:18:59,302 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-15 22:18:59,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208305255] [2019-11-15 22:18:59,303 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:18:59,303 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:18:59,303 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505145819] [2019-11-15 22:18:59,306 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:18:59,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:18:59,306 INFO L82 PathProgramCache]: Analyzing trace with hash 92, now seen corresponding path program 1 times [2019-11-15 22:18:59,307 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:18:59,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906864369] [2019-11-15 22:18:59,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:18:59,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:18:59,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:18:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:18:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:18:59,314 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:18:59,326 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:18:59,327 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:18:59,327 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:18:59,327 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:18:59,327 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:18:59,327 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:18:59,327 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:18:59,327 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:18:59,327 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-3.1-1.i_Iteration2_Loop [2019-11-15 22:18:59,327 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:18:59,328 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:18:59,328 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-15 22:18:59,358 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:18:59,359 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d1c5634-c87e-45a4-b20b-10ec8c31720c/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-15 22:18:59,376 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:18:59,376 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_1d1c5634-c87e-45a4-b20b-10ec8c31720c/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) [2019-11-15 22:18:59,402 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:18:59,403 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:18:59,576 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:18:59,579 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:18:59,580 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:18:59,580 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:18:59,580 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:18:59,580 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:18:59,580 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:18:59,580 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:18:59,580 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:18:59,581 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-3.1-1.i_Iteration2_Loop [2019-11-15 22:18:59,581 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:18:59,581 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:18:59,582 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-15 22:18:59,608 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:18:59,608 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:18:59,609 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-15 22:18:59,609 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:18:59,610 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:18:59,610 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:18:59,610 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:18:59,610 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:18:59,611 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:18:59,611 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:18:59,615 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:18:59,620 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:18:59,621 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:18:59,621 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:18:59,622 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:18:59,622 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:18:59,622 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_#t~loopctr12, #Ultimate.C_memcpy_size) = -1*#Ultimate.C_memcpy_#t~loopctr12 + 1*#Ultimate.C_memcpy_size Supporting invariants [] [2019-11-15 22:18:59,623 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:18:59,625 WARN L1295 BoogieBacktranslator]: unknown boogie variable size [2019-11-15 22:18:59,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:18:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:18:59,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:18:59,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:18:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:18:59,685 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:18:59,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:18:59,685 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-15 22:18:59,686 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-15 22:18:59,686 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-11-15 22:18:59,696 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-15 22:18:59,697 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-15 22:18:59,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-15 22:18:59,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2019-11-15 22:18:59,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 1 letters. [2019-11-15 22:18:59,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:18:59,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 7 letters. Loop has 1 letters. [2019-11-15 22:18:59,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:18:59,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-15 22:18:59,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:18:59,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2019-11-15 22:18:59,700 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:18:59,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-11-15 22:18:59,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:18:59,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:18:59,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:18:59,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:18:59,701 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:18:59,702 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:18:59,702 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:18:59,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:18:59,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:18:59,706 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2019-11-15 22:18:59,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:18:59,711 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-15 22:18:59,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 22:18:59,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-15 22:18:59,711 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:18:59,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:18:59,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:18:59,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:18:59,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:18:59,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:18:59,713 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:18:59,713 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:18:59,713 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:18:59,713 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:18:59,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:18:59,714 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:18:59,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:18:59,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:18:59 BoogieIcfgContainer [2019-11-15 22:18:59,721 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:18:59,722 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:18:59,722 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:18:59,723 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:18:59,723 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:18:56" (3/4) ... [2019-11-15 22:18:59,728 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:18:59,728 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:18:59,730 INFO L168 Benchmark]: Toolchain (without parser) took 4213.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 950.1 MB in the beginning and 816.3 MB in the end (delta: 133.8 MB). Peak memory consumption was 261.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:18:59,731 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:18:59,732 INFO L168 Benchmark]: CACSL2BoogieTranslator took 421.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:18:59,733 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.06 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-15 22:18:59,733 INFO L168 Benchmark]: Boogie Preprocessor took 31.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:18:59,734 INFO L168 Benchmark]: RCFGBuilder took 345.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:18:59,735 INFO L168 Benchmark]: BuchiAutomizer took 3364.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 816.3 MB in the end (delta: 270.3 MB). Peak memory consumption was 270.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:18:59,736 INFO L168 Benchmark]: Witness Printer took 6.11 ms. Allocated memory is still 1.2 GB. Free memory is still 816.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:18:59,740 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 421.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.06 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 31.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 345.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3364.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 816.3 MB in the end (delta: 270.3 MB). Peak memory consumption was 270.3 MB. Max. memory is 11.5 GB. * Witness Printer took 6.11 ms. Allocated memory is still 1.2 GB. Free memory is still 816.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable 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~loopctr9-aux + unknown-size-unknown and consists of 3 locations. One deterministic module has affine ranking function -1 * aux-#t~loopctr12-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.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. 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: inital62 mio100 ax100 hnf100 lsp98 ukn86 mio100 lsp81 div100 bol100 ite100 ukn100 eq167 hnf86 smp94 dnf136 smp89 tf108 neg97 sie119 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 41ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 3 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 10 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...