./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9b765fc6-05dc-4adf-aae7-9f64bcc4b5d1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9b765fc6-05dc-4adf-aae7-9f64bcc4b5d1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9b765fc6-05dc-4adf-aae7-9f64bcc4b5d1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9b765fc6-05dc-4adf-aae7-9f64bcc4b5d1/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9b765fc6-05dc-4adf-aae7-9f64bcc4b5d1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9b765fc6-05dc-4adf-aae7-9f64bcc4b5d1/bin-2019/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 713a0db238d04edd758f664dd8a5a1ba1d1680db ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:16:54,730 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:16:54,732 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:16:54,739 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:16:54,739 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:16:54,740 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:16:54,741 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:16:54,742 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:16:54,743 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:16:54,744 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:16:54,745 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:16:54,745 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:16:54,745 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:16:54,746 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:16:54,747 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:16:54,747 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:16:54,748 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:16:54,749 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:16:54,751 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:16:54,752 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:16:54,752 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:16:54,753 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:16:54,755 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:16:54,755 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:16:54,755 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:16:54,756 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:16:54,756 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:16:54,757 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:16:54,758 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:16:54,758 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:16:54,759 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:16:54,759 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:16:54,759 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:16:54,759 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:16:54,760 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:16:54,760 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:16:54,761 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9b765fc6-05dc-4adf-aae7-9f64bcc4b5d1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 12:16:54,772 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:16:54,772 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:16:54,773 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:16:54,773 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:16:54,773 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:16:54,774 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:16:54,774 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:16:54,774 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:16:54,774 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:16:54,774 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:16:54,774 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:16:54,774 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:16:54,775 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:16:54,775 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:16:54,775 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:16:54,775 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:16:54,775 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:16:54,775 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:16:54,775 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:16:54,776 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:16:54,776 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:16:54,776 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:16:54,776 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:16:54,776 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:16:54,776 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:16:54,777 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:16:54,777 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:16:54,777 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:16:54,778 INFO L133 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/working_dir_9b765fc6-05dc-4adf-aae7-9f64bcc4b5d1/bin-2019/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 -> 713a0db238d04edd758f664dd8a5a1ba1d1680db [2018-11-10 12:16:54,801 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:16:54,811 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:16:54,813 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:16:54,814 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:16:54,815 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:16:54,815 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9b765fc6-05dc-4adf-aae7-9f64bcc4b5d1/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-10 12:16:54,858 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9b765fc6-05dc-4adf-aae7-9f64bcc4b5d1/bin-2019/uautomizer/data/c083435bd/01c127dc071747a9852767ed069bf0d6/FLAGe77d4d45e [2018-11-10 12:16:55,286 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:16:55,287 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9b765fc6-05dc-4adf-aae7-9f64bcc4b5d1/sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-10 12:16:55,293 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9b765fc6-05dc-4adf-aae7-9f64bcc4b5d1/bin-2019/uautomizer/data/c083435bd/01c127dc071747a9852767ed069bf0d6/FLAGe77d4d45e [2018-11-10 12:16:55,301 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9b765fc6-05dc-4adf-aae7-9f64bcc4b5d1/bin-2019/uautomizer/data/c083435bd/01c127dc071747a9852767ed069bf0d6 [2018-11-10 12:16:55,303 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:16:55,303 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:16:55,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:16:55,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:16:55,306 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:16:55,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:16:55" (1/1) ... [2018-11-10 12:16:55,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4f6b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:16:55, skipping insertion in model container [2018-11-10 12:16:55,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:16:55" (1/1) ... [2018-11-10 12:16:55,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:16:55,339 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:16:55,513 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:16:55,521 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:16:55,543 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:16:55,572 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:16:55,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:16:55 WrapperNode [2018-11-10 12:16:55,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:16:55,572 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:16:55,572 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:16:55,573 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:16:55,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:16:55" (1/1) ... [2018-11-10 12:16:55,627 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:16:55" (1/1) ... [2018-11-10 12:16:55,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:16:55,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:16:55,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:16:55,643 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:16:55,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:16:55" (1/1) ... [2018-11-10 12:16:55,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:16:55" (1/1) ... [2018-11-10 12:16:55,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:16:55" (1/1) ... [2018-11-10 12:16:55,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:16:55" (1/1) ... [2018-11-10 12:16:55,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:16:55" (1/1) ... [2018-11-10 12:16:55,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:16:55" (1/1) ... [2018-11-10 12:16:55,657 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:16:55" (1/1) ... [2018-11-10 12:16:55,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:16:55,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:16:55,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:16:55,659 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:16:55,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:16:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b765fc6-05dc-4adf-aae7-9f64bcc4b5d1/bin-2019/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 [2018-11-10 12:16:55,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 12:16:55,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 12:16:55,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:16:55,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:16:55,898 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:16:55,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:16:55 BoogieIcfgContainer [2018-11-10 12:16:55,899 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:16:55,899 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:16:55,899 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:16:55,902 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:16:55,903 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:16:55,903 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:16:55" (1/3) ... [2018-11-10 12:16:55,904 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c4cc147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:16:55, skipping insertion in model container [2018-11-10 12:16:55,904 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:16:55,904 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:16:55" (2/3) ... [2018-11-10 12:16:55,905 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c4cc147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:16:55, skipping insertion in model container [2018-11-10 12:16:55,905 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:16:55,905 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:16:55" (3/3) ... [2018-11-10 12:16:55,906 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.09-no-inv_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-10 12:16:55,942 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:16:55,942 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:16:55,942 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:16:55,942 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:16:55,943 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:16:55,943 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:16:55,943 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:16:55,943 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:16:55,943 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:16:55,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-11-10 12:16:55,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:16:55,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:16:55,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:16:55,969 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:16:55,969 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:16:55,969 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:16:55,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-11-10 12:16:55,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:16:55,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:16:55,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:16:55,972 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:16:55,972 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:16:55,979 INFO L793 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet15, main_#t~nondet16;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem8, test_fun_#t~mem14, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 12#L552true SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 13#L552-1true SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 24#L553true SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 21#L554true SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L554 6#L555true test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 9#L555-1true assume test_fun_#t~short7; 31#L555-5true assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 22#L558-4true [2018-11-10 12:16:55,979 INFO L795 eck$LassoCheckResult]: Loop: 22#L558-4true assume true; 19#L558-1true SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-1 20#L558-2true assume !!!(test_fun_#t~mem8 == 0);havoc test_fun_#t~mem8; 16#L559true SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 3#L559-1true SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 4#L559-2true assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 32#L560true SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560 34#L560-1true SUMMARY for call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560-1 18#L560-2true havoc test_fun_#t~mem11; 7#L559-4true SUMMARY for call test_fun_#t~mem13 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L559-4 23#L564true SUMMARY for call write~int(test_fun_#t~mem13 + 1, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L564 26#L564-1true havoc test_fun_#t~mem13; 22#L558-4true [2018-11-10 12:16:55,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:16:55,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1775970924, now seen corresponding path program 1 times [2018-11-10 12:16:55,986 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:16:55,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:16:56,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:56,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:16:56,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:16:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:16:56,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:16:56,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:16:56,099 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:16:56,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:16:56,099 INFO L82 PathProgramCache]: Analyzing trace with hash -108291856, now seen corresponding path program 1 times [2018-11-10 12:16:56,099 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:16:56,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:16:56,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:56,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:16:56,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:16:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:16:56,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:16:56,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:16:56,284 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-11-10 12:16:56,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:16:56,299 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-10 12:16:56,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:16:56,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2018-11-10 12:16:56,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:16:56,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 26 states and 27 transitions. [2018-11-10 12:16:56,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-10 12:16:56,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-10 12:16:56,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 27 transitions. [2018-11-10 12:16:56,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:16:56,307 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-10 12:16:56,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 27 transitions. [2018-11-10 12:16:56,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-10 12:16:56,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-10 12:16:56,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-10 12:16:56,327 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-10 12:16:56,327 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-10 12:16:56,327 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:16:56,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 27 transitions. [2018-11-10 12:16:56,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:16:56,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:16:56,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:16:56,329 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:16:56,329 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:16:56,329 INFO L793 eck$LassoCheckResult]: Stem: 94#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 83#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet15, main_#t~nondet16;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem8, test_fun_#t~mem14, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 84#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 85#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 86#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 91#L554 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L554 80#L555 test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 81#L555-1 assume !test_fun_#t~short7; 82#L555-3 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 95#L555-4 test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 97#L555-5 assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 92#L558-4 [2018-11-10 12:16:56,330 INFO L795 eck$LassoCheckResult]: Loop: 92#L558-4 assume true; 89#L558-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-1 90#L558-2 assume !!!(test_fun_#t~mem8 == 0);havoc test_fun_#t~mem8; 87#L559 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 74#L559-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 75#L559-2 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 76#L560 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560 99#L560-1 SUMMARY for call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560-1 88#L560-2 havoc test_fun_#t~mem11; 78#L559-4 SUMMARY for call test_fun_#t~mem13 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L559-4 79#L564 SUMMARY for call write~int(test_fun_#t~mem13 + 1, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L564 93#L564-1 havoc test_fun_#t~mem13; 92#L558-4 [2018-11-10 12:16:56,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:16:56,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1606094761, now seen corresponding path program 1 times [2018-11-10 12:16:56,332 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:16:56,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:16:56,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:56,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:16:56,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:16:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:16:56,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:16:56,372 INFO L82 PathProgramCache]: Analyzing trace with hash -108291856, now seen corresponding path program 2 times [2018-11-10 12:16:56,372 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:16:56,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:16:56,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:56,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:16:56,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:16:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:16:56,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:16:56,392 INFO L82 PathProgramCache]: Analyzing trace with hash -870028136, now seen corresponding path program 1 times [2018-11-10 12:16:56,392 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:16:56,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:16:56,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:56,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:16:56,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:16:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:16:56,844 WARN L179 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 111 [2018-11-10 12:16:56,959 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:16:56,960 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:16:56,960 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:16:56,960 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:16:56,960 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:16:56,960 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:16:56,960 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:16:56,961 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:16:56,961 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09-no-inv_assume-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-10 12:16:56,961 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:16:56,961 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:16:56,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:16:56,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:16:56,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:16:56,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:16:56,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:16:56,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:16:56,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:16:56,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:16:57,317 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 106 [2018-11-10 12:16:57,428 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2018-11-10 12:16:57,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:16:57,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:16:57,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:16:57,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:16:57,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:16:57,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:16:57,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:16:57,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:16:57,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:16:57,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:16:57,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:16:57,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:16:57,905 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:16:57,910 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:16:57,912 INFO L122 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 [2018-11-10 12:16:57,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:16:57,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:16:57,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:16:57,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:16:57,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:16:57,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:16:57,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:16:57,916 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:16:57,917 INFO L122 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 [2018-11-10 12:16:57,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:16:57,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:16:57,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:16:57,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:16:57,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:16:57,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:16:57,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:16:57,919 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:16:57,919 INFO L122 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 [2018-11-10 12:16:57,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:16:57,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:16:57,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:16:57,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:16:57,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:16:57,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:16:57,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:16:57,923 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:16:57,923 INFO L122 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 [2018-11-10 12:16:57,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:16:57,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:16:57,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:16:57,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:16:57,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:16:57,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:16:57,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:16:57,925 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:16:57,925 INFO L122 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 [2018-11-10 12:16:57,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:16:57,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:16:57,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:16:57,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:16:57,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:16:57,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:16:57,930 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:16:57,930 INFO L122 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 [2018-11-10 12:16:57,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:16:57,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:16:57,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:16:57,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:16:57,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:16:57,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:16:57,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:16:57,932 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:16:57,933 INFO L122 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 [2018-11-10 12:16:57,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:16:57,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:16:57,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:16:57,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:16:57,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:16:57,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:16:57,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:16:57,935 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:16:57,935 INFO L122 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 [2018-11-10 12:16:57,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:16:57,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:16:57,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:16:57,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:16:57,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:16:57,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:16:57,941 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:16:57,942 INFO L122 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 [2018-11-10 12:16:57,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:16:57,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:16:57,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:16:57,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:16:57,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:16:57,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:16:57,959 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:16:57,960 INFO L122 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 [2018-11-10 12:16:57,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:16:57,960 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:16:57,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:16:57,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:16:57,964 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:16:57,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:16:57,970 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:16:57,971 INFO L122 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 [2018-11-10 12:16:57,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:16:57,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:16:57,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:16:57,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:16:57,973 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:16:57,973 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:16:57,977 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:16:57,977 INFO L122 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 [2018-11-10 12:16:57,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:16:57,978 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:16:57,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:16:57,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:16:57,980 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:16:57,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:16:57,989 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:16:57,989 INFO L122 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 [2018-11-10 12:16:57,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:16:57,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:16:57,990 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:16:57,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:16:57,998 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-10 12:16:57,998 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 12:16:58,062 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:16:58,080 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:16:58,080 INFO L444 ModelExtractionUtils]: 42 out of 46 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 12:16:58,082 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:16:58,084 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-10 12:16:58,085 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:16:58,085 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2018-11-10 12:16:58,155 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 12:16:58,161 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:16:58,162 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:16:58,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:16:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:16:58,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:16:58,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 12:16:58,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:16:58,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:16:58,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:16:58,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:16:58,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-10 12:16:58,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2018-11-10 12:16:58,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 12:16:58,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:16:58,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-11-10 12:16:58,296 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:16:58,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:16:58,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:16:58,307 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-11-10 12:16:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:16:58,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:16:58,439 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:16:58,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 55 [2018-11-10 12:16:58,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2018-11-10 12:16:58,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 12:16:58,477 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:16:58,478 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:16:58,479 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:16:58,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 52 [2018-11-10 12:16:58,481 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 12:16:58,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:16:58,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:16:58,509 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:56 [2018-11-10 12:16:58,566 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:16:58,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 56 [2018-11-10 12:16:58,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-10 12:16:58,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:16:58,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:16:58,614 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:16:58,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 68 [2018-11-10 12:16:58,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 52 [2018-11-10 12:16:58,632 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:16:58,665 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:16:58,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 58 [2018-11-10 12:16:58,675 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-11-10 12:16:58,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 12:16:58,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 12:16:58,748 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:96, output treesize:112 [2018-11-10 12:16:58,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:16:58,765 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 7 loop predicates [2018-11-10 12:16:58,766 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 27 transitions. cyclomatic complexity: 2 Second operand 14 states. [2018-11-10 12:16:58,898 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 27 transitions. cyclomatic complexity: 2. Second operand 14 states. Result 50 states and 52 transitions. Complement of second has 15 states. [2018-11-10 12:16:58,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 3 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 12:16:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-10 12:16:58,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2018-11-10 12:16:58,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 23 transitions. Stem has 11 letters. Loop has 12 letters. [2018-11-10 12:16:58,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:16:58,903 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:16:58,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:16:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:16:58,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:16:58,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 12:16:58,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:16:58,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:16:58,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:16:58,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:16:58,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-10 12:16:58,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2018-11-10 12:16:58,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-11-10 12:16:58,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:16:58,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 12:16:58,987 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:16:58,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:16:58,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:16:58,993 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-11-10 12:16:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:16:59,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:16:59,114 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:16:59,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2018-11-10 12:16:59,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-11-10 12:16:59,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:16:59,142 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:16:59,143 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:16:59,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 45 [2018-11-10 12:16:59,144 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:16:59,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:16:59,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:16:59,163 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:49, output treesize:56 [2018-11-10 12:16:59,219 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:16:59,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 68 [2018-11-10 12:16:59,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 52 [2018-11-10 12:16:59,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:16:59,263 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:16:59,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 59 [2018-11-10 12:16:59,271 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-10 12:16:59,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 12:16:59,339 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:16:59,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 56 [2018-11-10 12:16:59,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-10 12:16:59,343 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 12:16:59,351 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:16:59,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 12:16:59,384 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:96, output treesize:112 [2018-11-10 12:16:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:16:59,455 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 8 loop predicates [2018-11-10 12:16:59,456 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 27 transitions. cyclomatic complexity: 2 Second operand 15 states. [2018-11-10 12:16:59,615 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 27 transitions. cyclomatic complexity: 2. Second operand 15 states. Result 54 states and 57 transitions. Complement of second has 21 states. [2018-11-10 12:16:59,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 3 stem states 8 non-accepting loop states 1 accepting loop states [2018-11-10 12:16:59,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-10 12:16:59,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2018-11-10 12:16:59,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 25 transitions. Stem has 11 letters. Loop has 12 letters. [2018-11-10 12:16:59,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:16:59,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 25 transitions. Stem has 23 letters. Loop has 12 letters. [2018-11-10 12:16:59,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:16:59,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 25 transitions. Stem has 11 letters. Loop has 24 letters. [2018-11-10 12:16:59,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:16:59,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 57 transitions. [2018-11-10 12:16:59,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:16:59,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 46 states and 49 transitions. [2018-11-10 12:16:59,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-10 12:16:59,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-11-10 12:16:59,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 49 transitions. [2018-11-10 12:16:59,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:16:59,620 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-11-10 12:16:59,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 49 transitions. [2018-11-10 12:16:59,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-11-10 12:16:59,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-10 12:16:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-11-10 12:16:59,623 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-11-10 12:16:59,623 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-11-10 12:16:59,623 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 12:16:59,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 47 transitions. [2018-11-10 12:16:59,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:16:59,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:16:59,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:16:59,624 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:16:59,624 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:16:59,624 INFO L793 eck$LassoCheckResult]: Stem: 567#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 549#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet15, main_#t~nondet16;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem8, test_fun_#t~mem14, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 550#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 551#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 552#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 561#L554 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L554 542#L555 test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 543#L555-1 assume !test_fun_#t~short7; 548#L555-3 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 568#L555-4 test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 570#L555-5 assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 572#L558-4 assume true; 557#L558-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-1 558#L558-2 assume !!!(test_fun_#t~mem8 == 0);havoc test_fun_#t~mem8; 553#L559 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 536#L559-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 537#L559-2 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 540#L562 [2018-11-10 12:16:59,625 INFO L795 eck$LassoCheckResult]: Loop: 540#L562 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L562 569#L562-1 SUMMARY for call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L562-1 571#L562-2 havoc test_fun_#t~mem12; 544#L559-4 SUMMARY for call test_fun_#t~mem13 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L559-4 545#L564 SUMMARY for call write~int(test_fun_#t~mem13 + 1, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L564 565#L564-1 havoc test_fun_#t~mem13; 562#L558-4 assume true; 563#L558-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-1 579#L558-2 assume !!!(test_fun_#t~mem8 == 0);havoc test_fun_#t~mem8; 578#L559 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 577#L559-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 576#L559-2 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 540#L562 [2018-11-10 12:16:59,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:16:59,625 INFO L82 PathProgramCache]: Analyzing trace with hash -77450572, now seen corresponding path program 1 times [2018-11-10 12:16:59,625 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:16:59,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:16:59,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:59,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:16:59,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:16:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:16:59,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:16:59,648 INFO L82 PathProgramCache]: Analyzing trace with hash -51302160, now seen corresponding path program 1 times [2018-11-10 12:16:59,648 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:16:59,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:16:59,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:59,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:16:59,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:16:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:16:59,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:16:59,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1379266339, now seen corresponding path program 1 times [2018-11-10 12:16:59,661 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:16:59,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:16:59,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:59,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:16:59,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:16:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:17:00,019 WARN L179 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 120 [2018-11-10 12:17:00,114 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:17:00,114 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:17:00,114 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:17:00,114 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:17:00,115 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:17:00,115 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:17:00,115 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:17:00,115 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:17:00,115 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09-no-inv_assume-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-10 12:17:00,115 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:17:00,115 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:17:00,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:00,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:00,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:00,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:00,391 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 104 [2018-11-10 12:17:00,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:00,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:00,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:00,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:00,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:00,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:00,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:00,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:00,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:00,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:00,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:00,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:00,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:00,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:00,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:00,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:00,940 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:17:00,941 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:17:00,941 INFO L122 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 [2018-11-10 12:17:00,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:00,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:17:00,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:00,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:00,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:00,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:17:00,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:17:00,944 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:00,944 INFO L122 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 [2018-11-10 12:17:00,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:00,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:17:00,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:00,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:00,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:00,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:17:00,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:17:00,946 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:00,946 INFO L122 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 [2018-11-10 12:17:00,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:00,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:17:00,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:00,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:00,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:00,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:17:00,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:17:00,951 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:00,951 INFO L122 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 [2018-11-10 12:17:00,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:00,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:00,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:00,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:00,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:17:00,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:17:00,954 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:00,955 INFO L122 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 [2018-11-10 12:17:00,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:00,955 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:17:00,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:00,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:00,956 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:17:00,956 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:17:00,960 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:00,960 INFO L122 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 [2018-11-10 12:17:00,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:00,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:00,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:00,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:00,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:17:00,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:17:00,964 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:00,964 INFO L122 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 [2018-11-10 12:17:00,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:00,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:00,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:00,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:00,965 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:17:00,965 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:17:00,969 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:00,969 INFO L122 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 [2018-11-10 12:17:00,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:00,969 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:17:00,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:00,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:00,971 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:17:00,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:17:00,975 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:00,975 INFO L122 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 [2018-11-10 12:17:00,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:00,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:00,976 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:17:00,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:00,980 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-10 12:17:00,980 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 12:17:01,014 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:17:01,041 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 12:17:01,041 INFO L444 ModelExtractionUtils]: 38 out of 46 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 12:17:01,041 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:17:01,043 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2018-11-10 12:17:01,043 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:17:01,043 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 - 1 >= 0] [2018-11-10 12:17:01,124 INFO L297 tatePredicateManager]: 22 out of 25 supporting invariants were superfluous and have been removed [2018-11-10 12:17:01,129 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:17:01,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:17:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:17:01,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:17:01,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 12:17:01,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:17:01,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:01,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:01,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:01,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-10 12:17:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:17:01,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:17:01,334 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:17:01,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-11-10 12:17:01,339 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:17:01,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-11-10 12:17:01,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:01,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:01,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:01,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:28 [2018-11-10 12:17:01,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-11-10 12:17:01,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 12:17:01,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:01,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:01,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:01,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:28 [2018-11-10 12:17:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:17:01,440 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 5 loop predicates [2018-11-10 12:17:01,441 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 47 transitions. cyclomatic complexity: 5 Second operand 12 states. [2018-11-10 12:17:01,675 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 47 transitions. cyclomatic complexity: 5. Second operand 12 states. Result 66 states and 69 transitions. Complement of second has 14 states. [2018-11-10 12:17:01,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 9 stem states 1 non-accepting loop states 2 accepting loop states [2018-11-10 12:17:01,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 12:17:01,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 38 transitions. [2018-11-10 12:17:01,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 38 transitions. Stem has 17 letters. Loop has 12 letters. [2018-11-10 12:17:01,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:17:01,676 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:17:01,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:17:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:17:01,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:17:01,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 12:17:01,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:17:01,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:01,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:01,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:01,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-10 12:17:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:17:01,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:17:01,817 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:17:01,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-11-10 12:17:01,820 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:17:01,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-11-10 12:17:01,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:01,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:01,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:01,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:28 [2018-11-10 12:17:01,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-11-10 12:17:01,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 12:17:01,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:01,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:01,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:01,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:28 [2018-11-10 12:17:01,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:17:01,904 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 5 loop predicates [2018-11-10 12:17:01,904 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 47 transitions. cyclomatic complexity: 5 Second operand 12 states. [2018-11-10 12:17:02,183 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 47 transitions. cyclomatic complexity: 5. Second operand 12 states. Result 90 states and 95 transitions. Complement of second has 20 states. [2018-11-10 12:17:02,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 9 stem states 5 non-accepting loop states 2 accepting loop states [2018-11-10 12:17:02,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 12:17:02,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 51 transitions. [2018-11-10 12:17:02,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 51 transitions. Stem has 17 letters. Loop has 12 letters. [2018-11-10 12:17:02,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:17:02,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 51 transitions. Stem has 29 letters. Loop has 12 letters. [2018-11-10 12:17:02,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:17:02,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 51 transitions. Stem has 17 letters. Loop has 24 letters. [2018-11-10 12:17:02,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:17:02,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 95 transitions. [2018-11-10 12:17:02,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:17:02,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 78 states and 82 transitions. [2018-11-10 12:17:02,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-10 12:17:02,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-11-10 12:17:02,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 82 transitions. [2018-11-10 12:17:02,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:17:02,189 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 82 transitions. [2018-11-10 12:17:02,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 82 transitions. [2018-11-10 12:17:02,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2018-11-10 12:17:02,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-10 12:17:02,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-11-10 12:17:02,192 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-11-10 12:17:02,192 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-11-10 12:17:02,193 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 12:17:02,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 68 transitions. [2018-11-10 12:17:02,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:17:02,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:17:02,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:17:02,194 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:17:02,195 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:17:02,195 INFO L793 eck$LassoCheckResult]: Stem: 1158#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1139#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet15, main_#t~nondet16;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem8, test_fun_#t~mem14, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 1140#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 1141#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 1142#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 1155#L554 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L554 1136#L555 test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 1137#L555-1 assume !test_fun_#t~short7; 1138#L555-3 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 1159#L555-4 test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 1163#L555-5 assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 1166#L558-4 assume true; 1176#L558-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-1 1175#L558-2 assume !!!(test_fun_#t~mem8 == 0);havoc test_fun_#t~mem8; 1174#L559 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 1173#L559-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 1172#L559-2 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 1171#L562 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L562 1162#L562-1 SUMMARY for call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L562-1 1165#L562-2 havoc test_fun_#t~mem12; 1170#L559-4 SUMMARY for call test_fun_#t~mem13 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L559-4 1185#L564 SUMMARY for call write~int(test_fun_#t~mem13 + 1, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L564 1184#L564-1 havoc test_fun_#t~mem13; 1183#L558-4 assume true; 1182#L558-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-1 1181#L558-2 assume !!!(test_fun_#t~mem8 == 0);havoc test_fun_#t~mem8; 1179#L559 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 1180#L559-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 1186#L559-2 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 1167#L560 [2018-11-10 12:17:02,195 INFO L795 eck$LassoCheckResult]: Loop: 1167#L560 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560 1168#L560-1 SUMMARY for call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560-1 1145#L560-2 havoc test_fun_#t~mem11; 1132#L559-4 SUMMARY for call test_fun_#t~mem13 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L559-4 1133#L564 SUMMARY for call write~int(test_fun_#t~mem13 + 1, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L564 1156#L564-1 havoc test_fun_#t~mem13; 1152#L558-4 assume true; 1147#L558-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-1 1148#L558-2 assume !!!(test_fun_#t~mem8 == 0);havoc test_fun_#t~mem8; 1151#L559 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 1187#L559-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 1188#L559-2 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 1167#L560 [2018-11-10 12:17:02,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:17:02,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1379266334, now seen corresponding path program 1 times [2018-11-10 12:17:02,195 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:17:02,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:17:02,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:02,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:17:02,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:17:02,469 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:17:02,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:17:02,469 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b765fc6-05dc-4adf-aae7-9f64bcc4b5d1/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:17:02,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:17:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:17:02,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:17:02,536 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:17:02,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 12:17:02,567 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:17:02,568 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:17:02,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 12:17:02,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:02,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:02,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:02,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2018-11-10 12:17:02,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 12:17:02,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:17:02,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:02,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:02,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:02,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2018-11-10 12:17:02,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 12:17:02,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:17:02,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:02,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:02,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:02,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-11-10 12:17:02,814 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:17:02,815 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:17:02,817 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:17:02,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 64 [2018-11-10 12:17:02,831 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 57 [2018-11-10 12:17:02,834 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 3 dim-0 vars, and 7 xjuncts. [2018-11-10 12:17:02,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:17:02,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:17:02,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:91 [2018-11-10 12:17:02,927 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:17:02,928 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:17:02,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 59 [2018-11-10 12:17:02,942 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 37 [2018-11-10 12:17:02,943 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 12:17:02,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:02,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 51 [2018-11-10 12:17:02,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-10 12:17:02,984 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:02,991 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:03,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:17:03,009 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:111, output treesize:59 [2018-11-10 12:17:03,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-11-10 12:17:03,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 12:17:03,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:03,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-11-10 12:17:03,094 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:03,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:03,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-11-10 12:17:03,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-11-10 12:17:03,114 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:03,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-10 12:17:03,119 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:03,123 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:03,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:17:03,130 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:81, output treesize:21 [2018-11-10 12:17:03,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:17:03,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:17:03,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 27 [2018-11-10 12:17:03,176 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:17:03,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:17:03,176 INFO L82 PathProgramCache]: Analyzing trace with hash 680673968, now seen corresponding path program 3 times [2018-11-10 12:17:03,176 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:17:03,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:17:03,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:03,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:17:03,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:17:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:17:03,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-10 12:17:03,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2018-11-10 12:17:03,266 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. cyclomatic complexity: 7 Second operand 28 states. [2018-11-10 12:17:03,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:17:03,976 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2018-11-10 12:17:03,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 12:17:03,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 90 transitions. [2018-11-10 12:17:03,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 12:17:03,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 53 states and 54 transitions. [2018-11-10 12:17:03,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-10 12:17:03,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-10 12:17:03,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 54 transitions. [2018-11-10 12:17:03,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:17:03,980 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-11-10 12:17:03,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 54 transitions. [2018-11-10 12:17:03,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2018-11-10 12:17:03,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 12:17:03,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-10 12:17:03,982 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-10 12:17:03,982 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-10 12:17:03,982 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 12:17:03,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 37 transitions. [2018-11-10 12:17:03,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 12:17:03,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:17:03,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:17:03,983 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:17:03,983 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:17:03,984 INFO L793 eck$LassoCheckResult]: Stem: 1452#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1436#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet15, main_#t~nondet16;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem8, test_fun_#t~mem14, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 1437#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 1438#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 1439#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 1447#L554 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L554 1429#L555 test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 1430#L555-1 assume !test_fun_#t~short7; 1435#L555-3 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 1454#L555-4 test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 1456#L555-5 assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 1448#L558-4 assume true; 1445#L558-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-1 1446#L558-2 assume !!!(test_fun_#t~mem8 == 0);havoc test_fun_#t~mem8; 1441#L559 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 1425#L559-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 1426#L559-2 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 1428#L560 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560 1458#L560-1 SUMMARY for call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560-1 1442#L560-2 havoc test_fun_#t~mem11; 1433#L559-4 SUMMARY for call test_fun_#t~mem13 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L559-4 1434#L564 SUMMARY for call write~int(test_fun_#t~mem13 + 1, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L564 1451#L564-1 havoc test_fun_#t~mem13; 1449#L558-4 assume true; 1443#L558-1 [2018-11-10 12:17:03,984 INFO L795 eck$LassoCheckResult]: Loop: 1443#L558-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-1 1444#L558-2 assume !!!(test_fun_#t~mem8 == 0);havoc test_fun_#t~mem8; 1440#L559 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 1423#L559-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 1424#L559-2 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 1427#L562 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L562 1455#L562-1 SUMMARY for call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L562-1 1457#L562-2 havoc test_fun_#t~mem12; 1431#L559-4 SUMMARY for call test_fun_#t~mem13 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L559-4 1432#L564 SUMMARY for call write~int(test_fun_#t~mem13 + 1, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L564 1450#L564-1 havoc test_fun_#t~mem13; 1453#L558-4 assume true; 1443#L558-1 [2018-11-10 12:17:03,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:17:03,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1201068416, now seen corresponding path program 2 times [2018-11-10 12:17:03,984 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:17:03,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:17:03,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:03,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:17:03,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:17:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:17:03,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:17:03,998 INFO L82 PathProgramCache]: Analyzing trace with hash 16244530, now seen corresponding path program 2 times [2018-11-10 12:17:03,998 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:17:03,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:17:03,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:03,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:17:03,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:17:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:17:04,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:17:04,006 INFO L82 PathProgramCache]: Analyzing trace with hash 702037809, now seen corresponding path program 1 times [2018-11-10 12:17:04,006 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:17:04,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:17:04,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:04,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:17:04,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:17:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:17:04,509 WARN L179 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 134 [2018-11-10 12:17:04,699 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2018-11-10 12:17:04,701 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:17:04,701 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:17:04,701 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:17:04,701 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:17:04,702 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:17:04,702 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:17:04,702 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:17:04,702 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:17:04,702 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09-no-inv_assume-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-10 12:17:04,702 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:17:04,702 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:17:04,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:04,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:04,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:04,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:04,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:04,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:04,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:04,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:04,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:04,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:04,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:04,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:04,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:04,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:04,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:04,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:04,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:04,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:04,981 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 104 [2018-11-10 12:17:05,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:05,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:05,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:05,452 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:17:05,452 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:17:05,452 INFO L122 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 [2018-11-10 12:17:05,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:17:05,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:05,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:17:05,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:17:05,454 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,455 INFO L122 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 [2018-11-10 12:17:05,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:17:05,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:05,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:17:05,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:17:05,456 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,456 INFO L122 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 [2018-11-10 12:17:05,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:17:05,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:05,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:17:05,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:17:05,457 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,457 INFO L122 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 [2018-11-10 12:17:05,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:05,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:17:05,458 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:17:05,459 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,459 INFO L122 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 [2018-11-10 12:17:05,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:17:05,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:05,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:17:05,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:17:05,461 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,461 INFO L122 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 [2018-11-10 12:17:05,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:17:05,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:05,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:17:05,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:17:05,462 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,462 INFO L122 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 [2018-11-10 12:17:05,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:17:05,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:05,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:17:05,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:17:05,464 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,464 INFO L122 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 [2018-11-10 12:17:05,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:05,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:17:05,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:17:05,472 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,472 INFO L122 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 [2018-11-10 12:17:05,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:17:05,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:05,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:17:05,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:17:05,474 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,474 INFO L122 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 [2018-11-10 12:17:05,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:05,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:17:05,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:17:05,476 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,476 INFO L122 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 [2018-11-10 12:17:05,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:05,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:17:05,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:17:05,480 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,480 INFO L122 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 [2018-11-10 12:17:05,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:17:05,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:05,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:17:05,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:17:05,482 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,482 INFO L122 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 [2018-11-10 12:17:05,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:17:05,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:05,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:17:05,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:17:05,484 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,484 INFO L122 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 [2018-11-10 12:17:05,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:05,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:17:05,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:17:05,486 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,492 INFO L122 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 [2018-11-10 12:17:05,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:05,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:17:05,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:17:05,495 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,495 INFO L122 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 [2018-11-10 12:17:05,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:17:05,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:05,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:17:05,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:17:05,497 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,497 INFO L122 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 [2018-11-10 12:17:05,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:17:05,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:05,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:17:05,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:17:05,501 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,502 INFO L122 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 [2018-11-10 12:17:05,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:05,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:17:05,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:17:05,504 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,505 INFO L122 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 [2018-11-10 12:17:05,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:05,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,506 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:17:05,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:17:05,510 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,510 INFO L122 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 [2018-11-10 12:17:05,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:05,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:17:05,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:17:05,514 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,515 INFO L122 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 [2018-11-10 12:17:05,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,515 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:17:05,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,516 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:17:05,516 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:17:05,518 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,519 INFO L122 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 [2018-11-10 12:17:05,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:05,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,521 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:17:05,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:17:05,533 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,534 INFO L122 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 [2018-11-10 12:17:05,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:05,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,538 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:17:05,538 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:17:05,539 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,540 INFO L122 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 [2018-11-10 12:17:05,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,540 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:17:05,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,541 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:17:05,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:17:05,544 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,544 INFO L122 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 [2018-11-10 12:17:05,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:05,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:17:05,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:17:05,547 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,547 INFO L122 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 [2018-11-10 12:17:05,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:05,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:17:05,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:17:05,552 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,552 INFO L122 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 [2018-11-10 12:17:05,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:05,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:17:05,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:17:05,559 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,559 INFO L122 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 [2018-11-10 12:17:05,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,560 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:17:05,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:05,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,560 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:17:05,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:17:05,567 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:05,567 INFO L122 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 [2018-11-10 12:17:05,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:05,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:05,568 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:17:05,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:05,572 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-10 12:17:05,572 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 12:17:05,600 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:17:05,614 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:17:05,614 INFO L444 ModelExtractionUtils]: 41 out of 46 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 12:17:05,615 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:17:05,616 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2018-11-10 12:17:05,616 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:17:05,616 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 >= 0] [2018-11-10 12:17:05,726 INFO L297 tatePredicateManager]: 22 out of 25 supporting invariants were superfluous and have been removed [2018-11-10 12:17:05,730 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:17:05,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:17:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:17:05,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:17:05,771 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:17:05,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 12:17:05,787 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:17:05,788 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:17:05,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 12:17:05,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:05,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:05,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:05,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:17 [2018-11-10 12:17:05,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-11-10 12:17:05,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:17:05,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:05,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:05,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 12:17:05,899 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:35 [2018-11-10 12:17:05,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2018-11-10 12:17:05,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 12:17:05,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:05,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:05,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 12:17:05,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:35 [2018-11-10 12:17:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:17:05,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:17:05,989 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:17:05,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-11-10 12:17:05,994 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:17:05,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-11-10 12:17:05,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:05,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:06,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:06,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:36 [2018-11-10 12:17:06,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-11-10 12:17:06,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 12:17:06,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:06,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:06,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:06,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:36 [2018-11-10 12:17:06,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:17:06,034 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 5 loop predicates [2018-11-10 12:17:06,035 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 37 transitions. cyclomatic complexity: 3 Second operand 12 states. [2018-11-10 12:17:07,424 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 37 transitions. cyclomatic complexity: 3. Second operand 12 states. Result 37 states and 38 transitions. Complement of second has 7 states. [2018-11-10 12:17:07,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 5 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-10 12:17:07,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 12:17:07,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-11-10 12:17:07,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 24 letters. Loop has 12 letters. [2018-11-10 12:17:07,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:17:07,425 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:17:07,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:17:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:17:07,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:17:07,460 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:17:07,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 12:17:07,470 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:17:07,471 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:17:07,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 12:17:07,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:07,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:07,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:07,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:17 [2018-11-10 12:17:07,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-11-10 12:17:07,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:17:07,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:07,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:07,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 12:17:07,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:35 [2018-11-10 12:17:07,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2018-11-10 12:17:07,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 12:17:07,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:07,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:07,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 12:17:07,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:35 [2018-11-10 12:17:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:17:07,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:17:07,682 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:17:07,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-11-10 12:17:07,686 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:17:07,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-11-10 12:17:07,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:07,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:07,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:07,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:36 [2018-11-10 12:17:07,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-11-10 12:17:07,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 12:17:07,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:07,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:07,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:07,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:36 [2018-11-10 12:17:07,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:17:07,734 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 5 loop predicates [2018-11-10 12:17:07,734 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 37 transitions. cyclomatic complexity: 3 Second operand 12 states. [2018-11-10 12:17:25,241 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 37 transitions. cyclomatic complexity: 3. Second operand 12 states. Result 37 states and 38 transitions. Complement of second has 7 states. [2018-11-10 12:17:25,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 5 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-10 12:17:25,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 12:17:25,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-11-10 12:17:25,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 24 letters. Loop has 12 letters. [2018-11-10 12:17:25,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:17:25,242 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:17:25,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:17:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:17:25,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:17:25,276 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:17:25,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 12:17:25,287 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:17:25,288 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:17:25,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 12:17:25,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:25,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:25,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:25,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:17 [2018-11-10 12:17:25,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-11-10 12:17:25,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:17:25,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:25,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:25,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 12:17:25,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:35 [2018-11-10 12:17:25,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2018-11-10 12:17:25,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 12:17:25,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:25,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:25,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 12:17:25,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:35 [2018-11-10 12:17:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:17:25,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:17:25,470 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:17:25,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-11-10 12:17:25,473 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:17:25,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-11-10 12:17:25,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:25,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:25,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:25,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:36 [2018-11-10 12:17:25,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-11-10 12:17:25,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 12:17:25,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:17:25,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:25,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:17:25,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:36 [2018-11-10 12:17:25,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:17:25,516 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 5 loop predicates [2018-11-10 12:17:25,516 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 37 transitions. cyclomatic complexity: 3 Second operand 12 states. [2018-11-10 12:17:37,149 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 37 transitions. cyclomatic complexity: 3. Second operand 12 states. Result 73 states and 74 transitions. Complement of second has 29 states. [2018-11-10 12:17:37,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 8 stem states 4 non-accepting loop states 2 accepting loop states [2018-11-10 12:17:37,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 12:17:37,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2018-11-10 12:17:37,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 58 transitions. Stem has 24 letters. Loop has 12 letters. [2018-11-10 12:17:37,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:17:37,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 58 transitions. Stem has 36 letters. Loop has 12 letters. [2018-11-10 12:17:37,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:17:37,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 58 transitions. Stem has 24 letters. Loop has 24 letters. [2018-11-10 12:17:37,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:17:37,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 74 transitions. [2018-11-10 12:17:37,153 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:17:37,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 0 states and 0 transitions. [2018-11-10 12:17:37,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:17:37,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:17:37,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:17:37,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:17:37,153 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:17:37,153 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:17:37,153 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:17:37,153 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 12:17:37,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:17:37,154 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:17:37,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 12:17:37,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:17:37 BoogieIcfgContainer [2018-11-10 12:17:37,159 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 12:17:37,159 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:17:37,159 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:17:37,159 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:17:37,160 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:16:55" (3/4) ... [2018-11-10 12:17:37,162 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 12:17:37,162 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:17:37,162 INFO L168 Benchmark]: Toolchain (without parser) took 41859.25 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 465.0 MB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -282.2 MB). Peak memory consumption was 182.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:17:37,163 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:17:37,163 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.28 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 928.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:17:37,163 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 928.5 MB in the beginning and 1.2 GB in the end (delta: -233.2 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-10 12:17:37,163 INFO L168 Benchmark]: Boogie Preprocessor took 15.12 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. [2018-11-10 12:17:37,163 INFO L168 Benchmark]: RCFGBuilder took 240.31 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.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:17:37,164 INFO L168 Benchmark]: BuchiAutomizer took 41259.61 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 297.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -95.8 MB). Peak memory consumption was 202.0 MB. Max. memory is 11.5 GB. [2018-11-10 12:17:37,164 INFO L168 Benchmark]: Witness Printer took 2.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:17:37,166 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 268.28 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 928.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 928.5 MB in the beginning and 1.2 GB in the end (delta: -233.2 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 240.31 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.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 41259.61 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 297.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -95.8 MB). Peak memory consumption was 202.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 12 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 15 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 14 locations. 2 modules have a trivial ranking function, the largest among these consists of 28 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 41.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 6.4s. Construction of modules took 30.6s. Büchi inclusion checks took 4.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 33 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 64 states and ocurred in iteration 3. Nontrivial modules had stage [0, 2, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 120 SDtfs, 501 SDslu, 311 SDs, 0 SdLazy, 873 SolverSat, 164 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 30.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital555 mio100 ax104 hnf100 lsp93 ukn60 mio100 lsp37 div100 bol100 ite100 ukn100 eq193 hnf87 smp94 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 95ms VariablesStem: 8 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...