./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Toulouse-BranchesToLoop-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_fad2541f-cdb5-415c-898d-404245a64cd3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fad2541f-cdb5-415c-898d-404245a64cd3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fad2541f-cdb5-415c-898d-404245a64cd3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fad2541f-cdb5-415c-898d-404245a64cd3/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Toulouse-BranchesToLoop-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_fad2541f-cdb5-415c-898d-404245a64cd3/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fad2541f-cdb5-415c-898d-404245a64cd3/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 64bit --witnessprinter.graph.data.programhash 00af3b6676c9262f2d1d8ee1ad0dddc75df98c14 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:02:28,900 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:02:28,902 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:02:28,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:02:28,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:02:28,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:02:28,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:02:28,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:02:28,938 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:02:28,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:02:28,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:02:28,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:02:28,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:02:28,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:02:28,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:02:28,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:02:28,947 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:02:28,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:02:28,949 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:02:28,955 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:02:28,959 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:02:28,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:02:28,964 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:02:28,965 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:02:28,969 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:02:28,970 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:02:28,971 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:02:28,973 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:02:28,973 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:02:28,975 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:02:28,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:02:28,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:02:28,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:02:28,977 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:02:28,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:02:28,979 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:02:28,980 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:02:28,981 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:02:28,981 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:02:28,982 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:02:28,982 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:02:28,984 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fad2541f-cdb5-415c-898d-404245a64cd3/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:02:29,015 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:02:29,016 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:02:29,017 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:02:29,017 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:02:29,017 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:02:29,017 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:02:29,018 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:02:29,018 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:02:29,018 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:02:29,018 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:02:29,019 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:02:29,019 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:02:29,019 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:02:29,019 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:02:29,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:02:29,020 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:02:29,020 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:02:29,020 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:02:29,020 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:02:29,021 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:02:29,021 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:02:29,021 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:02:29,021 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:02:29,022 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:02:29,022 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:02:29,022 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:02:29,022 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:02:29,023 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:02:29,024 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:02:29,024 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_fad2541f-cdb5-415c-898d-404245a64cd3/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 00af3b6676c9262f2d1d8ee1ad0dddc75df98c14 [2019-11-15 23:02:29,079 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:02:29,096 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:02:29,100 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:02:29,102 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:02:29,104 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:02:29,105 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fad2541f-cdb5-415c-898d-404245a64cd3/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Toulouse-BranchesToLoop-alloca.i [2019-11-15 23:02:29,177 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fad2541f-cdb5-415c-898d-404245a64cd3/bin/uautomizer/data/ddec52be6/ef7c8851d1094e6f8a5cfb9bed584df6/FLAG2bc58c1e5 [2019-11-15 23:02:29,745 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:02:29,746 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fad2541f-cdb5-415c-898d-404245a64cd3/sv-benchmarks/c/termination-memory-alloca/Toulouse-BranchesToLoop-alloca.i [2019-11-15 23:02:29,759 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fad2541f-cdb5-415c-898d-404245a64cd3/bin/uautomizer/data/ddec52be6/ef7c8851d1094e6f8a5cfb9bed584df6/FLAG2bc58c1e5 [2019-11-15 23:02:30,102 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fad2541f-cdb5-415c-898d-404245a64cd3/bin/uautomizer/data/ddec52be6/ef7c8851d1094e6f8a5cfb9bed584df6 [2019-11-15 23:02:30,105 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:02:30,107 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:02:30,108 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:02:30,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:02:30,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:02:30,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:02:30" (1/1) ... [2019-11-15 23:02:30,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b3d066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:02:30, skipping insertion in model container [2019-11-15 23:02:30,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:02:30" (1/1) ... [2019-11-15 23:02:30,128 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:02:30,198 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:02:30,691 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:02:30,702 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:02:30,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:02:30,820 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:02:30,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:02:30 WrapperNode [2019-11-15 23:02:30,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:02:30,822 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:02:30,822 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:02:30,823 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:02:30,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:02:30" (1/1) ... [2019-11-15 23:02:30,849 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:02:30" (1/1) ... [2019-11-15 23:02:30,874 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:02:30,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:02:30,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:02:30,875 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:02:30,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:02:30" (1/1) ... [2019-11-15 23:02:30,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:02:30" (1/1) ... [2019-11-15 23:02:30,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:02:30" (1/1) ... [2019-11-15 23:02:30,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:02:30" (1/1) ... [2019-11-15 23:02:30,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:02:30" (1/1) ... [2019-11-15 23:02:30,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:02:30" (1/1) ... [2019-11-15 23:02:30,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:02:30" (1/1) ... [2019-11-15 23:02:30,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:02:30,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:02:30,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:02:30,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:02:30,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:02:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fad2541f-cdb5-415c-898d-404245a64cd3/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:02:30,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:02:30,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:02:30,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:02:30,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:02:30,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:02:30,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:02:31,313 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:02:31,313 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 23:02:31,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:02:31 BoogieIcfgContainer [2019-11-15 23:02:31,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:02:31,316 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:02:31,316 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:02:31,319 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:02:31,320 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:02:31,320 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:02:30" (1/3) ... [2019-11-15 23:02:31,332 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d7fccc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:02:31, skipping insertion in model container [2019-11-15 23:02:31,332 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:02:31,333 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:02:30" (2/3) ... [2019-11-15 23:02:31,333 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d7fccc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:02:31, skipping insertion in model container [2019-11-15 23:02:31,333 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:02:31,333 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:02:31" (3/3) ... [2019-11-15 23:02:31,335 INFO L371 chiAutomizerObserver]: Analyzing ICFG Toulouse-BranchesToLoop-alloca.i [2019-11-15 23:02:31,398 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:02:31,398 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:02:31,398 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:02:31,399 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:02:31,399 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:02:31,399 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:02:31,399 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:02:31,399 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:02:31,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-11-15 23:02:31,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:02:31,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:02:31,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:02:31,454 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 23:02:31,454 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:02:31,454 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:02:31,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-11-15 23:02:31,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:02:31,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:02:31,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:02:31,458 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 23:02:31,458 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:02:31,465 INFO L791 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~mem8, main_#t~mem9, main_#t~short10, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 4#L553true assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 12#L558-4true [2019-11-15 23:02:31,465 INFO L793 eck$LassoCheckResult]: Loop: 12#L558-4true call main_#t~mem8 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem8 < 100; 6#L558true assume !main_#t~short10; 9#L558-2true assume !!main_#t~short10;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13 - main_#t~mem14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13;havoc main_#t~mem14; 12#L558-4true [2019-11-15 23:02:31,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:31,470 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-11-15 23:02:31,478 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:31,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511523732] [2019-11-15 23:02:31,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:31,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:31,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:02:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:02:31,679 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:02:31,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:31,680 INFO L82 PathProgramCache]: Analyzing trace with hash 41873, now seen corresponding path program 1 times [2019-11-15 23:02:31,681 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:31,681 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085503536] [2019-11-15 23:02:31,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:31,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:31,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:31,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:31,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085503536] [2019-11-15 23:02:31,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:31,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:02:31,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285589960] [2019-11-15 23:02:31,750 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:02:31,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:31,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:02:31,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:02:31,768 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2019-11-15 23:02:31,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:31,804 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-11-15 23:02:31,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:02:31,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-11-15 23:02:31,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:02:31,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 6 states and 7 transitions. [2019-11-15 23:02:31,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 23:02:31,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 23:02:31,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2019-11-15 23:02:31,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:02:31,816 INFO L688 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-11-15 23:02:31,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2019-11-15 23:02:31,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-11-15 23:02:31,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:02:31,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-11-15 23:02:31,846 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-11-15 23:02:31,846 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-11-15 23:02:31,846 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:02:31,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2019-11-15 23:02:31,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:02:31,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:02:31,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:02:31,847 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 23:02:31,847 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:02:31,848 INFO L791 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 30#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~mem8, main_#t~mem9, main_#t~short10, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 31#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 32#L558-4 [2019-11-15 23:02:31,848 INFO L793 eck$LassoCheckResult]: Loop: 32#L558-4 call main_#t~mem8 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem8 < 100; 33#L558 assume main_#t~short10;call main_#t~mem9 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short10 := main_#t~mem9 < 100; 34#L558-2 assume !!main_#t~short10;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13 - main_#t~mem14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13;havoc main_#t~mem14; 32#L558-4 [2019-11-15 23:02:31,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:31,848 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2019-11-15 23:02:31,849 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:31,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954414873] [2019-11-15 23:02:31,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:31,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:31,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:02:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:02:31,906 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:02:31,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:31,907 INFO L82 PathProgramCache]: Analyzing trace with hash 41811, now seen corresponding path program 1 times [2019-11-15 23:02:31,907 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:31,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588710004] [2019-11-15 23:02:31,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:31,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:31,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:02:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:02:31,988 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:02:31,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:31,989 INFO L82 PathProgramCache]: Analyzing trace with hash 889571280, now seen corresponding path program 1 times [2019-11-15 23:02:31,989 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:31,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737203417] [2019-11-15 23:02:31,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:31,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:31,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:02:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:02:32,145 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:02:32,395 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-15 23:02:33,207 WARN L191 SmtUtils]: Spent 702.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 100 [2019-11-15 23:02:33,476 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-15 23:02:33,489 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:02:33,489 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:02:33,490 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:02:33,490 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:02:33,490 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:02:33,490 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:02:33,490 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:02:33,491 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:02:33,491 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-BranchesToLoop-alloca.i_Iteration2_Lasso [2019-11-15 23:02:33,491 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:02:33,491 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:02:33,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:33,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:33,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:33,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:33,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:33,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:33,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:33,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:33,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:33,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:33,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:34,284 WARN L191 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-11-15 23:02:34,499 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-15 23:02:34,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:34,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:34,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:34,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:34,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:34,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:34,731 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-11-15 23:02:38,009 WARN L191 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 80 DAG size of output: 80 [2019-11-15 23:02:38,077 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:02:38,082 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:02:38,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:38,086 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:38,086 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:02:38,087 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:38,087 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:38,087 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:38,089 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:02:38,089 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:02:38,091 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:38,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:38,092 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:38,092 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:02:38,093 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:38,093 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:38,093 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:38,093 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:02:38,094 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:02:38,095 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:38,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:38,096 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:38,096 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:38,096 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:38,096 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:38,099 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:02:38,099 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:02:38,102 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:38,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:38,103 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:38,103 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:38,104 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:38,104 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:38,106 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:02:38,106 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:02:38,110 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:38,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:38,112 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:38,112 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:38,112 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:38,112 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:38,114 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:02:38,114 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:02:38,117 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:38,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:38,118 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:38,119 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:02:38,119 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:38,119 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:38,119 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:38,120 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:02:38,120 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:02:38,121 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:38,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:38,122 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:38,122 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:02:38,122 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:38,123 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:38,123 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:38,123 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:02:38,124 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:02:38,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:38,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:38,126 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:38,126 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:02:38,126 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:38,126 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:38,126 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:38,127 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:02:38,127 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:02:38,128 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:38,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:38,129 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:38,129 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:02:38,129 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:38,130 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:38,130 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:38,130 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:02:38,130 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:02:38,131 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:38,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:38,133 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:38,133 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:02:38,133 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:38,133 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:38,133 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:38,134 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:02:38,134 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:02:38,135 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:38,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:38,136 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:38,137 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:38,137 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:38,137 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:38,145 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:02:38,146 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:02:38,206 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:38,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:38,212 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:38,212 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:38,212 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:38,212 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:38,213 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:02:38,214 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:02:38,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:38,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:38,224 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:38,224 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:38,224 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:38,224 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:38,226 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:02:38,226 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:02:38,235 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:38,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:38,236 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:38,237 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:38,237 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:38,237 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:38,240 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:02:38,254 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:02:38,279 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:02:38,292 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:02:38,292 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 23:02:38,294 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:02:38,303 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-15 23:02:38,303 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:02:38,304 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1 + 199 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 - 1 >= 0] [2019-11-15 23:02:38,510 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2019-11-15 23:02:38,525 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:02:38,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:38,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 23:02:38,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:02:38,644 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:02:38,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 35 treesize of output 39 [2019-11-15 23:02:38,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:02:38,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:02:38,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:02:38,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:13 [2019-11-15 23:02:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:38,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 23:02:38,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:02:38,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:02:38,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:38,798 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-15 23:02:38,798 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 5 states. [2019-11-15 23:02:38,912 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2. Second operand 5 states. Result 12 states and 14 transitions. Complement of second has 7 states. [2019-11-15 23:02:38,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:02:38,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:02:38,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-11-15 23:02:38,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 3 letters. Loop has 3 letters. [2019-11-15 23:02:38,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:02:38,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-15 23:02:38,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:02:38,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 3 letters. Loop has 6 letters. [2019-11-15 23:02:38,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:02:38,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2019-11-15 23:02:38,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:02:38,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 6 states and 6 transitions. [2019-11-15 23:02:38,922 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 23:02:38,923 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 23:02:38,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6 transitions. [2019-11-15 23:02:38,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:02:38,923 INFO L688 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-11-15 23:02:38,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 6 transitions. [2019-11-15 23:02:38,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-11-15 23:02:38,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:02:38,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-11-15 23:02:38,925 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-11-15 23:02:38,925 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-11-15 23:02:38,925 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:02:38,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 6 transitions. [2019-11-15 23:02:38,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:02:38,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:02:38,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:02:38,930 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 23:02:38,930 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:02:38,930 INFO L791 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 257#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~mem8, main_#t~mem9, main_#t~short10, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 258#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 259#L558-4 [2019-11-15 23:02:38,930 INFO L793 eck$LassoCheckResult]: Loop: 259#L558-4 call main_#t~mem8 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem8 < 100; 260#L558 assume main_#t~short10;call main_#t~mem9 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short10 := main_#t~mem9 < 100; 261#L558-2 assume !!main_#t~short10;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13 - main_#t~mem14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13;havoc main_#t~mem14; 259#L558-4 [2019-11-15 23:02:38,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:38,930 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-11-15 23:02:38,931 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:38,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130453107] [2019-11-15 23:02:38,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:38,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:38,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:02:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:02:38,993 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:02:38,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:38,993 INFO L82 PathProgramCache]: Analyzing trace with hash 41811, now seen corresponding path program 2 times [2019-11-15 23:02:38,994 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:38,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654726421] [2019-11-15 23:02:38,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:38,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:38,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:02:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:02:39,047 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:02:39,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:39,048 INFO L82 PathProgramCache]: Analyzing trace with hash 889511698, now seen corresponding path program 1 times [2019-11-15 23:02:39,048 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:39,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807703004] [2019-11-15 23:02:39,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:39,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:39,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:02:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:02:39,113 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:02:39,278 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-15 23:02:39,649 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 100 [2019-11-15 23:02:39,786 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-15 23:02:39,789 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:02:39,789 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:02:39,789 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:02:39,789 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:02:39,789 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:02:39,789 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:02:39,789 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:02:39,790 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:02:39,790 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-BranchesToLoop-alloca.i_Iteration3_Lasso [2019-11-15 23:02:39,790 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:02:39,790 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:02:39,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:39,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:39,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-15 23:02:39,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:39,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:39,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:39,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:39,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:39,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:39,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:39,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:39,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:39,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:39,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:39,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:39,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:39,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:39,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:02:40,345 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-11-15 23:02:40,458 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-15 23:02:43,377 WARN L191 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 80 DAG size of output: 80 [2019-11-15 23:02:43,431 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:02:43,431 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:02:43,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:43,432 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:43,433 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:02:43,433 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:43,433 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:43,433 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:43,433 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:02:43,434 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:02:43,434 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:43,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:43,435 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:43,435 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:02:43,435 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:43,436 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:43,436 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:43,436 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:02:43,436 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:02:43,437 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:43,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:43,438 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:43,438 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:02:43,438 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:43,438 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:43,438 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:43,439 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:02:43,439 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:02:43,442 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:43,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:43,443 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:43,443 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:43,443 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:43,443 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:43,444 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:02:43,444 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:02:43,446 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:43,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:43,447 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:43,447 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:02:43,448 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:43,448 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:43,448 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:43,448 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:02:43,448 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:02:43,449 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:43,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:43,450 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:43,450 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:43,450 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:43,451 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:43,452 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:02:43,452 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:02:43,453 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:43,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:43,454 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:43,455 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:43,455 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:43,455 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:43,456 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:02:43,456 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:02:43,458 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:43,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:43,459 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:43,460 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:43,460 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:43,460 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:43,461 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:02:43,461 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:02:43,463 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:43,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:43,464 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:43,464 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:02:43,464 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:43,464 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:43,464 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:43,465 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:02:43,465 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:02:43,466 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:43,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:43,467 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:43,467 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:02:43,468 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:43,468 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:43,468 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:43,468 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:02:43,468 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:02:43,469 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:43,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:43,470 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:43,470 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:02:43,470 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:43,471 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:43,471 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:43,471 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:02:43,471 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:02:43,472 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:43,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:43,473 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:43,473 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:43,473 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:43,473 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:43,474 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:02:43,474 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:02:43,476 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:43,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:43,477 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:43,477 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:43,477 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:43,478 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:43,478 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:02:43,479 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:02:43,480 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:43,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:43,481 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:43,482 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:02:43,482 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:43,482 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:43,482 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:43,482 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:02:43,483 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:02:43,483 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:43,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:43,484 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:43,484 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:43,484 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:43,485 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:43,485 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:02:43,486 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:02:43,487 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:43,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:43,488 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:43,488 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:02:43,488 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:43,489 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:43,489 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:43,489 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:02:43,489 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:02:43,490 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:43,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:43,491 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:43,491 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:43,492 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:43,492 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:43,492 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:02:43,493 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:02:43,495 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:43,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:43,496 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:43,496 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:43,496 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:43,496 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:43,497 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:02:43,497 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:02:43,501 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:02:43,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:02:43,502 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:02:43,502 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:02:43,503 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:02:43,503 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:02:43,504 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:02:43,504 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:02:43,513 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:02:43,518 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:02:43,518 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 23:02:43,519 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:02:43,520 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-15 23:02:43,520 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:02:43,520 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 + 199 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 - 1 >= 0] [2019-11-15 23:02:43,668 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2019-11-15 23:02:43,675 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:02:43,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:43,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 23:02:43,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:02:43,734 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:02:43,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 35 treesize of output 39 [2019-11-15 23:02:43,735 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:02:43,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:02:43,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:02:43,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:13 [2019-11-15 23:02:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:43,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 23:02:43,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:02:43,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:02:43,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:43,880 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 23:02:43,880 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1 Second operand 5 states. [2019-11-15 23:02:43,942 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1. Second operand 5 states. Result 9 states and 10 transitions. Complement of second has 7 states. [2019-11-15 23:02:43,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:02:43,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:02:43,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2019-11-15 23:02:43,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 3 letters. [2019-11-15 23:02:43,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:02:43,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-15 23:02:43,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:02:43,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 6 letters. [2019-11-15 23:02:43,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:02:43,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-11-15 23:02:43,945 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:02:43,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-11-15 23:02:43,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:02:43,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:02:43,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:02:43,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:02:43,946 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:02:43,946 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:02:43,946 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:02:43,946 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:02:43,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:02:43,946 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:02:43,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:02:43,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:02:43 BoogieIcfgContainer [2019-11-15 23:02:43,952 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:02:43,953 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:02:43,953 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:02:43,953 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:02:43,953 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:02:31" (3/4) ... [2019-11-15 23:02:43,957 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:02:43,957 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:02:43,959 INFO L168 Benchmark]: Toolchain (without parser) took 13851.93 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 332.4 MB). Free memory was 946.1 MB in the beginning and 1.0 GB in the end (delta: -93.3 MB). Peak memory consumption was 239.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:02:43,959 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:02:43,960 INFO L168 Benchmark]: CACSL2BoogieTranslator took 713.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -142.1 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:02:43,960 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:02:43,961 INFO L168 Benchmark]: Boogie Preprocessor took 29.26 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:02:43,961 INFO L168 Benchmark]: RCFGBuilder took 410.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:02:43,962 INFO L168 Benchmark]: BuchiAutomizer took 12636.72 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 226.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.5 MB). Peak memory consumption was 245.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:02:43,963 INFO L168 Benchmark]: Witness Printer took 4.33 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:02:43,966 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.35 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 713.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -142.1 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.26 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 410.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12636.72 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 226.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.5 MB). Peak memory consumption was 245.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.33 ms. Allocated memory is still 1.4 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z][z] + 199 and consists of 5 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y][y] + 199 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 11.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 6 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 15 SDtfs, 13 SDslu, 8 SDs, 0 SdLazy, 24 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital369 mio100 ax104 hnf100 lsp90 ukn58 mio100 lsp35 div100 bol100 ite100 ukn100 eq189 hnf88 smp98 dnf1799 smp89 tf100 neg91 sie128 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...