./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/diff-alloca-1.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_3158edfd-532e-4d90-b655-755f2c886309/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3158edfd-532e-4d90-b655-755f2c886309/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3158edfd-532e-4d90-b655-755f2c886309/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3158edfd-532e-4d90-b655-755f2c886309/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/diff-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3158edfd-532e-4d90-b655-755f2c886309/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3158edfd-532e-4d90-b655-755f2c886309/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 0c73140129db08253eb2666e014a272764010e16 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 21:14:33,697 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:14:33,699 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:14:33,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:14:33,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:14:33,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:14:33,717 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:14:33,730 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:14:33,731 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:14:33,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:14:33,733 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:14:33,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:14:33,734 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:14:33,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:14:33,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:14:33,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:14:33,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:14:33,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:14:33,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:14:33,742 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:14:33,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:14:33,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:14:33,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:14:33,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:14:33,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:14:33,749 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:14:33,749 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:14:33,750 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:14:33,750 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:14:33,751 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:14:33,751 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:14:33,752 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:14:33,752 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:14:33,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:14:33,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:14:33,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:14:33,754 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:14:33,755 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:14:33,755 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:14:33,756 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:14:33,756 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:14:33,757 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3158edfd-532e-4d90-b655-755f2c886309/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 21:14:33,773 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:14:33,773 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:14:33,774 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:14:33,775 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:14:33,775 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:14:33,775 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:14:33,775 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:14:33,775 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:14:33,776 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:14:33,776 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:14:33,776 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:14:33,776 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:14:33,776 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:14:33,777 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:14:33,777 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:14:33,777 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:14:33,777 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:14:33,778 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:14:33,778 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:14:33,778 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:14:33,782 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:14:33,782 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:14:33,782 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:14:33,783 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:14:33,783 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:14:33,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:14:33,784 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:14:33,784 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:14:33,787 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:14:33,788 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_3158edfd-532e-4d90-b655-755f2c886309/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 -> 0c73140129db08253eb2666e014a272764010e16 [2019-11-15 21:14:33,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:14:33,834 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:14:33,839 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:14:33,841 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:14:33,842 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:14:33,843 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3158edfd-532e-4d90-b655-755f2c886309/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/diff-alloca-1.i [2019-11-15 21:14:33,906 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3158edfd-532e-4d90-b655-755f2c886309/bin/uautomizer/data/392e86a4c/7ce38c552ce24b028698778bf4425464/FLAG1952a4f63 [2019-11-15 21:14:34,413 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:14:34,418 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3158edfd-532e-4d90-b655-755f2c886309/sv-benchmarks/c/termination-memory-alloca/diff-alloca-1.i [2019-11-15 21:14:34,439 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3158edfd-532e-4d90-b655-755f2c886309/bin/uautomizer/data/392e86a4c/7ce38c552ce24b028698778bf4425464/FLAG1952a4f63 [2019-11-15 21:14:34,912 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3158edfd-532e-4d90-b655-755f2c886309/bin/uautomizer/data/392e86a4c/7ce38c552ce24b028698778bf4425464 [2019-11-15 21:14:34,914 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:14:34,915 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:14:34,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:14:34,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:14:34,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:14:34,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:14:34" (1/1) ... [2019-11-15 21:14:34,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa28d32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:34, skipping insertion in model container [2019-11-15 21:14:34,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:14:34" (1/1) ... [2019-11-15 21:14:34,932 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:14:34,984 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:14:35,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:14:35,487 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:14:35,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:14:35,572 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:14:35,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:35 WrapperNode [2019-11-15 21:14:35,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:14:35,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:14:35,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:14:35,573 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:14:35,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:35" (1/1) ... [2019-11-15 21:14:35,592 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:35" (1/1) ... [2019-11-15 21:14:35,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:14:35,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:14:35,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:14:35,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:14:35,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:35" (1/1) ... [2019-11-15 21:14:35,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:35" (1/1) ... [2019-11-15 21:14:35,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:35" (1/1) ... [2019-11-15 21:14:35,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:35" (1/1) ... [2019-11-15 21:14:35,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:35" (1/1) ... [2019-11-15 21:14:35,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:35" (1/1) ... [2019-11-15 21:14:35,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:35" (1/1) ... [2019-11-15 21:14:35,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:14:35,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:14:35,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:14:35,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:14:35,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3158edfd-532e-4d90-b655-755f2c886309/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 21:14:35,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:14:35,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:14:35,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:14:35,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:14:35,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:14:35,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:14:35,994 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:14:35,995 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 21:14:35,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:14:35 BoogieIcfgContainer [2019-11-15 21:14:35,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:14:35,996 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:14:35,997 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:14:36,000 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:14:36,001 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:14:36,001 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:14:34" (1/3) ... [2019-11-15 21:14:36,002 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f39290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:14:36, skipping insertion in model container [2019-11-15 21:14:36,002 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:14:36,002 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:35" (2/3) ... [2019-11-15 21:14:36,003 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f39290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:14:36, skipping insertion in model container [2019-11-15 21:14:36,003 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:14:36,003 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:14:35" (3/3) ... [2019-11-15 21:14:36,004 INFO L371 chiAutomizerObserver]: Analyzing ICFG diff-alloca-1.i [2019-11-15 21:14:36,047 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:14:36,047 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:14:36,047 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:14:36,048 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:14:36,048 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:14:36,048 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:14:36,048 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:14:36,048 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:14:36,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-15 21:14:36,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 21:14:36,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:14:36,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:14:36,082 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:14:36,082 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:14:36,082 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:14:36,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-15 21:14:36,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 21:14:36,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:14:36,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:14:36,084 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:14:36,084 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:14:36,090 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 9#L574true assume !(main_~Alen~0 < 1); 14#L574-2true assume !(main_~Blen~0 < 1); 7#L577-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 12#L554-2true [2019-11-15 21:14:36,091 INFO L793 eck$LassoCheckResult]: Loop: 12#L554-2true assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 5#L558-2true assume !true; 6#L557-2true assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 11#L564-1true diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 12#L554-2true [2019-11-15 21:14:36,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:36,096 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-15 21:14:36,103 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:36,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943946753] [2019-11-15 21:14:36,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:36,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:36,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:36,250 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:14:36,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:36,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1679350, now seen corresponding path program 1 times [2019-11-15 21:14:36,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:36,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907630454] [2019-11-15 21:14:36,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:36,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:36,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:36,282 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 21:14:36,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907630454] [2019-11-15 21:14:36,283 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:36,283 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:14:36,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286390244] [2019-11-15 21:14:36,288 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:14:36,289 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:36,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 21:14:36,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 21:14:36,305 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-11-15 21:14:36,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:36,312 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-11-15 21:14:36,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 21:14:36,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-11-15 21:14:36,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 21:14:36,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 15 transitions. [2019-11-15 21:14:36,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 21:14:36,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 21:14:36,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2019-11-15 21:14:36,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:14:36,321 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2019-11-15 21:14:36,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2019-11-15 21:14:36,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-15 21:14:36,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-15 21:14:36,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2019-11-15 21:14:36,343 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2019-11-15 21:14:36,343 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2019-11-15 21:14:36,344 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:14:36,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2019-11-15 21:14:36,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 21:14:36,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:14:36,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:14:36,345 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:14:36,345 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:14:36,345 INFO L791 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 37#L574 assume !(main_~Alen~0 < 1); 38#L574-2 assume !(main_~Blen~0 < 1); 44#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 42#L554-2 [2019-11-15 21:14:36,345 INFO L793 eck$LassoCheckResult]: Loop: 42#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 40#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 45#L557-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 41#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 42#L554-2 [2019-11-15 21:14:36,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:36,346 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-11-15 21:14:36,346 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:36,346 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613859735] [2019-11-15 21:14:36,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:36,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:36,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:36,398 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:14:36,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:36,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1669740, now seen corresponding path program 1 times [2019-11-15 21:14:36,399 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:36,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904394308] [2019-11-15 21:14:36,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:36,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:36,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:36,419 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:14:36,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:36,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1298476337, now seen corresponding path program 1 times [2019-11-15 21:14:36,420 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:36,420 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651134357] [2019-11-15 21:14:36,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:36,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:36,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:36,555 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 21:14:36,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651134357] [2019-11-15 21:14:36,556 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:36,556 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:14:36,556 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024410507] [2019-11-15 21:14:36,694 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-15 21:14:36,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:36,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:14:36,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:14:36,741 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-11-15 21:14:36,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:36,814 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2019-11-15 21:14:36,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:14:36,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 18 transitions. [2019-11-15 21:14:36,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 21:14:36,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 18 transitions. [2019-11-15 21:14:36,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 21:14:36,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 21:14:36,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 18 transitions. [2019-11-15 21:14:36,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:14:36,819 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2019-11-15 21:14:36,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 18 transitions. [2019-11-15 21:14:36,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-11-15 21:14:36,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-15 21:14:36,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-11-15 21:14:36,821 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-15 21:14:36,822 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-15 21:14:36,822 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:14:36,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2019-11-15 21:14:36,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 21:14:36,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:14:36,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:14:36,830 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:14:36,830 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 21:14:36,831 INFO L791 eck$LassoCheckResult]: Stem: 79#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 72#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 73#L574 assume !(main_~Alen~0 < 1); 76#L574-2 assume !(main_~Blen~0 < 1); 81#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 78#L554-2 [2019-11-15 21:14:36,831 INFO L793 eck$LassoCheckResult]: Loop: 78#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 80#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 74#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 75#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 82#L557-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 77#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 78#L554-2 [2019-11-15 21:14:36,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:36,832 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 3 times [2019-11-15 21:14:36,832 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:36,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6855703] [2019-11-15 21:14:36,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:36,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:36,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:36,899 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:14:36,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:36,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183209, now seen corresponding path program 1 times [2019-11-15 21:14:36,904 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:36,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778835645] [2019-11-15 21:14:36,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:36,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:36,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:36,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:36,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778835645] [2019-11-15 21:14:36,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:36,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:14:36,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786864895] [2019-11-15 21:14:36,950 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:14:36,950 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:36,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:14:36,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:14:36,953 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-15 21:14:36,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:36,987 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2019-11-15 21:14:36,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:14:36,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2019-11-15 21:14:36,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-15 21:14:36,989 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2019-11-15 21:14:36,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-15 21:14:36,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 21:14:36,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2019-11-15 21:14:36,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:14:36,991 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-11-15 21:14:36,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2019-11-15 21:14:36,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2019-11-15 21:14:36,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 21:14:36,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-11-15 21:14:36,993 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-15 21:14:36,993 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-15 21:14:36,993 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:14:36,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2019-11-15 21:14:36,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 21:14:36,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:14:36,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:14:36,994 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:14:36,995 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 21:14:36,995 INFO L791 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 107#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 108#L574 assume !(main_~Alen~0 < 1); 112#L574-2 assume !(main_~Blen~0 < 1); 118#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 114#L554-2 [2019-11-15 21:14:36,995 INFO L793 eck$LassoCheckResult]: Loop: 114#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 116#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 109#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 110#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 117#L557-2 assume !(0 == diff_~found~0); 113#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 114#L554-2 [2019-11-15 21:14:36,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:36,995 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 4 times [2019-11-15 21:14:36,995 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:36,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234663028] [2019-11-15 21:14:36,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:36,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:36,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:37,024 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:14:37,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:37,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183271, now seen corresponding path program 1 times [2019-11-15 21:14:37,025 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:37,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485965398] [2019-11-15 21:14:37,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:37,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:37,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:37,040 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:14:37,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:37,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1998160148, now seen corresponding path program 1 times [2019-11-15 21:14:37,041 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:37,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083585916] [2019-11-15 21:14:37,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:37,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:37,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:37,120 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:14:37,239 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-11-15 21:14:37,545 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-11-15 21:14:37,797 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-11-15 21:14:37,810 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:14:37,811 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:14:37,812 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:14:37,816 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:14:37,817 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:14:37,817 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:14:37,817 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:14:37,817 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:14:37,818 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca-1.i_Iteration4_Lasso [2019-11-15 21:14:37,818 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:14:37,819 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:14:37,864 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 21:14:37,874 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 21:14:37,877 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 21:14:37,884 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 21:14:37,897 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 21:14:37,903 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 21:14:37,909 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 21:14:37,922 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 21:14:37,928 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 21:14:37,933 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 21:14:37,936 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 21:14:38,516 WARN L191 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2019-11-15 21:14:38,583 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 21:14:38,585 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 21:14:38,587 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 21:14:38,589 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 21:14:38,592 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 21:14:38,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:14:38,596 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 21:14:39,901 WARN L191 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-11-15 21:14:40,070 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:14:40,075 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:14:40,076 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 21:14:40,078 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:40,078 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:14:40,078 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:40,079 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:40,079 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:40,080 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:14:40,080 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:14:40,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:40,083 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 21:14:40,083 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:40,083 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:14:40,083 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:40,084 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:40,084 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:40,084 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:14:40,084 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:14:40,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:40,085 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 21:14:40,086 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:40,086 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:40,086 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:40,086 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:40,088 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:40,088 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:40,091 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:40,092 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 21:14:40,092 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:40,092 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:40,092 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:40,093 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:40,094 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:40,095 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:40,097 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:40,097 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 21:14:40,098 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:40,098 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:40,098 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:40,098 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:40,100 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:40,100 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:40,103 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:40,104 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 21:14:40,104 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:40,105 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:14:40,105 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:40,105 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:40,105 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:40,106 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:14:40,106 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:14:40,106 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:40,107 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 21:14:40,107 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:40,108 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:40,108 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:40,108 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:40,109 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:40,110 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:40,112 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:40,120 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 21:14:40,120 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:40,120 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:14:40,121 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:40,121 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:40,121 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:40,121 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:14:40,121 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:14:40,122 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:40,123 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 21:14:40,123 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:40,123 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:14:40,123 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:40,123 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:40,124 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:40,124 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:14:40,124 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:14:40,126 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:40,126 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 21:14:40,127 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:40,127 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:14:40,127 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:40,127 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:40,128 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:40,128 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:14:40,128 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:14:40,129 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:40,129 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 21:14:40,130 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:40,130 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-15 21:14:40,130 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:40,130 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:40,152 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-15 21:14:40,152 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:40,277 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:40,278 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 21:14:40,278 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:40,279 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:40,280 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:40,280 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:40,281 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:40,281 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:40,282 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:40,283 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:14:40,283 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:40,283 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:40,284 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:40,284 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:40,285 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:40,285 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:40,287 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:40,287 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 21:14:40,288 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:40,288 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:40,288 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:40,288 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:40,290 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:40,290 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:40,302 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:40,302 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 21:14:40,303 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:40,303 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:40,303 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:40,304 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:40,310 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:40,311 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:40,329 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:40,329 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 21:14:40,330 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:40,330 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:14:40,331 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:40,331 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:40,331 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:40,331 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:14:40,332 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:14:40,332 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:40,333 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 21:14:40,334 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:40,334 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:40,334 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:40,334 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:40,335 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:40,335 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:40,342 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:40,342 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 21:14:40,343 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:40,343 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:40,343 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:40,343 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:40,346 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:40,346 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:40,444 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:14:40,493 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 21:14:40,493 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 21:14:40,498 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:14:40,499 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:14:40,500 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:14:40,501 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0) = -1*ULTIMATE.start_diff_~i~0 + 1*ULTIMATE.start_diff_~l1~0 Supporting invariants [] [2019-11-15 21:14:40,572 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-11-15 21:14:40,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:40,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:14:40,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:14:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:40,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:14:40,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:14:40,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:14:40,679 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:14:40,680 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-15 21:14:40,739 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 21 states and 30 transitions. Complement of second has 4 states. [2019-11-15 21:14:40,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 21:14:40,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:14:40,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-11-15 21:14:40,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-15 21:14:40,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:14:40,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2019-11-15 21:14:40,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:14:40,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 5 letters. Loop has 12 letters. [2019-11-15 21:14:40,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:14:40,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. [2019-11-15 21:14:40,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:14:40,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 24 transitions. [2019-11-15 21:14:40,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-15 21:14:40,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 21:14:40,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2019-11-15 21:14:40,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:14:40,747 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-15 21:14:40,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2019-11-15 21:14:40,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-15 21:14:40,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 21:14:40,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2019-11-15 21:14:40,749 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-11-15 21:14:40,749 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-11-15 21:14:40,749 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 21:14:40,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2019-11-15 21:14:40,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:14:40,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:14:40,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:14:40,751 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 21:14:40,751 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:14:40,751 INFO L791 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 254#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 255#L574 assume !(main_~Alen~0 < 1); 256#L574-2 assume !(main_~Blen~0 < 1); 267#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 265#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 258#L558-2 [2019-11-15 21:14:40,751 INFO L793 eck$LassoCheckResult]: Loop: 258#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 257#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 258#L558-2 [2019-11-15 21:14:40,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:40,752 INFO L82 PathProgramCache]: Analyzing trace with hash 889572242, now seen corresponding path program 1 times [2019-11-15 21:14:40,752 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:40,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439604614] [2019-11-15 21:14:40,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:40,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:40,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:40,781 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:14:40,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:40,783 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 1 times [2019-11-15 21:14:40,783 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:40,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889346390] [2019-11-15 21:14:40,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:40,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:40,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:40,797 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:14:40,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:40,798 INFO L82 PathProgramCache]: Analyzing trace with hash 180433719, now seen corresponding path program 1 times [2019-11-15 21:14:40,799 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:40,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686164588] [2019-11-15 21:14:40,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:40,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:40,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:40,844 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:14:41,292 WARN L191 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 115 [2019-11-15 21:14:41,480 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-11-15 21:14:41,481 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:14:41,482 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:14:41,482 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:14:41,482 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:14:41,482 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:14:41,482 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:14:41,482 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:14:41,482 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:14:41,482 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca-1.i_Iteration5_Lasso [2019-11-15 21:14:41,482 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:14:41,483 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:14:41,488 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 21:14:41,493 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 21:14:41,495 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 21:14:41,502 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 21:14:41,507 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 21:14:41,509 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 21:14:41,512 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 21:14:41,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 21:14:41,516 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 21:14:41,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 21:14:41,524 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 21:14:41,964 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 99 [2019-11-15 21:14:42,005 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 21:14:42,007 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 21:14:42,010 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 21:14:42,012 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 21:14:42,019 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 21:14:42,020 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 21:14:42,023 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 21:14:42,193 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-15 21:14:42,500 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-15 21:14:43,342 WARN L191 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-11-15 21:14:43,404 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:14:43,404 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:14:43,404 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 21:14:43,405 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:43,405 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:43,405 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:43,405 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:43,406 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:43,406 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:43,408 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:43,408 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 21:14:43,409 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:43,409 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:14:43,409 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:43,409 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:43,409 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:43,409 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:14:43,410 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:14:43,410 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:43,410 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 21:14:43,411 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:43,411 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:43,411 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:43,411 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:43,412 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:43,412 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:43,413 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:43,413 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 21:14:43,414 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:43,414 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:14:43,414 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:43,414 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:43,414 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:43,414 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:14:43,414 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:14:43,415 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:43,415 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 21:14:43,416 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:43,416 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:14:43,416 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:43,416 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:43,416 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:43,416 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:14:43,416 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:14:43,417 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:43,417 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 21:14:43,417 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:43,418 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:43,418 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:43,418 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:43,419 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:43,419 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:43,421 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:43,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:14:43,421 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:43,421 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:14:43,422 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:43,422 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:43,422 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:43,422 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:14:43,422 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:14:43,423 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:43,423 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 21:14:43,423 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:43,424 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:14:43,424 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:43,424 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:43,424 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:43,424 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:14:43,424 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:14:43,425 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:43,425 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 21:14:43,426 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:43,426 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:43,426 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:43,426 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:43,427 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:43,427 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:43,428 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:43,428 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 21:14:43,429 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:43,429 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:14:43,429 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:43,429 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:43,429 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:43,429 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:14:43,430 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:14:43,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:43,430 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 21:14:43,431 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:43,431 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:43,431 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:43,431 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:43,435 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:43,435 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:43,474 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:14:43,521 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 21:14:43,521 INFO L444 ModelExtractionUtils]: 66 out of 73 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 21:14:43,522 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:14:43,522 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:14:43,523 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:14:43,523 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0) = 1*ULTIMATE.start_diff_~l2~0 - 1*ULTIMATE.start_diff_~j~0 Supporting invariants [] [2019-11-15 21:14:43,569 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-11-15 21:14:43,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:43,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:14:43,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:14:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:43,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:14:43,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:14:43,628 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 21:14:43,628 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:14:43,629 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 21:14:43,649 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 38 states and 53 transitions. Complement of second has 7 states. [2019-11-15 21:14:43,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 21:14:43,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:14:43,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-11-15 21:14:43,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-15 21:14:43,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:14:43,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-15 21:14:43,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:14:43,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-15 21:14:43,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:14:43,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2019-11-15 21:14:43,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:14:43,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 27 states and 39 transitions. [2019-11-15 21:14:43,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-15 21:14:43,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-15 21:14:43,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 39 transitions. [2019-11-15 21:14:43,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:14:43,657 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 39 transitions. [2019-11-15 21:14:43,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 39 transitions. [2019-11-15 21:14:43,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2019-11-15 21:14:43,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 21:14:43,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-11-15 21:14:43,660 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-15 21:14:43,660 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-15 21:14:43,660 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 21:14:43,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-11-15 21:14:43,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:14:43,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:14:43,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:14:43,661 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:43,662 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:14:43,662 INFO L791 eck$LassoCheckResult]: Stem: 425#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 416#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 417#L574 assume !(main_~Alen~0 < 1); 422#L574-2 assume !(main_~Blen~0 < 1); 430#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 426#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 427#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 434#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 435#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 432#L557-2 assume !(0 == diff_~found~0); 423#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 424#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 419#L558-2 [2019-11-15 21:14:43,662 INFO L793 eck$LassoCheckResult]: Loop: 419#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 418#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 419#L558-2 [2019-11-15 21:14:43,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:43,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1811575378, now seen corresponding path program 1 times [2019-11-15 21:14:43,662 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:43,663 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005308216] [2019-11-15 21:14:43,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:43,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:43,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:43,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:14:43,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005308216] [2019-11-15 21:14:43,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:43,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:14:43,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647515169] [2019-11-15 21:14:43,689 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:14:43,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:43,690 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 2 times [2019-11-15 21:14:43,690 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:43,690 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788603393] [2019-11-15 21:14:43,690 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:43,690 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:43,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:43,698 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:14:43,760 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:43,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:14:43,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:14:43,760 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-15 21:14:43,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:43,776 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2019-11-15 21:14:43,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:14:43,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2019-11-15 21:14:43,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:14:43,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 31 transitions. [2019-11-15 21:14:43,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-15 21:14:43,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-15 21:14:43,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2019-11-15 21:14:43,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:14:43,779 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-11-15 21:14:43,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2019-11-15 21:14:43,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-11-15 21:14:43,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 21:14:43,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2019-11-15 21:14:43,781 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-11-15 21:14:43,781 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-11-15 21:14:43,782 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 21:14:43,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2019-11-15 21:14:43,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:14:43,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:14:43,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:14:43,783 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:43,783 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:14:43,783 INFO L791 eck$LassoCheckResult]: Stem: 473#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 464#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 465#L574 assume !(main_~Alen~0 < 1); 470#L574-2 assume !(main_~Blen~0 < 1); 478#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 474#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 475#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 483#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 481#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 479#L557-2 assume !(0 == diff_~found~0); 471#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 472#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 467#L558-2 [2019-11-15 21:14:43,783 INFO L793 eck$LassoCheckResult]: Loop: 467#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 466#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 467#L558-2 [2019-11-15 21:14:43,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:43,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1813422420, now seen corresponding path program 2 times [2019-11-15 21:14:43,784 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:43,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076134457] [2019-11-15 21:14:43,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:43,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:43,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:43,804 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:14:43,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:43,804 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 3 times [2019-11-15 21:14:43,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:43,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467102658] [2019-11-15 21:14:43,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:43,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:43,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:43,811 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:14:43,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:43,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1057777617, now seen corresponding path program 1 times [2019-11-15 21:14:43,812 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:43,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252464479] [2019-11-15 21:14:43,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:43,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:43,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:43,850 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:14:44,464 WARN L191 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 137 [2019-11-15 21:14:44,627 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-11-15 21:14:44,629 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:14:44,629 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:14:44,629 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:14:44,629 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:14:44,629 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:14:44,629 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:14:44,629 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:14:44,629 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:14:44,630 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca-1.i_Iteration7_Lasso [2019-11-15 21:14:44,630 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:14:44,630 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:14:44,633 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 21:14:44,646 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 21:14:44,654 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 21:14:45,082 WARN L191 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 102 [2019-11-15 21:14:45,125 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 21:14:45,127 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 21:14:45,129 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 21:14:45,131 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 21:14:45,135 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 21:14:45,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:14:45,139 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 21:14:45,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:14:45,148 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 21:14:45,149 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 21:14:45,152 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 21:14:45,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:14:45,156 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 21:14:45,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:14:45,160 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 21:14:46,288 WARN L191 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-11-15 21:14:46,466 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:14:46,466 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:14:46,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 21:14:46,467 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:46,467 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:14:46,467 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:46,467 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:46,467 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:46,468 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:14:46,468 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:14:46,468 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:46,468 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 21:14:46,469 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:46,469 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:46,469 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:46,469 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:46,470 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:46,470 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:46,471 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:46,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 21:14:46,472 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:46,473 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:46,473 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:46,473 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:46,474 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:46,474 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:46,475 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:46,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 21:14:46,476 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:46,477 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:46,477 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 21:14:46,477 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:46,479 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-15 21:14:46,479 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 21:14:46,488 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:46,488 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 21:14:46,489 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:46,489 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:46,490 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:46,490 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:46,491 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:46,491 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:46,494 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:46,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 21:14:46,495 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:46,495 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:46,496 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:46,496 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:46,496 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:46,497 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:46,498 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:46,498 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 21:14:46,499 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:46,499 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:46,499 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:46,499 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:46,500 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:46,500 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:46,502 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:46,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 21:14:46,503 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:46,503 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-15 21:14:46,503 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:46,503 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:46,509 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-15 21:14:46,509 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:46,538 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:46,539 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 21:14:46,539 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:46,539 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:46,539 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:46,540 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:46,541 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:46,541 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:46,544 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:46,545 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 21:14:46,545 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:46,546 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:46,546 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:46,546 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:46,549 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:46,549 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:46,615 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:14:46,736 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-15 21:14:46,736 INFO L444 ModelExtractionUtils]: 57 out of 64 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 21:14:46,737 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:14:46,738 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:14:46,738 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:14:46,738 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0) = 1*ULTIMATE.start_diff_~l2~0 - 1*ULTIMATE.start_diff_~j~0 Supporting invariants [] [2019-11-15 21:14:46,795 INFO L297 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2019-11-15 21:14:46,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:46,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:14:46,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:14:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:46,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:14:46,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:14:46,851 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 21:14:46,851 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:14:46,851 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 21:14:46,870 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 36 states and 48 transitions. Complement of second has 7 states. [2019-11-15 21:14:46,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 21:14:46,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:14:46,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-11-15 21:14:46,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-15 21:14:46,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:14:46,871 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:14:46,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:46,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:14:46,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:14:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:46,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:14:46,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:14:46,929 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 21:14:46,930 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:14:46,930 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 21:14:46,944 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 36 states and 48 transitions. Complement of second has 7 states. [2019-11-15 21:14:46,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 21:14:46,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:14:46,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-11-15 21:14:46,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-15 21:14:46,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:14:46,946 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:14:46,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:46,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:14:46,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:14:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:46,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:14:46,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:14:47,012 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 21:14:47,012 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:14:47,012 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 21:14:47,037 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 34 states and 49 transitions. Complement of second has 6 states. [2019-11-15 21:14:47,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 21:14:47,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:14:47,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2019-11-15 21:14:47,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-15 21:14:47,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:14:47,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 14 letters. Loop has 2 letters. [2019-11-15 21:14:47,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:14:47,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 12 letters. Loop has 4 letters. [2019-11-15 21:14:47,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:14:47,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 49 transitions. [2019-11-15 21:14:47,041 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:14:47,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2019-11-15 21:14:47,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:14:47,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:14:47,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:14:47,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:14:47,042 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:14:47,042 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:14:47,042 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:14:47,042 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 21:14:47,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:14:47,042 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:14:47,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 21:14:47,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:14:47 BoogieIcfgContainer [2019-11-15 21:14:47,051 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:14:47,051 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:14:47,051 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:14:47,052 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:14:47,052 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:14:35" (3/4) ... [2019-11-15 21:14:47,056 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:14:47,057 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:14:47,059 INFO L168 Benchmark]: Toolchain (without parser) took 12142.78 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.6 MB). Free memory was 939.4 MB in the beginning and 1.2 GB in the end (delta: -248.0 MB). Peak memory consumption was 66.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:14:47,060 INFO L168 Benchmark]: CDTParser took 0.29 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 21:14:47,065 INFO L168 Benchmark]: CACSL2BoogieTranslator took 656.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Free memory was 939.4 MB in the beginning and 1.2 GB in the end (delta: -236.3 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:14:47,066 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:14:47,066 INFO L168 Benchmark]: Boogie Preprocessor took 25.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:14:47,067 INFO L168 Benchmark]: RCFGBuilder took 358.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:14:47,067 INFO L168 Benchmark]: BuchiAutomizer took 11054.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 121.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -39.4 MB). Peak memory consumption was 82.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:14:47,068 INFO L168 Benchmark]: Witness Printer took 5.46 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:14:47,077 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.29 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 656.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Free memory was 939.4 MB in the beginning and 1.2 GB in the end (delta: -236.3 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 358.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11054.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 121.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -39.4 MB). Peak memory consumption was 82.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.46 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + l1 and consists of 3 locations. One deterministic module has affine ranking function l2 + -1 * j and consists of 4 locations. One nondeterministic module has affine ranking function l2 + -1 * j and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.0s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 10.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 127 SDtfs, 117 SDslu, 59 SDs, 0 SdLazy, 73 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital273 mio100 ax106 hnf99 lsp84 ukn88 mio100 lsp48 div100 bol100 ite100 ukn100 eq185 hnf89 smp100 dnf382 smp95 tf100 neg95 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 148ms VariablesStem: 13 VariablesLoop: 4 DisjunctsStem: 8 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 20 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...