./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2-2.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_3028e9c4-e7c4-45ab-9e46-c7277aca6109/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3028e9c4-e7c4-45ab-9e46-c7277aca6109/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3028e9c4-e7c4-45ab-9e46-c7277aca6109/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3028e9c4-e7c4-45ab-9e46-c7277aca6109/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3028e9c4-e7c4-45ab-9e46-c7277aca6109/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3028e9c4-e7c4-45ab-9e46-c7277aca6109/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 3dbc6bab9a799b7f4b90bf959cd96947d3b192e5 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:22:31,210 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:22:31,212 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:22:31,225 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:22:31,226 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:22:31,227 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:22:31,228 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:22:31,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:22:31,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:22:31,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:22:31,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:22:31,237 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:22:31,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:22:31,239 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:22:31,240 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:22:31,241 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:22:31,242 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:22:31,243 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:22:31,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:22:31,247 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:22:31,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:22:31,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:22:31,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:22:31,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:22:31,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:22:31,257 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:22:31,257 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:22:31,259 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:22:31,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:22:31,260 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:22:31,261 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:22:31,262 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:22:31,263 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:22:31,263 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:22:31,265 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:22:31,265 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:22:31,266 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:22:31,266 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:22:31,266 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:22:31,267 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:22:31,268 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:22:31,269 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3028e9c4-e7c4-45ab-9e46-c7277aca6109/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-16 00:22:31,288 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:22:31,288 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:22:31,289 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:22:31,290 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:22:31,290 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:22:31,290 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:22:31,291 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:22:31,291 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:22:31,291 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:22:31,292 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:22:31,292 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:22:31,292 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:22:31,293 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:22:31,293 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:22:31,293 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:22:31,293 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:22:31,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:22:31,294 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:22:31,294 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:22:31,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:22:31,295 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:22:31,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:22:31,295 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:22:31,296 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:22:31,296 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:22:31,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:22:31,297 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:22:31,297 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:22:31,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:22:31,298 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:22:31,298 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:22:31,299 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:22:31,299 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_3028e9c4-e7c4-45ab-9e46-c7277aca6109/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 -> 3dbc6bab9a799b7f4b90bf959cd96947d3b192e5 [2019-11-16 00:22:31,330 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:22:31,342 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:22:31,346 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:22:31,348 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:22:31,348 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:22:31,349 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3028e9c4-e7c4-45ab-9e46-c7277aca6109/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2-2.i [2019-11-16 00:22:31,411 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3028e9c4-e7c4-45ab-9e46-c7277aca6109/bin/uautomizer/data/129ab3acc/8507868eb94a4a9890aec8204a780126/FLAG4c0f773d2 [2019-11-16 00:22:31,836 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:22:31,837 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3028e9c4-e7c4-45ab-9e46-c7277aca6109/sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2-2.i [2019-11-16 00:22:31,843 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3028e9c4-e7c4-45ab-9e46-c7277aca6109/bin/uautomizer/data/129ab3acc/8507868eb94a4a9890aec8204a780126/FLAG4c0f773d2 [2019-11-16 00:22:31,855 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3028e9c4-e7c4-45ab-9e46-c7277aca6109/bin/uautomizer/data/129ab3acc/8507868eb94a4a9890aec8204a780126 [2019-11-16 00:22:31,857 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:22:31,859 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:22:31,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:22:31,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:22:31,864 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:22:31,865 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:22:31" (1/1) ... [2019-11-16 00:22:31,869 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63afc288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:31, skipping insertion in model container [2019-11-16 00:22:31,869 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:22:31" (1/1) ... [2019-11-16 00:22:31,878 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:22:31,898 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:22:32,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:22:32,211 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:22:32,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:22:32,250 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:22:32,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:32 WrapperNode [2019-11-16 00:22:32,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:22:32,253 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:22:32,253 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:22:32,253 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:22:32,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:32" (1/1) ... [2019-11-16 00:22:32,275 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:32" (1/1) ... [2019-11-16 00:22:32,300 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:22:32,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:22:32,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:22:32,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:22:32,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:32" (1/1) ... [2019-11-16 00:22:32,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:32" (1/1) ... [2019-11-16 00:22:32,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:32" (1/1) ... [2019-11-16 00:22:32,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:32" (1/1) ... [2019-11-16 00:22:32,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:32" (1/1) ... [2019-11-16 00:22:32,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:32" (1/1) ... [2019-11-16 00:22:32,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:32" (1/1) ... [2019-11-16 00:22:32,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:22:32,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:22:32,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:22:32,336 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:22:32,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3028e9c4-e7c4-45ab-9e46-c7277aca6109/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:32,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-16 00:22:32,417 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-16 00:22:32,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-16 00:22:32,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-11-16 00:22:32,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:22:32,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:22:32,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:22:32,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-11-16 00:22:32,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:22:32,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:22:32,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:22:32,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:22:32,736 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:22:32,785 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:22:32,785 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-16 00:22:32,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:22:32 BoogieIcfgContainer [2019-11-16 00:22:32,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:22:32,787 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:22:32,787 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:22:32,791 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:22:32,792 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:22:32,792 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:22:31" (1/3) ... [2019-11-16 00:22:32,793 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63647a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:22:32, skipping insertion in model container [2019-11-16 00:22:32,793 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:22:32,794 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:32" (2/3) ... [2019-11-16 00:22:32,794 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63647a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:22:32, skipping insertion in model container [2019-11-16 00:22:32,794 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:22:32,794 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:22:32" (3/3) ... [2019-11-16 00:22:32,796 INFO L371 chiAutomizerObserver]: Analyzing ICFG test-bitfields-2-2.i [2019-11-16 00:22:32,858 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:22:32,859 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:22:32,859 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:22:32,859 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:22:32,859 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:22:32,859 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:22:32,860 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:22:32,860 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:22:32,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2019-11-16 00:22:32,928 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-11-16 00:22:32,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:22:32,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:22:32,937 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:22:32,937 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-16 00:22:32,938 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:22:32,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2019-11-16 00:22:32,945 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-11-16 00:22:32,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:22:32,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:22:32,946 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:22:32,946 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-16 00:22:32,955 INFO L791 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(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_#t~mem6, 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(4);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, 4);< 18##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~loopctr8 := 0; 9#L-1-1true [2019-11-16 00:22:32,956 INFO L793 eck$LassoCheckResult]: Loop: 9#L-1-1true assume #t~loopctr8 < size;call #t~mem9 := read~unchecked~int(src.base, src.offset + #t~loopctr8, 1);call write~unchecked~int(#t~mem9, dest.base, dest.offset + #t~loopctr8, 1);#t~loopctr8 := 1 + #t~loopctr8; 9#L-1-1true [2019-11-16 00:22:32,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:32,962 INFO L82 PathProgramCache]: Analyzing trace with hash 28745848, now seen corresponding path program 1 times [2019-11-16 00:22:32,973 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:32,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91678601] [2019-11-16 00:22:32,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:32,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:32,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:33,223 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:33,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:33,226 INFO L82 PathProgramCache]: Analyzing trace with hash 79, now seen corresponding path program 1 times [2019-11-16 00:22:33,226 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:33,227 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093034423] [2019-11-16 00:22:33,227 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:33,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:33,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:33,245 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:33,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:33,247 INFO L82 PathProgramCache]: Analyzing trace with hash 891121336, now seen corresponding path program 1 times [2019-11-16 00:22:33,247 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:33,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562895218] [2019-11-16 00:22:33,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:33,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:33,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:33,348 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:34,058 WARN L191 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-11-16 00:22:34,263 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-16 00:22:34,888 WARN L191 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-11-16 00:22:35,066 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-16 00:22:35,079 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:22:35,080 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:22:35,080 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:22:35,080 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:22:35,081 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:22:35,081 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:35,081 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:22:35,082 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:22:35,082 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2-2.i_Iteration1_Lasso [2019-11-16 00:22:35,083 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:22:35,083 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:22:35,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:35,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:35,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:35,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:35,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:35,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:35,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:35,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:35,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:35,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:35,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:35,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:35,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:35,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:35,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:35,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:35,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:35,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:35,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:35,632 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-16 00:22:35,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:35,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:35,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:36,283 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:22:36,289 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:22:36,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,294 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,295 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:36,295 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:36,295 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,296 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,298 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:36,298 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:36,301 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:36,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,302 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,302 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:36,303 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:36,303 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,303 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,304 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:36,304 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:36,305 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:36,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,306 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,307 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:36,307 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:36,307 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,307 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,308 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:36,308 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:36,309 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:36,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,310 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,311 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:36,311 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:36,311 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,311 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,312 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:36,312 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:36,313 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:36,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,315 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,315 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:36,315 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,315 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,318 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:36,319 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:36,323 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:36,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,324 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,325 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:36,325 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:36,325 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,325 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,326 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:36,326 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:36,327 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:36,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,328 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,328 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:36,329 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:36,329 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,329 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,330 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:36,330 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:36,331 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:36,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,332 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,333 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:36,333 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:36,333 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,333 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,334 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:36,334 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:36,335 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:36,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,336 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,337 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:36,337 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:36,337 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,337 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,338 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:36,338 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:36,339 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:36,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,340 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,341 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:36,341 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:36,341 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,341 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,342 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:36,342 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:36,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:36,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,345 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,345 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:36,345 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:36,346 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,346 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,346 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:36,347 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:36,348 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:36,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,349 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,349 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:36,350 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:36,350 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,350 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,351 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:36,351 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:36,352 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:36,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,353 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,353 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:36,354 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,354 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,356 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:36,356 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:36,360 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:36,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,362 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,362 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:36,362 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:36,363 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,363 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,363 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:36,364 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:36,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:36,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,366 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,367 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:36,367 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:36,367 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,367 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,368 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:36,368 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:36,369 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:36,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,371 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,371 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:36,371 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:36,371 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,372 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,372 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:36,372 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:36,373 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:36,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,375 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,375 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:36,375 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:36,376 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,376 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,376 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:36,377 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:36,378 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:36,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,379 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,379 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:36,380 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,380 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,382 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:36,382 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:36,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:36,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,390 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,390 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:36,391 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,391 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,393 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:36,394 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:36,401 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:36,402 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,403 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,403 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:36,403 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,403 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,414 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:36,415 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:36,421 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:36,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,422 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,422 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:36,422 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,423 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,425 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:36,425 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:36,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:36,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,431 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,432 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:36,432 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,432 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,434 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:36,435 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:36,440 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:36,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,441 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,442 INFO L202 nArgumentSynthesizer]: 3 stem disjuncts [2019-11-16 00:22:36,442 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,442 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,446 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-16 00:22:36,446 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:36,471 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:36,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,472 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,473 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:36,473 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,473 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,474 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:36,475 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:36,478 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:36,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,479 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,479 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:36,480 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,480 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,482 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:36,482 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:36,492 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:36,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,496 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,497 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:36,497 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,497 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,499 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:36,506 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:36,512 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:36,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,518 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,519 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:36,519 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,519 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,522 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:36,525 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:36,535 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:36,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:36,537 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:36,537 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:36,537 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:36,538 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:36,551 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:36,551 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:36,576 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:22:36,604 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:22:36,604 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:22:36,607 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:22:36,608 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:22:36,609 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:22:36,610 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_#t~loopctr8, #Ultimate.C_memcpy_size) = -1*#Ultimate.C_memcpy_#t~loopctr8 + 1*#Ultimate.C_memcpy_size Supporting invariants [] [2019-11-16 00:22:36,669 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-11-16 00:22:36,680 WARN L1295 BoogieBacktranslator]: unknown boogie variable size [2019-11-16 00:22:36,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:36,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:22:36,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:36,814 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:22:36,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:36,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:36,834 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-16 00:22:36,842 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states. Second operand 2 states. [2019-11-16 00:22:36,909 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states.. Second operand 2 states. Result 28 states and 38 transitions. Complement of second has 6 states. [2019-11-16 00:22:36,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:22:36,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-16 00:22:36,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-11-16 00:22:36,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2019-11-16 00:22:36,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:36,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2019-11-16 00:22:36,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:36,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-16 00:22:36,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:36,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 38 transitions. [2019-11-16 00:22:36,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-16 00:22:36,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 11 transitions. [2019-11-16 00:22:36,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-16 00:22:36,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-16 00:22:36,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-11-16 00:22:36,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:22:36,940 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-16 00:22:36,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-11-16 00:22:36,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-11-16 00:22:36,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-16 00:22:36,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-11-16 00:22:36,964 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-16 00:22:36,964 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-16 00:22:36,964 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:22:36,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-11-16 00:22:36,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-16 00:22:36,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:22:36,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:22:36,965 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:22:36,965 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-16 00:22:36,966 INFO L791 eck$LassoCheckResult]: Stem: 160#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(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); 157#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_~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(4);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); 158#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, 4);< 159##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; 161#$Ultimate##0 #t~loopctr8 := 0; 162#L-1-1 assume !(#t~loopctr8 < size);#t~loopctr10 := 0; 163#L-1-3 [2019-11-16 00:22:36,966 INFO L793 eck$LassoCheckResult]: Loop: 163#L-1-3 assume #t~loopctr10 < size;#t~loopctr10 := 4 + #t~loopctr10; 163#L-1-3 [2019-11-16 00:22:36,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:36,966 INFO L82 PathProgramCache]: Analyzing trace with hash 891121338, now seen corresponding path program 1 times [2019-11-16 00:22:36,966 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:36,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990304839] [2019-11-16 00:22:36,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:36,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:36,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:37,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:37,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990304839] [2019-11-16 00:22:37,068 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:37,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:22:37,069 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458658869] [2019-11-16 00:22:37,071 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:22:37,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:37,071 INFO L82 PathProgramCache]: Analyzing trace with hash 85, now seen corresponding path program 1 times [2019-11-16 00:22:37,071 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:37,072 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263144583] [2019-11-16 00:22:37,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:37,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:37,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:37,081 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:37,092 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:22:37,092 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:22:37,092 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:22:37,092 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:22:37,092 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:22:37,092 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:37,092 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:22:37,092 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:22:37,093 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2-2.i_Iteration2_Loop [2019-11-16 00:22:37,093 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:22:37,093 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:22:37,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:37,114 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:22:37,115 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3028e9c4-e7c4-45ab-9e46-c7277aca6109/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:22:37,134 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:37,135 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_3028e9c4-e7c4-45ab-9e46-c7277aca6109/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:37,146 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:22:37,146 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:22:37,271 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:22:37,274 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:22:37,274 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:22:37,274 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:22:37,275 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:22:37,275 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:22:37,275 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:37,275 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:22:37,275 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:22:37,275 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2-2.i_Iteration2_Loop [2019-11-16 00:22:37,275 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:22:37,275 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:22:37,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:37,305 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:22:37,307 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:22:37,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:37,308 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:37,308 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:37,308 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:37,309 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:37,309 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:37,309 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:37,309 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:37,313 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:22:37,333 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:22:37,341 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:22:37,345 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:22:37,345 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:22:37,345 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:22:37,346 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_size, #Ultimate.C_memcpy_#t~loopctr10) = 1*#Ultimate.C_memcpy_size - 1*#Ultimate.C_memcpy_#t~loopctr10 Supporting invariants [] [2019-11-16 00:22:37,346 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:22:37,350 WARN L1295 BoogieBacktranslator]: unknown boogie variable size [2019-11-16 00:22:37,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:37,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:22:37,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:37,406 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:22:37,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:37,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:37,407 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-16 00:22:37,408 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-11-16 00:22:37,413 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 9 states and 11 transitions. Complement of second has 3 states. [2019-11-16 00:22:37,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2019-11-16 00:22:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-16 00:22:37,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2019-11-16 00:22:37,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 1 letters. [2019-11-16 00:22:37,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:37,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 7 letters. Loop has 1 letters. [2019-11-16 00:22:37,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:37,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-16 00:22:37,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:37,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2019-11-16 00:22:37,417 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:22:37,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-11-16 00:22:37,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:22:37,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:22:37,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:22:37,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:22:37,418 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:22:37,418 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:22:37,418 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:37,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:22:37,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:22:37,423 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2019-11-16 00:22:37,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:37,427 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-16 00:22:37,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:22:37,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-16 00:22:37,428 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:22:37,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:22:37,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:22:37,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:22:37,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:22:37,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:22:37,429 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:22:37,429 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:22:37,429 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:22:37,429 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:22:37,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:22:37,430 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:22:37,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:22:37,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:22:37 BoogieIcfgContainer [2019-11-16 00:22:37,437 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:22:37,437 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:22:37,438 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:22:37,438 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:22:37,439 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:22:32" (3/4) ... [2019-11-16 00:22:37,443 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:22:37,443 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:22:37,445 INFO L168 Benchmark]: Toolchain (without parser) took 5585.61 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 234.4 MB). Free memory was 943.8 MB in the beginning and 1.2 GB in the end (delta: -224.7 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:22:37,446 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:22:37,447 INFO L168 Benchmark]: CACSL2BoogieTranslator took 392.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 943.8 MB in the beginning and 1.2 GB in the end (delta: -219.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:22:37,447 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:22:37,448 INFO L168 Benchmark]: Boogie Preprocessor took 35.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:22:37,449 INFO L168 Benchmark]: RCFGBuilder took 450.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:22:37,450 INFO L168 Benchmark]: BuchiAutomizer took 4649.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 61.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -35.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:22:37,450 INFO L168 Benchmark]: Witness Printer took 5.54 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. [2019-11-16 00:22:37,454 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 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 392.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 943.8 MB in the beginning and 1.2 GB in the end (delta: -219.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 450.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4649.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 61.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -35.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.54 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~loopctr8-aux + unknown-size-unknown and consists of 3 locations. One deterministic module has affine ranking function unknown-size-unknown + -1 * aux-#t~loopctr10-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 4.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 4.1s. 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: inital69 mio100 ax100 hnf100 lsp98 ukn87 mio100 lsp77 div100 bol100 ite100 ukn100 eq175 hnf86 smp100 dnf122 smp89 tf108 neg97 sie119 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 3 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 10 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...