./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/array02-alloca_true-termination.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_6a80bdc8-8855-4f71-a0b2-8e7ea7215d8c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6a80bdc8-8855-4f71-a0b2-8e7ea7215d8c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6a80bdc8-8855-4f71-a0b2-8e7ea7215d8c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6a80bdc8-8855-4f71-a0b2-8e7ea7215d8c/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/array02-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6a80bdc8-8855-4f71-a0b2-8e7ea7215d8c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6a80bdc8-8855-4f71-a0b2-8e7ea7215d8c/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 2a421301cdbe97036a5fec0597ad83df33c3e561 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:07:45,912 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:07:45,914 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:07:45,923 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:07:45,924 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:07:45,925 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:07:45,926 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:07:45,927 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:07:45,928 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:07:45,929 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:07:45,930 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:07:45,930 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:07:45,931 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:07:45,931 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:07:45,933 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:07:45,933 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:07:45,934 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:07:45,935 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:07:45,937 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:07:45,939 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:07:45,939 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:07:45,941 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:07:45,942 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:07:45,943 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:07:45,943 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:07:45,943 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:07:45,944 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:07:45,945 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:07:45,946 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:07:45,946 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:07:45,947 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:07:45,947 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:07:45,947 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:07:45,947 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:07:45,949 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:07:45,949 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:07:45,950 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6a80bdc8-8855-4f71-a0b2-8e7ea7215d8c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:07:45,961 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:07:45,961 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:07:45,962 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:07:45,962 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:07:45,962 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:07:45,963 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:07:45,963 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:07:45,963 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:07:45,963 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:07:45,963 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:07:45,963 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:07:45,963 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:07:45,964 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:07:45,964 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:07:45,965 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:07:45,965 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:07:45,965 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:07:45,965 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:07:45,966 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:07:45,966 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:07:45,966 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:07:45,966 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:07:45,966 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:07:45,966 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:07:45,966 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:07:45,967 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:07:45,967 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:07:45,967 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:07:45,968 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_6a80bdc8-8855-4f71-a0b2-8e7ea7215d8c/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 -> 2a421301cdbe97036a5fec0597ad83df33c3e561 [2018-10-27 06:07:45,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:07:46,003 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:07:46,006 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:07:46,007 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:07:46,007 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:07:46,008 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6a80bdc8-8855-4f71-a0b2-8e7ea7215d8c/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/array02-alloca_true-termination.c.i [2018-10-27 06:07:46,052 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6a80bdc8-8855-4f71-a0b2-8e7ea7215d8c/bin-2019/uautomizer/data/7feefb1e0/923cc58888f54ffaa1e4fc3fbff95cb0/FLAGcac51ac47 [2018-10-27 06:07:46,460 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:07:46,460 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6a80bdc8-8855-4f71-a0b2-8e7ea7215d8c/sv-benchmarks/c/termination-memory-alloca/array02-alloca_true-termination.c.i [2018-10-27 06:07:46,468 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6a80bdc8-8855-4f71-a0b2-8e7ea7215d8c/bin-2019/uautomizer/data/7feefb1e0/923cc58888f54ffaa1e4fc3fbff95cb0/FLAGcac51ac47 [2018-10-27 06:07:46,480 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6a80bdc8-8855-4f71-a0b2-8e7ea7215d8c/bin-2019/uautomizer/data/7feefb1e0/923cc58888f54ffaa1e4fc3fbff95cb0 [2018-10-27 06:07:46,482 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:07:46,483 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:07:46,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:07:46,484 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:07:46,487 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:07:46,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:07:46" (1/1) ... [2018-10-27 06:07:46,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16e105ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:46, skipping insertion in model container [2018-10-27 06:07:46,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:07:46" (1/1) ... [2018-10-27 06:07:46,498 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:07:46,531 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:07:46,746 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:07:46,753 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:07:46,785 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:07:46,822 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:07:46,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:46 WrapperNode [2018-10-27 06:07:46,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:07:46,823 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:07:46,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:07:46,823 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:07:46,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:46" (1/1) ... [2018-10-27 06:07:46,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:46" (1/1) ... [2018-10-27 06:07:46,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:07:46,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:07:46,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:07:46,922 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:07:46,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:46" (1/1) ... [2018-10-27 06:07:46,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:46" (1/1) ... [2018-10-27 06:07:46,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:46" (1/1) ... [2018-10-27 06:07:46,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:46" (1/1) ... [2018-10-27 06:07:46,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:46" (1/1) ... [2018-10-27 06:07:46,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:46" (1/1) ... [2018-10-27 06:07:46,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:46" (1/1) ... [2018-10-27 06:07:46,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:07:46,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:07:46,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:07:46,949 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:07:46,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a80bdc8-8855-4f71-a0b2-8e7ea7215d8c/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-10-27 06:07:47,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:07:47,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:07:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:07:47,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:07:47,415 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:07:47,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:47 BoogieIcfgContainer [2018-10-27 06:07:47,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:07:47,416 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:07:47,416 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:07:47,419 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:07:47,419 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:47,420 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:07:46" (1/3) ... [2018-10-27 06:07:47,421 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23a040b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:07:47, skipping insertion in model container [2018-10-27 06:07:47,421 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:47,421 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:46" (2/3) ... [2018-10-27 06:07:47,421 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23a040b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:07:47, skipping insertion in model container [2018-10-27 06:07:47,421 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:47,421 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:47" (3/3) ... [2018-10-27 06:07:47,423 INFO L375 chiAutomizerObserver]: Analyzing ICFG array02-alloca_true-termination.c.i [2018-10-27 06:07:47,478 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:07:47,479 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:07:47,479 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:07:47,479 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:07:47,479 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:07:47,479 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:07:47,480 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:07:47,480 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:07:47,480 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:07:47,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-10-27 06:07:47,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-10-27 06:07:47,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:47,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:47,526 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:07:47,526 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:07:47,526 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:07:47,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-10-27 06:07:47,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-10-27 06:07:47,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:47,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:47,529 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:07:47,529 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:07:47,537 INFO L793 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 22#L565true assume !(main_~array_size~0 < 1); 9#L565-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 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];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 3#L552-4true [2018-10-27 06:07:47,538 INFO L795 eck$LassoCheckResult]: Loop: 3#L552-4true assume true; 12#L552-1true assume !!(test_fun_~i~0 < test_fun_~N); 27#L553-4true assume !true; 6#L557-3true assume !true; 16#L552-3true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := test_fun_#t~post2 + 1;havoc test_fun_#t~post2; 3#L552-4true [2018-10-27 06:07:47,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:47,544 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-10-27 06:07:47,546 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:47,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:47,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:47,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:47,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:47,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:47,675 INFO L82 PathProgramCache]: Analyzing trace with hash 41206463, now seen corresponding path program 1 times [2018-10-27 06:07:47,675 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:47,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:47,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:47,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:47,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:47,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:47,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:47,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:07:47,707 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:47,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 06:07:47,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 06:07:47,722 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-10-27 06:07:47,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:47,729 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-10-27 06:07:47,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 06:07:47,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2018-10-27 06:07:47,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-10-27 06:07:47,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 24 transitions. [2018-10-27 06:07:47,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-10-27 06:07:47,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-10-27 06:07:47,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 24 transitions. [2018-10-27 06:07:47,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:47,739 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-10-27 06:07:47,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 24 transitions. [2018-10-27 06:07:47,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-27 06:07:47,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-27 06:07:47,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-10-27 06:07:47,762 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-10-27 06:07:47,762 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-10-27 06:07:47,763 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:07:47,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2018-10-27 06:07:47,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-10-27 06:07:47,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:47,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:47,764 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:07:47,764 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:47,765 INFO L793 eck$LassoCheckResult]: Stem: 74#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 72#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 68#L565 assume !(main_~array_size~0 < 1); 69#L565-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 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];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 58#L552-4 [2018-10-27 06:07:47,765 INFO L795 eck$LassoCheckResult]: Loop: 58#L552-4 assume true; 59#L552-1 assume !!(test_fun_~i~0 < test_fun_~N); 78#L553-4 assume true; 75#L553-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553-1 76#L553-2 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 67#L557-3 assume true; 62#L557 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L557 63#L557-1 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 65#L552-3 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := test_fun_#t~post2 + 1;havoc test_fun_#t~post2; 58#L552-4 [2018-10-27 06:07:47,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:47,765 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-10-27 06:07:47,765 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:47,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:47,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:47,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:47,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:47,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:47,790 INFO L82 PathProgramCache]: Analyzing trace with hash 2145679071, now seen corresponding path program 1 times [2018-10-27 06:07:47,790 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:47,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:47,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:47,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:47,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:47,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:47,820 INFO L82 PathProgramCache]: Analyzing trace with hash 632420219, now seen corresponding path program 1 times [2018-10-27 06:07:47,820 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:47,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:47,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:47,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:47,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:47,983 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-10-27 06:07:48,198 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-10-27 06:07:48,404 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-10-27 06:07:48,420 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:48,421 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:48,421 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:48,421 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:48,421 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:48,421 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:48,422 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:48,422 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:48,422 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-termination.c.i_Iteration2_Lasso [2018-10-27 06:07:48,422 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:48,422 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:48,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:48,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:48,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:48,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-10-27 06:07:48,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:48,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:48,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:48,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:48,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:49,117 WARN L179 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2018-10-27 06:07:49,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:49,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:49,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:49,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:49,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:49,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:49,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:49,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:49,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:49,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:49,643 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:49,647 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:49,652 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-10-27 06:07:49,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:49,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:49,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:49,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:49,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:49,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:49,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:49,663 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:49,664 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-10-27 06:07:49,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:49,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:49,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:49,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:49,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:49,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:49,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:49,667 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:49,667 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-10-27 06:07:49,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:49,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:49,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:49,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:49,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:49,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:49,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:49,670 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:49,671 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-10-27 06:07:49,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:49,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:49,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:49,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:49,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:49,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:49,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:49,674 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:49,674 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-10-27 06:07:49,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:49,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:49,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:49,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:49,678 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:49,678 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:49,683 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:49,683 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-10-27 06:07:49,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:49,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:49,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:49,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:49,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:49,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:49,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:49,687 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:49,687 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-10-27 06:07:49,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:49,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:49,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:49,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:49,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:49,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:49,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:49,690 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:49,691 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-10-27 06:07:49,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:49,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:49,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:49,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:49,694 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:49,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:49,703 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:49,704 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-10-27 06:07:49,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:49,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:49,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:49,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:49,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:49,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:49,719 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:49,725 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-10-27 06:07:49,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:49,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:49,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:49,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:49,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:49,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:49,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:49,731 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:49,731 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-10-27 06:07:49,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:49,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:49,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:49,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:49,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:49,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:49,741 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:49,741 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-10-27 06:07:49,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:49,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:49,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:49,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:49,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:49,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:49,767 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:49,771 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-10-27 06:07:49,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:49,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:49,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:49,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:49,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:49,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:49,880 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:07:49,916 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:07:49,917 INFO L444 ModelExtractionUtils]: 34 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:07:49,919 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:07:49,921 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:07:49,921 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:07:49,922 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2018-10-27 06:07:49,996 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-10-27 06:07:50,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:50,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:50,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:50,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:50,071 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:07:50,072 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-10-27 06:07:50,134 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 38 states and 44 transitions. Complement of second has 6 states. [2018-10-27 06:07:50,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:50,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:07:50,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2018-10-27 06:07:50,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 4 letters. Loop has 9 letters. [2018-10-27 06:07:50,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:50,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 13 letters. Loop has 9 letters. [2018-10-27 06:07:50,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:50,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 4 letters. Loop has 18 letters. [2018-10-27 06:07:50,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:50,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 44 transitions. [2018-10-27 06:07:50,140 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-10-27 06:07:50,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 37 states and 43 transitions. [2018-10-27 06:07:50,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-10-27 06:07:50,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-10-27 06:07:50,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2018-10-27 06:07:50,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:50,142 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-10-27 06:07:50,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2018-10-27 06:07:50,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-27 06:07:50,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-27 06:07:50,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-10-27 06:07:50,145 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-10-27 06:07:50,145 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-10-27 06:07:50,145 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:07:50,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 43 transitions. [2018-10-27 06:07:50,146 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-10-27 06:07:50,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:50,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:50,147 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:07:50,147 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:50,147 INFO L793 eck$LassoCheckResult]: Stem: 219#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 216#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 210#L565 assume !(main_~array_size~0 < 1); 211#L565-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 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];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 191#L552-4 assume true; 193#L552-1 assume !!(test_fun_~i~0 < test_fun_~N); 226#L553-4 [2018-10-27 06:07:50,148 INFO L795 eck$LassoCheckResult]: Loop: 226#L553-4 assume true; 220#L553-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553-1 221#L553-2 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 212#L554 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L554 213#L554-1 test_fun_#t~post5 := test_fun_#t~mem4; 217#L554-2 SUMMARY for call write~int(test_fun_#t~post5 + 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L554-2 224#L554-3 havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := test_fun_#t~post6 + 1;havoc test_fun_#t~post6; 226#L553-4 [2018-10-27 06:07:50,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:50,148 INFO L82 PathProgramCache]: Analyzing trace with hash 889568330, now seen corresponding path program 1 times [2018-10-27 06:07:50,148 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:50,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:50,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:50,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:50,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:50,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:50,163 INFO L82 PathProgramCache]: Analyzing trace with hash 507861116, now seen corresponding path program 1 times [2018-10-27 06:07:50,164 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:50,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:50,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:50,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:50,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:50,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:50,174 INFO L82 PathProgramCache]: Analyzing trace with hash 633989139, now seen corresponding path program 1 times [2018-10-27 06:07:50,174 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:50,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:50,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:50,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:50,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:50,440 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:50,441 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:50,441 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:50,441 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:50,441 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:50,441 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:50,441 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:50,441 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:50,441 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-termination.c.i_Iteration3_Lasso [2018-10-27 06:07:50,441 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:50,441 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:50,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,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-10-27 06:07:50,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-10-27 06:07:50,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-10-27 06:07:50,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,716 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2018-10-27 06:07:50,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:51,096 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:51,096 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:51,096 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-10-27 06:07:51,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:51,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:51,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,099 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,099 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-10-27 06:07:51,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:51,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:51,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,105 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,106 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-10-27 06:07:51,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:51,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:51,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,112 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,113 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-10-27 06:07:51,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:51,115 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:51,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:51,120 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,121 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-10-27 06:07:51,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:51,123 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:51,123 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:51,129 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,129 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-10-27 06:07:51,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:51,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:51,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,133 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,134 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-10-27 06:07:51,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:51,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:51,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,140 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,141 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-10-27 06:07:51,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:51,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:51,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,143 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,143 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-10-27 06:07:51,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:51,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:51,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:51,154 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,155 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-10-27 06:07:51,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:51,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:51,157 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:51,159 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,163 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-10-27 06:07:51,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:51,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:51,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,165 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,165 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-10-27 06:07:51,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:51,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:51,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,167 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,168 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-10-27 06:07:51,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:51,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:51,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:51,177 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,180 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-10-27 06:07:51,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:51,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:51,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,182 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,183 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-10-27 06:07:51,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:51,189 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:51,189 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:51,192 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,193 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-10-27 06:07:51,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:51,194 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:51,194 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:51,200 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,201 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-10-27 06:07:51,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,201 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:51,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:51,203 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:51,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:51,214 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,215 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-10-27 06:07:51,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:51,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:51,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:51,233 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,233 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-10-27 06:07:51,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:51,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:51,235 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:51,243 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,243 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-10-27 06:07:51,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:51,246 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:51,247 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:51,249 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,249 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-10-27 06:07:51,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:51,250 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:51,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,255 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:07:51,256 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:07:51,257 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:07:51,257 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:07:51,257 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:07:51,257 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:07:51,257 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2018-10-27 06:07:51,337 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-10-27 06:07:51,342 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:07:51,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:51,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:51,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:51,552 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:51,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 55 treesize of output 58 [2018-10-27 06:07:51,565 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 58 treesize of output 33 [2018-10-27 06:07:51,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:51,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:51,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:51,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:17 [2018-10-27 06:07:51,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:51,596 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:07:51,596 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 43 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-10-27 06:07:51,684 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 43 transitions. cyclomatic complexity: 9. Second operand 8 states. Result 94 states and 105 transitions. Complement of second has 13 states. [2018-10-27 06:07:51,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:07:51,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-10-27 06:07:51,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 6 letters. Loop has 7 letters. [2018-10-27 06:07:51,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:51,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 13 letters. Loop has 7 letters. [2018-10-27 06:07:51,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:51,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 6 letters. Loop has 14 letters. [2018-10-27 06:07:51,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:51,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 105 transitions. [2018-10-27 06:07:51,689 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-10-27 06:07:51,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 75 states and 86 transitions. [2018-10-27 06:07:51,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-10-27 06:07:51,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-10-27 06:07:51,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 86 transitions. [2018-10-27 06:07:51,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:51,691 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 86 transitions. [2018-10-27 06:07:51,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 86 transitions. [2018-10-27 06:07:51,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 61. [2018-10-27 06:07:51,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-27 06:07:51,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2018-10-27 06:07:51,695 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-10-27 06:07:51,695 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-10-27 06:07:51,695 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:07:51,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 71 transitions. [2018-10-27 06:07:51,697 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-10-27 06:07:51,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:51,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:51,698 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:51,698 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:51,698 INFO L793 eck$LassoCheckResult]: Stem: 442#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 438#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 432#L565 assume !(main_~array_size~0 < 1); 433#L565-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 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];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 411#L552-4 assume true; 413#L552-1 assume !!(test_fun_~i~0 < test_fun_~N); 453#L553-4 assume true; 443#L553-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553-1 444#L553-2 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 430#L557-3 [2018-10-27 06:07:51,698 INFO L795 eck$LassoCheckResult]: Loop: 430#L557-3 assume true; 421#L557 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L557 422#L557-1 assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 417#L558 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L558 418#L558-1 test_fun_#t~post9 := test_fun_#t~mem8; 425#L558-2 SUMMARY for call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L558-2 428#L558-3 havoc test_fun_#t~post9;havoc test_fun_#t~mem8;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := test_fun_#t~post10 + 1;havoc test_fun_#t~post10; 430#L557-3 [2018-10-27 06:07:51,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:51,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1181924623, now seen corresponding path program 1 times [2018-10-27 06:07:51,699 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:51,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:51,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:51,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:51,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:51,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:51,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1081526739, now seen corresponding path program 1 times [2018-10-27 06:07:51,718 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:51,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:51,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:51,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:51,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:51,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:51,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1589097121, now seen corresponding path program 1 times [2018-10-27 06:07:51,729 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:51,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:51,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:51,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:51,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:52,098 WARN L179 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2018-10-27 06:07:52,138 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:52,138 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:52,138 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:52,138 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:52,138 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:52,139 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:52,139 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:52,139 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:52,139 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-termination.c.i_Iteration4_Lasso [2018-10-27 06:07:52,139 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:52,139 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:52,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:52,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:52,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:52,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:52,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:52,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:52,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:52,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:52,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:52,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:52,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:52,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:52,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:52,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:52,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:52,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:52,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:52,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:52,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:52,704 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:52,705 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:52,705 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-10-27 06:07:52,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:52,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:52,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:52,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:52,707 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:52,707 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-10-27 06:07:52,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:52,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:52,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:52,714 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:52,714 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-10-27 06:07:52,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:52,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,715 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:52,715 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:52,721 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:52,721 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-10-27 06:07:52,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:52,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:52,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:52,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:52,723 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:52,723 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-10-27 06:07:52,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:52,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,730 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:52,730 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:52,732 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:52,732 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-10-27 06:07:52,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:52,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:52,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:52,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:52,734 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:52,734 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-10-27 06:07:52,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:52,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:52,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:52,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:52,736 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:52,743 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-10-27 06:07:52,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:52,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:52,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:52,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:52,745 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:52,745 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-10-27 06:07:52,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:52,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:52,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:52,755 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:52,755 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-10-27 06:07:52,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:52,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:52,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:52,760 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:52,760 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-10-27 06:07:52,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,760 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:52,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,762 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:52,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:52,771 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:52,772 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-10-27 06:07:52,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:52,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:52,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:52,779 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:07:52,781 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:07:52,781 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:07:52,782 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:07:52,782 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:07:52,783 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:07:52,783 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_3 Supporting invariants [] [2018-10-27 06:07:52,861 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-10-27 06:07:52,874 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:07:53,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:53,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:53,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:53,831 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:53,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 51 treesize of output 54 [2018-10-27 06:07:53,836 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 54 treesize of output 29 [2018-10-27 06:07:53,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:53,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:53,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:53,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-10-27 06:07:53,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:53,858 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:07:53,858 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 71 transitions. cyclomatic complexity: 15 Second operand 8 states. [2018-10-27 06:07:53,924 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 71 transitions. cyclomatic complexity: 15. Second operand 8 states. Result 92 states and 105 transitions. Complement of second has 13 states. [2018-10-27 06:07:53,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:53,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:07:53,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-10-27 06:07:53,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 9 letters. Loop has 7 letters. [2018-10-27 06:07:53,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:53,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 16 letters. Loop has 7 letters. [2018-10-27 06:07:53,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:53,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 9 letters. Loop has 14 letters. [2018-10-27 06:07:53,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:53,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 105 transitions. [2018-10-27 06:07:53,930 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-10-27 06:07:53,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 61 states and 70 transitions. [2018-10-27 06:07:53,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-10-27 06:07:53,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-10-27 06:07:53,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 70 transitions. [2018-10-27 06:07:53,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:53,932 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 70 transitions. [2018-10-27 06:07:53,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 70 transitions. [2018-10-27 06:07:53,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-10-27 06:07:53,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-27 06:07:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-10-27 06:07:53,939 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-10-27 06:07:53,939 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-10-27 06:07:53,939 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:07:53,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 69 transitions. [2018-10-27 06:07:53,940 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-10-27 06:07:53,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:53,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:53,943 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:53,943 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:53,943 INFO L793 eck$LassoCheckResult]: Stem: 692#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 689#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 682#L565 assume !(main_~array_size~0 < 1); 683#L565-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 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];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 662#L552-4 assume true; 663#L552-1 assume !!(test_fun_~i~0 < test_fun_~N); 712#L553-4 assume true; 698#L553-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553-1 699#L553-2 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 702#L557-3 assume true; 673#L557 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L557 674#L557-1 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 677#L552-3 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := test_fun_#t~post2 + 1;havoc test_fun_#t~post2; 664#L552-4 assume true; 665#L552-1 assume !!(test_fun_~i~0 < test_fun_~N); 700#L553-4 [2018-10-27 06:07:53,943 INFO L795 eck$LassoCheckResult]: Loop: 700#L553-4 assume true; 696#L553-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553-1 697#L553-2 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 684#L554 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L554 685#L554-1 test_fun_#t~post5 := test_fun_#t~mem4; 690#L554-2 SUMMARY for call write~int(test_fun_#t~post5 + 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L554-2 693#L554-3 havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := test_fun_#t~post6 + 1;havoc test_fun_#t~post6; 700#L553-4 [2018-10-27 06:07:53,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:53,943 INFO L82 PathProgramCache]: Analyzing trace with hash -2129525152, now seen corresponding path program 2 times [2018-10-27 06:07:53,944 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:53,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:53,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:53,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:53,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:53,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:53,958 INFO L82 PathProgramCache]: Analyzing trace with hash 507861116, now seen corresponding path program 2 times [2018-10-27 06:07:53,958 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:53,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:53,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:53,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:53,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:53,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:53,967 INFO L82 PathProgramCache]: Analyzing trace with hash 2022717757, now seen corresponding path program 1 times [2018-10-27 06:07:53,967 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:53,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:53,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:53,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:53,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:54,139 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-10-27 06:07:54,294 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2018-10-27 06:07:54,346 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:54,346 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:54,346 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:54,346 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:54,347 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:54,347 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:54,347 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:54,347 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:54,347 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-termination.c.i_Iteration5_Lasso [2018-10-27 06:07:54,347 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:54,347 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:54,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:54,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:54,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:54,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:54,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:54,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:54,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:54,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:54,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:54,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:54,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:54,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:54,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:54,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:54,648 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2018-10-27 06:07:54,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:54,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:54,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:54,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:54,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:54,919 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:54,919 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:54,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-10-27 06:07:54,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:54,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:54,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:54,925 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,926 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-10-27 06:07:54,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:54,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:54,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:54,927 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,927 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-10-27 06:07:54,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:54,933 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:54,934 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,934 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-10-27 06:07:54,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,935 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:54,935 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:54,936 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,936 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-10-27 06:07:54,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:54,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:54,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:54,938 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,938 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-10-27 06:07:54,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:54,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:54,952 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,952 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-10-27 06:07:54,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:54,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:54,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:54,954 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,954 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-10-27 06:07:54,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:54,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:54,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:54,955 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,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-10-27 06:07:54,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:54,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:54,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:54,957 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,957 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-10-27 06:07:54,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:54,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:54,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:54,958 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,958 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-10-27 06:07:54,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:54,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:54,963 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,963 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-10-27 06:07:54,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:54,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:54,980 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,980 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-10-27 06:07:54,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:54,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:54,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:54,981 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,982 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-10-27 06:07:54,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,983 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:54,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:54,997 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,997 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-10-27 06:07:54,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:54,998 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:55,000 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:55,000 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-10-27 06:07:55,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:55,000 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:55,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:55,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:55,002 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:55,002 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:55,014 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:55,014 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-10-27 06:07:55,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:55,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:55,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:55,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:55,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:55,016 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:55,021 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:55,021 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-10-27 06:07:55,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:55,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:55,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:55,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:55,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:55,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:55,024 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:55,028 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-10-27 06:07:55,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:55,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:55,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:55,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:55,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:55,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:55,035 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:55,036 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-10-27 06:07:55,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:55,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:55,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:55,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:55,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:55,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:55,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:55,038 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:07:55,038 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:07:55,039 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:07:55,039 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:07:55,039 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:07:55,039 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:07:55,039 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1 Supporting invariants [] [2018-10-27 06:07:55,152 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-10-27 06:07:55,165 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:07:55,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:55,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:55,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:55,439 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:55,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 55 treesize of output 58 [2018-10-27 06:07:55,443 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:07:55,444 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 0 case distinctions, treesize of input 58 treesize of output 44 [2018-10-27 06:07:55,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:55,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:55,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:55,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:17 [2018-10-27 06:07:55,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:55,472 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:07:55,473 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 69 transitions. cyclomatic complexity: 14 Second operand 8 states. [2018-10-27 06:07:55,546 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 69 transitions. cyclomatic complexity: 14. Second operand 8 states. Result 86 states and 97 transitions. Complement of second has 13 states. [2018-10-27 06:07:55,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:55,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:07:55,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-10-27 06:07:55,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 15 letters. Loop has 7 letters. [2018-10-27 06:07:55,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:55,548 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:07:55,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:55,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:55,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:55,608 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:55,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 55 treesize of output 58 [2018-10-27 06:07:55,613 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:07:55,614 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 0 case distinctions, treesize of input 58 treesize of output 44 [2018-10-27 06:07:55,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:55,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:55,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:55,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:17 [2018-10-27 06:07:55,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:55,633 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:07:55,633 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 69 transitions. cyclomatic complexity: 14 Second operand 8 states. [2018-10-27 06:07:55,690 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 69 transitions. cyclomatic complexity: 14. Second operand 8 states. Result 85 states and 96 transitions. Complement of second has 15 states. [2018-10-27 06:07:55,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:55,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:07:55,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-10-27 06:07:55,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 15 letters. Loop has 7 letters. [2018-10-27 06:07:55,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:55,693 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:07:55,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:55,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:55,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:55,759 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:55,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 55 treesize of output 58 [2018-10-27 06:07:55,766 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:07:55,767 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 0 case distinctions, treesize of input 58 treesize of output 44 [2018-10-27 06:07:55,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:55,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:55,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:55,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:17 [2018-10-27 06:07:55,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:55,802 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:07:55,802 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 69 transitions. cyclomatic complexity: 14 Second operand 8 states. [2018-10-27 06:07:55,897 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 69 transitions. cyclomatic complexity: 14. Second operand 8 states. Result 125 states and 140 transitions. Complement of second has 12 states. [2018-10-27 06:07:55,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:55,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:07:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2018-10-27 06:07:55,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 15 letters. Loop has 7 letters. [2018-10-27 06:07:55,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:55,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 22 letters. Loop has 7 letters. [2018-10-27 06:07:55,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:55,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 15 letters. Loop has 14 letters. [2018-10-27 06:07:55,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:55,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 140 transitions. [2018-10-27 06:07:55,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:07:55,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 89 states and 101 transitions. [2018-10-27 06:07:55,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-10-27 06:07:55,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-10-27 06:07:55,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 101 transitions. [2018-10-27 06:07:55,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:55,906 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 101 transitions. [2018-10-27 06:07:55,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 101 transitions. [2018-10-27 06:07:55,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 68. [2018-10-27 06:07:55,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-27 06:07:55,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2018-10-27 06:07:55,910 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 79 transitions. [2018-10-27 06:07:55,910 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 79 transitions. [2018-10-27 06:07:55,910 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:07:55,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 79 transitions. [2018-10-27 06:07:55,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:07:55,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:55,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:55,911 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:55,911 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:55,912 INFO L793 eck$LassoCheckResult]: Stem: 1347#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1344#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 1339#L565 assume !(main_~array_size~0 < 1); 1340#L565-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 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];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 1318#L552-4 assume true; 1319#L552-1 assume !!(test_fun_~i~0 < test_fun_~N); 1381#L553-4 assume true; 1352#L553-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553-1 1353#L553-2 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 1377#L557-3 assume true; 1331#L557 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L557 1332#L557-1 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 1362#L552-3 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := test_fun_#t~post2 + 1;havoc test_fun_#t~post2; 1320#L552-4 assume true; 1321#L552-1 assume !!(test_fun_~i~0 < test_fun_~N); 1356#L553-4 assume true; 1350#L553-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553-1 1351#L553-2 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 1337#L557-3 [2018-10-27 06:07:55,920 INFO L795 eck$LassoCheckResult]: Loop: 1337#L557-3 assume true; 1329#L557 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L557 1330#L557-1 assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 1323#L558 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L558 1324#L558-1 test_fun_#t~post9 := test_fun_#t~mem8; 1327#L558-2 SUMMARY for call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L558-2 1335#L558-3 havoc test_fun_#t~post9;havoc test_fun_#t~mem8;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := test_fun_#t~post10 + 1;havoc test_fun_#t~post10; 1337#L557-3 [2018-10-27 06:07:55,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:55,920 INFO L82 PathProgramCache]: Analyzing trace with hash 278147897, now seen corresponding path program 3 times [2018-10-27 06:07:55,920 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:55,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:55,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:55,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:55,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:55,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:55,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1081526739, now seen corresponding path program 2 times [2018-10-27 06:07:55,938 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:55,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:55,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:55,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:55,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:55,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:55,946 INFO L82 PathProgramCache]: Analyzing trace with hash 900166645, now seen corresponding path program 1 times [2018-10-27 06:07:55,947 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:55,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:55,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:55,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:55,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:56,182 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2018-10-27 06:07:56,236 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:56,237 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:56,237 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:56,237 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:56,237 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:56,237 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:56,237 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:56,237 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:56,237 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-termination.c.i_Iteration6_Lasso [2018-10-27 06:07:56,237 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:56,237 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:56,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:56,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:56,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:56,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:56,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:56,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:56,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:56,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:56,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:56,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:56,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:56,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:56,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:56,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:56,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:56,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:56,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:56,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:56,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:56,798 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:56,798 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:56,798 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-10-27 06:07:56,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:56,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:56,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:56,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:56,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:56,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:56,801 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:56,801 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-10-27 06:07:56,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:56,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:56,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:56,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:56,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:56,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:56,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:56,802 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:56,803 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-10-27 06:07:56,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:56,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:56,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:56,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:56,804 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:56,804 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:56,809 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:56,809 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-10-27 06:07:56,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:56,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:56,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:56,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:56,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:56,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:56,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:56,810 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:56,811 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-10-27 06:07:56,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:56,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:56,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:56,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:56,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:56,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:56,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:56,812 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:56,812 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-10-27 06:07:56,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:56,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:56,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:56,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:56,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:56,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:56,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:56,813 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:56,814 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-10-27 06:07:56,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:56,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:56,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:56,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:56,815 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:56,815 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:56,833 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:56,834 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-10-27 06:07:56,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:56,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:56,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:56,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:56,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:56,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:56,845 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:56,845 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-10-27 06:07:56,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:56,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:56,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:56,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:56,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:56,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:56,848 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:56,848 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-10-27 06:07:56,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:56,848 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:56,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:56,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:56,849 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:56,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:56,870 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:56,870 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-10-27 06:07:56,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:56,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:56,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:56,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:56,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:56,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:56,885 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:07:56,888 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:07:56,892 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:07:56,892 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:07:56,893 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:07:56,893 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:07:56,893 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_2 Supporting invariants [] [2018-10-27 06:07:56,908 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-10-27 06:07:56,912 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:07:56,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:56,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:56,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:57,017 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:57,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 51 treesize of output 54 [2018-10-27 06:07:57,021 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:07:57,022 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 0 case distinctions, treesize of input 54 treesize of output 40 [2018-10-27 06:07:57,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:57,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:57,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:57,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-10-27 06:07:57,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:57,045 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:07:57,045 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 79 transitions. cyclomatic complexity: 16 Second operand 8 states. [2018-10-27 06:07:57,117 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 79 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 79 states and 92 transitions. Complement of second has 13 states. [2018-10-27 06:07:57,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:57,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:07:57,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-10-27 06:07:57,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 18 letters. Loop has 7 letters. [2018-10-27 06:07:57,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:57,119 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:07:57,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:57,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:57,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:57,236 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:57,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-10-27 06:07:57,240 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:07:57,241 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 0 case distinctions, treesize of input 54 treesize of output 40 [2018-10-27 06:07:57,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:57,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:57,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:57,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-10-27 06:07:57,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:57,292 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:07:57,292 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 79 transitions. cyclomatic complexity: 16 Second operand 8 states. [2018-10-27 06:07:57,370 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 79 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 78 states and 91 transitions. Complement of second has 15 states. [2018-10-27 06:07:57,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:57,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:07:57,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-10-27 06:07:57,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 23 transitions. Stem has 18 letters. Loop has 7 letters. [2018-10-27 06:07:57,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:57,370 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:07:57,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:57,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:57,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:57,560 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:57,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 51 treesize of output 54 [2018-10-27 06:07:57,588 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:07:57,589 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 0 case distinctions, treesize of input 54 treesize of output 40 [2018-10-27 06:07:57,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:57,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:57,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:57,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-10-27 06:07:57,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:57,612 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:07:57,612 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 79 transitions. cyclomatic complexity: 16 Second operand 8 states. [2018-10-27 06:07:57,652 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 79 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 93 states and 109 transitions. Complement of second has 12 states. [2018-10-27 06:07:57,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:57,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:07:57,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-10-27 06:07:57,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 18 letters. Loop has 7 letters. [2018-10-27 06:07:57,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:57,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 25 letters. Loop has 7 letters. [2018-10-27 06:07:57,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:57,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 18 letters. Loop has 14 letters. [2018-10-27 06:07:57,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:57,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 109 transitions. [2018-10-27 06:07:57,656 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:07:57,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 0 states and 0 transitions. [2018-10-27 06:07:57,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:07:57,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:07:57,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:07:57,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:57,656 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:07:57,656 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:07:57,656 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:07:57,657 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:07:57,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:07:57,657 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:07:57,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:07:57,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:07:57 BoogieIcfgContainer [2018-10-27 06:07:57,665 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:07:57,665 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:07:57,665 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:07:57,665 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:07:57,666 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:47" (3/4) ... [2018-10-27 06:07:57,669 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:07:57,669 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:07:57,670 INFO L168 Benchmark]: Toolchain (without parser) took 11186.96 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.2 MB). Free memory was 953.1 MB in the beginning and 1.3 GB in the end (delta: -312.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:07:57,670 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:07:57,671 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.64 ms. Allocated memory is still 1.0 GB. Free memory was 953.1 MB in the beginning and 931.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:57,671 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 931.6 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:57,673 INFO L168 Benchmark]: Boogie Preprocessor took 21.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:57,673 INFO L168 Benchmark]: RCFGBuilder took 471.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:57,674 INFO L168 Benchmark]: BuchiAutomizer took 10249.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -167.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:57,674 INFO L168 Benchmark]: Witness Printer took 3.92 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:07:57,680 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 338.64 ms. Allocated memory is still 1.0 GB. Free memory was 953.1 MB in the beginning and 931.6 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 98.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 931.6 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 471.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10249.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -167.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.92 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 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 6 terminating modules (1 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][4 * i + a] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][4 * i + a] and consists of 7 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][a + 4 * i] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 7 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 7.0s. Construction of modules took 0.2s. Büchi inclusion checks took 2.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 36 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 68 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 190 SDtfs, 213 SDslu, 109 SDs, 0 SdLazy, 278 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital160 mio100 ax111 hnf99 lsp80 ukn88 mio100 lsp47 div100 bol100 ite100 ukn100 eq184 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...