./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/add_last-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c72a48f0-100b-4146-b70c-685af48883d1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c72a48f0-100b-4146-b70c-685af48883d1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c72a48f0-100b-4146-b70c-685af48883d1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c72a48f0-100b-4146-b70c-685af48883d1/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/add_last-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c72a48f0-100b-4146-b70c-685af48883d1/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c72a48f0-100b-4146-b70c-685af48883d1/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 c8e64c1324249ca9b9e3c019cfc2046542af7b26 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:14:20,867 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:14:20,868 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:14:20,883 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:14:20,883 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:14:20,884 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:14:20,886 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:14:20,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:14:20,899 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:14:20,904 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:14:20,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:14:20,907 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:14:20,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:14:20,909 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:14:20,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:14:20,911 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:14:20,912 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:14:20,912 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:14:20,915 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:14:20,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:14:20,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:14:20,923 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:14:20,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:14:20,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:14:20,928 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:14:20,928 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:14:20,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:14:20,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:14:20,931 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:14:20,932 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:14:20,932 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:14:20,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:14:20,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:14:20,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:14:20,936 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:14:20,936 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:14:20,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:14:20,937 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:14:20,937 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:14:20,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:14:20,938 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:14:20,939 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c72a48f0-100b-4146-b70c-685af48883d1/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-16 00:14:20,965 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:14:20,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:14:20,967 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:14:20,967 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:14:20,967 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:14:20,967 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:14:20,968 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:14:20,968 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:14:20,968 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:14:20,968 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:14:20,968 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:14:20,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:14:20,969 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:14:20,969 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:14:20,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:14:20,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:14:20,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:14:20,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:14:20,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:14:20,970 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:14:20,970 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:14:20,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:14:20,971 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:14:20,971 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:14:20,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:14:20,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:14:20,971 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:14:20,972 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:14:20,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:14:20,972 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:14:20,972 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:14:20,973 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:14:20,973 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_c72a48f0-100b-4146-b70c-685af48883d1/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 -> c8e64c1324249ca9b9e3c019cfc2046542af7b26 [2019-11-16 00:14:21,016 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:14:21,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:14:21,033 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:14:21,034 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:14:21,034 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:14:21,035 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c72a48f0-100b-4146-b70c-685af48883d1/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/add_last-alloca-1.i [2019-11-16 00:14:21,090 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c72a48f0-100b-4146-b70c-685af48883d1/bin/uautomizer/data/1c00daace/a98de1260b0d4db4b12150ded7a99c2f/FLAG2406662cb [2019-11-16 00:14:21,562 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:14:21,563 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c72a48f0-100b-4146-b70c-685af48883d1/sv-benchmarks/c/array-memsafety/add_last-alloca-1.i [2019-11-16 00:14:21,575 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c72a48f0-100b-4146-b70c-685af48883d1/bin/uautomizer/data/1c00daace/a98de1260b0d4db4b12150ded7a99c2f/FLAG2406662cb [2019-11-16 00:14:21,878 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c72a48f0-100b-4146-b70c-685af48883d1/bin/uautomizer/data/1c00daace/a98de1260b0d4db4b12150ded7a99c2f [2019-11-16 00:14:21,881 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:14:21,882 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:14:21,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:14:21,883 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:14:21,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:14:21,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:14:21" (1/1) ... [2019-11-16 00:14:21,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71b10e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:14:21, skipping insertion in model container [2019-11-16 00:14:21,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:14:21" (1/1) ... [2019-11-16 00:14:21,903 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:14:21,951 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:14:22,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:14:22,324 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:14:22,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:14:22,416 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:14:22,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:14:22 WrapperNode [2019-11-16 00:14:22,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:14:22,418 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:14:22,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:14:22,418 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:14:22,427 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:14:22" (1/1) ... [2019-11-16 00:14:22,440 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:14:22" (1/1) ... [2019-11-16 00:14:22,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:14:22,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:14:22,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:14:22,460 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:14:22,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:14:22" (1/1) ... [2019-11-16 00:14:22,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:14:22" (1/1) ... [2019-11-16 00:14:22,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:14:22" (1/1) ... [2019-11-16 00:14:22,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:14:22" (1/1) ... [2019-11-16 00:14:22,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:14:22" (1/1) ... [2019-11-16 00:14:22,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:14:22" (1/1) ... [2019-11-16 00:14:22,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:14:22" (1/1) ... [2019-11-16 00:14:22,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:14:22,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:14:22,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:14:22,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:14:22,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:14:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c72a48f0-100b-4146-b70c-685af48883d1/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:14:22,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:14:22,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:14:22,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:14:22,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:14:22,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:14:22,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:14:22,808 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:14:22,808 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-16 00:14:22,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:14:22 BoogieIcfgContainer [2019-11-16 00:14:22,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:14:22,810 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:14:22,810 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:14:22,814 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:14:22,816 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:14:22,816 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:14:21" (1/3) ... [2019-11-16 00:14:22,818 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ac9aa61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:14:22, skipping insertion in model container [2019-11-16 00:14:22,818 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:14:22,818 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:14:22" (2/3) ... [2019-11-16 00:14:22,818 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ac9aa61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:14:22, skipping insertion in model container [2019-11-16 00:14:22,819 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:14:22,819 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:14:22" (3/3) ... [2019-11-16 00:14:22,820 INFO L371 chiAutomizerObserver]: Analyzing ICFG add_last-alloca-1.i [2019-11-16 00:14:22,893 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:14:22,894 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:14:22,894 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:14:22,894 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:14:22,894 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:14:22,894 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:14:22,894 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:14:22,895 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:14:22,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-16 00:14:22,940 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:14:22,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:14:22,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:14:22,947 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:14:22,947 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:14:22,947 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:14:22,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-16 00:14:22,949 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:14:22,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:14:22,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:14:22,950 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:14:22,950 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:14:22,963 INFO L791 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_~k~0, main_#t~mem8, main_#t~mem9, main_#t~post10.base, main_#t~post10.offset, main_#t~mem6, main_#t~mem7, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset, main_~a~0.base, main_~a~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 3#L515true assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 5#L515-2true call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 14#L517true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~a~0.base, main_~a~0.offset := main_~arr~0.base, main_~arr~0.offset;main_~k~0 := 0; 15#L520-3true [2019-11-16 00:14:22,964 INFO L793 eck$LassoCheckResult]: Loop: 15#L520-3true assume !!(main_~k~0 < main_~length~0);call write~int(main_#t~nondet5, main_~arr~0.base, main_~arr~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet5; 12#L520-2true main_#t~post4 := main_~k~0;main_~k~0 := 1 + main_#t~post4;havoc main_#t~post4; 15#L520-3true [2019-11-16 00:14:22,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:14:22,970 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-16 00:14:22,978 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:14:22,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220650775] [2019-11-16 00:14:22,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:22,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:22,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:14:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:14:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:14:23,110 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:14:23,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:14:23,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2019-11-16 00:14:23,112 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:14:23,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861969627] [2019-11-16 00:14:23,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:23,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:23,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:14:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:14:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:14:23,130 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:14:23,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:14:23,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2019-11-16 00:14:23,132 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:14:23,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162786734] [2019-11-16 00:14:23,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:23,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:23,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:14:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:14:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:14:23,173 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:14:23,484 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-11-16 00:14:23,570 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:14:23,571 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:14:23,571 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:14:23,571 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:14:23,572 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:14:23,572 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:14:23,572 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:14:23,572 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:14:23,572 INFO L131 ssoRankerPreferences]: Filename of dumped script: add_last-alloca-1.i_Iteration1_Lasso [2019-11-16 00:14:23,572 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:14:23,573 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:14:23,594 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:14:23,601 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:14:23,603 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:14:23,607 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:14:23,611 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:14:23,615 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:14:23,619 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:14:23,626 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:14:23,634 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:14:23,761 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-11-16 00:14:23,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:14:23,793 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:14:23,796 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:14:23,799 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:14:23,802 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:14:23,804 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:14:23,806 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:14:23,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:14:24,161 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:14:24,167 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:14:24,172 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:14:24,174 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:14:24,175 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:14:24,175 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:14:24,175 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:14:24,176 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:14:24,178 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:14:24,178 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:14:24,196 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:14:24,197 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:14:24,200 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:14:24,200 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:14:24,201 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:14:24,201 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:14:24,201 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:14:24,201 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:14:24,202 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:14:24,211 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:14:24,212 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:14:24,212 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:14:24,213 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:14:24,213 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:14:24,213 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:14:24,213 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:14:24,214 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:14:24,214 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:14:24,215 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:14:24,216 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:14:24,216 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:14:24,217 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:14:24,217 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:14:24,217 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:14:24,230 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:14:24,230 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:14:24,231 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:14:24,231 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:14:24,232 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:14:24,233 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:14:24,233 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:14:24,233 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:14:24,233 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:14:24,235 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:14:24,236 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:14:24,239 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:14:24,240 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:14:24,240 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:14:24,240 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:14:24,241 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:14:24,241 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:14:24,243 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:14:24,248 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:14:24,251 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:14:24,252 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:14:24,256 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:14:24,256 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:14:24,256 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:14:24,256 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:14:24,256 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:14:24,257 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:14:24,257 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:14:24,258 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:14:24,260 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:14:24,261 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:14:24,262 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:14:24,262 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:14:24,263 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:14:24,264 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:14:24,265 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:14:24,270 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:14:24,275 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:14:24,277 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:14:24,277 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:14:24,277 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:14:24,278 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:14:24,278 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:14:24,279 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:14:24,280 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:14:24,282 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:14:24,283 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:14:24,285 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:14:24,285 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:14:24,286 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:14:24,286 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:14:24,290 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:14:24,299 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:14:24,313 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:14:24,322 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:14:24,323 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:14:24,324 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:14:24,324 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:14:24,324 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:14:24,328 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:14:24,330 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:14:24,446 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:14:24,518 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:14:24,518 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-16 00:14:24,520 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:14:24,522 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:14:24,522 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:14:24,523 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-11-16 00:14:24,532 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-16 00:14:24,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:14:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:24,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:14:24,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:14:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:24,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:14:24,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:14:24,607 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:14:24,623 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:14:24,625 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2019-11-16 00:14:24,683 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 3 states. Result 31 states and 41 transitions. Complement of second has 7 states. [2019-11-16 00:14:24,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:14:24,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:14:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-11-16 00:14:24,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-16 00:14:24,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:14:24,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-16 00:14:24,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:14:24,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-16 00:14:24,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:14:24,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2019-11-16 00:14:24,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:14:24,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 11 states and 14 transitions. [2019-11-16 00:14:24,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-16 00:14:24,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-16 00:14:24,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-11-16 00:14:24,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:14:24,705 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-16 00:14:24,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-11-16 00:14:24,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-11-16 00:14:24,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-16 00:14:24,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-11-16 00:14:24,732 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-16 00:14:24,732 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-16 00:14:24,732 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:14:24,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-11-16 00:14:24,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:14:24,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:14:24,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:14:24,734 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:14:24,734 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:14:24,735 INFO L791 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 104#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_~k~0, main_#t~mem8, main_#t~mem9, main_#t~post10.base, main_#t~post10.offset, main_#t~mem6, main_#t~mem7, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset, main_~a~0.base, main_~a~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 105#L515 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 106#L515-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 110#L517 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~a~0.base, main_~a~0.offset := main_~arr~0.base, main_~arr~0.offset;main_~k~0 := 0; 113#L520-3 assume !(main_~k~0 < main_~length~0); 109#L525-2 [2019-11-16 00:14:24,738 INFO L793 eck$LassoCheckResult]: Loop: 109#L525-2 call main_#t~mem6 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4); 108#L525 assume !!(main_#t~mem6 != main_#t~mem7);havoc main_#t~mem6;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem9 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4);call write~int(main_#t~mem8 + main_#t~mem9, main_~a~0.base, main_~a~0.offset, 4);havoc main_#t~mem9;havoc main_#t~mem8;main_#t~post10.base, main_#t~post10.offset := main_~a~0.base, main_~a~0.offset;main_~a~0.base, main_~a~0.offset := main_#t~post10.base, 4 + main_#t~post10.offset;havoc main_#t~post10.base, main_#t~post10.offset; 109#L525-2 [2019-11-16 00:14:24,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:14:24,739 INFO L82 PathProgramCache]: Analyzing trace with hash 889568363, now seen corresponding path program 1 times [2019-11-16 00:14:24,739 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:14:24,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102255586] [2019-11-16 00:14:24,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:24,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:24,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:14:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:24,823 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:14:24,824 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102255586] [2019-11-16 00:14:24,824 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:14:24,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:14:24,825 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866965367] [2019-11-16 00:14:24,827 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:14:24,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:14:24,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1958, now seen corresponding path program 1 times [2019-11-16 00:14:24,828 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:14:24,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532155467] [2019-11-16 00:14:24,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:24,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:24,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:14:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:14:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:14:24,852 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:14:24,932 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:14:24,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:14:24,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:14:24,936 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-11-16 00:14:24,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:14:24,974 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-11-16 00:14:24,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:14:24,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-11-16 00:14:24,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:14:24,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2019-11-16 00:14:24,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-16 00:14:24,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-16 00:14:24,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2019-11-16 00:14:24,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:14:24,978 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-11-16 00:14:24,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2019-11-16 00:14:24,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-11-16 00:14:24,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-16 00:14:24,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-11-16 00:14:24,979 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-11-16 00:14:24,980 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-11-16 00:14:24,980 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:14:24,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2019-11-16 00:14:24,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:14:24,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:14:24,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:14:24,981 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:14:24,981 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:14:24,981 INFO L791 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 132#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_~k~0, main_#t~mem8, main_#t~mem9, main_#t~post10.base, main_#t~post10.offset, main_#t~mem6, main_#t~mem7, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset, main_~a~0.base, main_~a~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 133#L515 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 135#L515-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 138#L517 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~a~0.base, main_~a~0.offset := main_~arr~0.base, main_~arr~0.offset;main_~k~0 := 0; 141#L520-3 assume !!(main_~k~0 < main_~length~0);call write~int(main_#t~nondet5, main_~arr~0.base, main_~arr~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet5; 139#L520-2 main_#t~post4 := main_~k~0;main_~k~0 := 1 + main_#t~post4;havoc main_#t~post4; 140#L520-3 assume !(main_~k~0 < main_~length~0); 137#L525-2 [2019-11-16 00:14:24,981 INFO L793 eck$LassoCheckResult]: Loop: 137#L525-2 call main_#t~mem6 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4); 136#L525 assume !!(main_#t~mem6 != main_#t~mem7);havoc main_#t~mem6;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem9 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4);call write~int(main_#t~mem8 + main_#t~mem9, main_~a~0.base, main_~a~0.offset, 4);havoc main_#t~mem9;havoc main_#t~mem8;main_#t~post10.base, main_#t~post10.offset := main_~a~0.base, main_~a~0.offset;main_~a~0.base, main_~a~0.offset := main_#t~post10.base, 4 + main_#t~post10.offset;havoc main_#t~post10.base, main_#t~post10.offset; 137#L525-2 [2019-11-16 00:14:24,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:14:24,984 INFO L82 PathProgramCache]: Analyzing trace with hash 176707625, now seen corresponding path program 1 times [2019-11-16 00:14:24,984 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:14:24,984 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45191740] [2019-11-16 00:14:24,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:24,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:24,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:14:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:14:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:14:25,028 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:14:25,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:14:25,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1958, now seen corresponding path program 2 times [2019-11-16 00:14:25,029 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:14:25,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092173022] [2019-11-16 00:14:25,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:25,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:25,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:14:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:14:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:14:25,054 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:14:25,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:14:25,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1982663218, now seen corresponding path program 1 times [2019-11-16 00:14:25,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:14:25,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317507324] [2019-11-16 00:14:25,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:25,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:25,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:14:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:25,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:14:25,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317507324] [2019-11-16 00:14:25,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892721376] [2019-11-16 00:14:25,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c72a48f0-100b-4146-b70c-685af48883d1/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:14:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:25,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-16 00:14:25,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:14:25,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-16 00:14:25,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:14:25,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:14:25,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:14:25,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2019-11-16 00:14:25,679 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:14:25,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2019-11-16 00:14:25,680 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-16 00:14:25,697 INFO L567 ElimStorePlain]: treesize reduction 10, result has 50.0 percent of original size [2019-11-16 00:14:25,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:14:25,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-16 00:14:25,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:14:25,710 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:14:25,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-11-16 00:14:25,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105134007] [2019-11-16 00:14:25,782 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:14:25,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:14:25,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:14:25,783 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 12 states. [2019-11-16 00:14:26,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:14:26,004 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-11-16 00:14:26,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:14:26,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-11-16 00:14:26,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:14:26,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 15 transitions. [2019-11-16 00:14:26,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-16 00:14:26,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-16 00:14:26,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2019-11-16 00:14:26,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:14:26,007 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-11-16 00:14:26,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2019-11-16 00:14:26,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-11-16 00:14:26,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-16 00:14:26,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-11-16 00:14:26,008 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-11-16 00:14:26,009 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-11-16 00:14:26,009 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:14:26,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2019-11-16 00:14:26,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:14:26,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:14:26,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:14:26,010 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-16 00:14:26,010 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:14:26,010 INFO L791 eck$LassoCheckResult]: Stem: 211#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 209#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_~k~0, main_#t~mem8, main_#t~mem9, main_#t~post10.base, main_#t~post10.offset, main_#t~mem6, main_#t~mem7, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset, main_~a~0.base, main_~a~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 210#L515 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 212#L515-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 215#L517 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~a~0.base, main_~a~0.offset := main_~arr~0.base, main_~arr~0.offset;main_~k~0 := 0; 218#L520-3 assume !!(main_~k~0 < main_~length~0);call write~int(main_#t~nondet5, main_~arr~0.base, main_~arr~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet5; 216#L520-2 main_#t~post4 := main_~k~0;main_~k~0 := 1 + main_#t~post4;havoc main_#t~post4; 217#L520-3 assume !!(main_~k~0 < main_~length~0);call write~int(main_#t~nondet5, main_~arr~0.base, main_~arr~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet5; 219#L520-2 main_#t~post4 := main_~k~0;main_~k~0 := 1 + main_#t~post4;havoc main_#t~post4; 220#L520-3 assume !(main_~k~0 < main_~length~0); 214#L525-2 [2019-11-16 00:14:26,011 INFO L793 eck$LassoCheckResult]: Loop: 214#L525-2 call main_#t~mem6 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4); 213#L525 assume !!(main_#t~mem6 != main_#t~mem7);havoc main_#t~mem6;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem9 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4);call write~int(main_#t~mem8 + main_#t~mem9, main_~a~0.base, main_~a~0.offset, 4);havoc main_#t~mem9;havoc main_#t~mem8;main_#t~post10.base, main_#t~post10.offset := main_~a~0.base, main_~a~0.offset;main_~a~0.base, main_~a~0.offset := main_#t~post10.base, 4 + main_#t~post10.offset;havoc main_#t~post10.base, main_#t~post10.offset; 214#L525-2 [2019-11-16 00:14:26,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:14:26,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1982661529, now seen corresponding path program 2 times [2019-11-16 00:14:26,011 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:14:26,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962985428] [2019-11-16 00:14:26,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:26,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:26,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:14:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:14:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:14:26,058 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:14:26,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:14:26,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1958, now seen corresponding path program 3 times [2019-11-16 00:14:26,084 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:14:26,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086642637] [2019-11-16 00:14:26,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:26,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:26,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:14:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:14:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:14:26,101 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:14:26,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:14:26,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1627751052, now seen corresponding path program 2 times [2019-11-16 00:14:26,103 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:14:26,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117601240] [2019-11-16 00:14:26,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:26,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:26,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:14:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:14:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:14:26,148 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:14:26,367 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 68 [2019-11-16 00:14:26,429 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:14:26,429 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:14:26,429 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:14:26,429 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:14:26,430 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:14:26,430 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:14:26,430 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:14:26,430 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:14:26,430 INFO L131 ssoRankerPreferences]: Filename of dumped script: add_last-alloca-1.i_Iteration4_Lasso [2019-11-16 00:14:26,430 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:14:26,430 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:14:26,433 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:14:26,436 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:14:26,438 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:14:26,440 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:14:26,571 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-11-16 00:14:26,669 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:14:26,672 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:14:26,674 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:14:26,676 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:14:26,678 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:14:26,681 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:14:26,683 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:14:26,685 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:14:26,687 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:14:26,690 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:14:26,692 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:14:26,694 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:14:26,696 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:14:26,699 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:14:27,026 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:14:27,026 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:14:27,027 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:14:27,027 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:14:27,027 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:14:27,028 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:14:27,028 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:14:27,028 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:14:27,028 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:14:27,028 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:14:27,029 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:14:27,029 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:14:27,029 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:14:27,029 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:14:27,030 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:14:27,030 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:14:27,030 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:14:27,030 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:14:27,030 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:14:27,031 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:14:27,031 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:14:27,031 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:14:27,031 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:14:27,032 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:14:27,032 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:14:27,033 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:14:27,034 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:14:27,035 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:14:27,035 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:14:27,036 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:14:27,036 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:14:27,036 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:14:27,037 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:14:27,038 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:14:27,039 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:14:27,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:14:27,046 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:14:27,046 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:14:27,047 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:14:27,047 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:14:27,047 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:14:27,049 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:14:27,049 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:14:27,055 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:14:27,056 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:14:27,057 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:14:27,057 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:14:27,057 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:14:27,057 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:14:27,064 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:14:27,065 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:14:27,083 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:14:27,103 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-16 00:14:27,103 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-16 00:14:27,104 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:14:27,105 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:14:27,105 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:14:27,105 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~a~0.offset, v_rep(select #length ULTIMATE.start_main_~a~0.base)_1) = -1*ULTIMATE.start_main_~a~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~a~0.base)_1 Supporting invariants [] [2019-11-16 00:14:27,120 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-16 00:14:27,122 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:14:27,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:14:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:27,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:14:27,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:14:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:27,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:14:27,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:14:27,174 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:14:27,174 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:14:27,174 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-16 00:14:27,184 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 14 states and 17 transitions. Complement of second has 4 states. [2019-11-16 00:14:27,185 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:14:27,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:14:27,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-11-16 00:14:27,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-16 00:14:27,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:14:27,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-16 00:14:27,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:14:27,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-16 00:14:27,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:14:27,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-11-16 00:14:27,187 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:14:27,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2019-11-16 00:14:27,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:14:27,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:14:27,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:14:27,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:14:27,188 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:14:27,188 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:14:27,188 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:14:27,188 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:14:27,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:14:27,188 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:14:27,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:14:27,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:14:27 BoogieIcfgContainer [2019-11-16 00:14:27,195 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:14:27,195 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:14:27,196 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:14:27,196 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:14:27,196 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:14:22" (3/4) ... [2019-11-16 00:14:27,199 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:14:27,200 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:14:27,201 INFO L168 Benchmark]: Toolchain (without parser) took 5318.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.7 MB). Free memory was 943.3 MB in the beginning and 1.0 GB in the end (delta: -57.5 MB). Peak memory consumption was 152.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:14:27,202 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:14:27,202 INFO L168 Benchmark]: CACSL2BoogieTranslator took 534.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -155.5 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:14:27,203 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:14:27,203 INFO L168 Benchmark]: Boogie Preprocessor took 26.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:14:27,204 INFO L168 Benchmark]: RCFGBuilder took 322.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:14:27,205 INFO L168 Benchmark]: BuchiAutomizer took 4385.03 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 86.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 76.4 MB). Peak memory consumption was 162.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:14:27,205 INFO L168 Benchmark]: Witness Printer took 4.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:14:27,208 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 534.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -155.5 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 322.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4385.03 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 86.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 76.4 MB). Peak memory consumption was 162.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 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 #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * k + length and consists of 5 locations. One deterministic module has affine ranking function -1 * a + unknown-#length-unknown[a] and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.3s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 31 SDtfs, 56 SDslu, 14 SDs, 0 SdLazy, 82 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital139 mio100 ax113 hnf98 lsp84 ukn80 mio100 lsp60 div100 bol100 ite100 ukn100 eq170 hnf91 smp98 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 4 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...