./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/twisted-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_5030ac78-2644-432d-9eb6-b3fb70af50e4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5030ac78-2644-432d-9eb6-b3fb70af50e4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5030ac78-2644-432d-9eb6-b3fb70af50e4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5030ac78-2644-432d-9eb6-b3fb70af50e4/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/twisted-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5030ac78-2644-432d-9eb6-b3fb70af50e4/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5030ac78-2644-432d-9eb6-b3fb70af50e4/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 1a7013a4cfa859e3e95189f90d363983a25fcd0e ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:48,852 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:07:48,853 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:07:48,862 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:07:48,862 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:07:48,863 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:07:48,864 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:07:48,865 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:07:48,869 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:07:48,876 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:07:48,877 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:07:48,877 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:07:48,878 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:07:48,878 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:07:48,879 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:07:48,880 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:07:48,881 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:07:48,882 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:07:48,884 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:07:48,888 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:07:48,891 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:07:48,892 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:07:48,893 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:07:48,893 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:07:48,894 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:07:48,894 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:07:48,895 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:07:48,895 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:07:48,899 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:07:48,900 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:07:48,901 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:07:48,901 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:07:48,901 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:07:48,901 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:07:48,902 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:07:48,902 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:07:48,903 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5030ac78-2644-432d-9eb6-b3fb70af50e4/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:07:48,914 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:07:48,915 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:07:48,915 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:07:48,916 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:07:48,916 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:07:48,916 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:07:48,916 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:07:48,916 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:07:48,916 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:07:48,917 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:07:48,917 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:07:48,917 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:07:48,917 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:07:48,917 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:07:48,917 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:07:48,917 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:07:48,917 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:07:48,918 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:07:48,918 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:07:48,918 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:07:48,920 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:07:48,920 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:07:48,920 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:07:48,920 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:07:48,920 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:07:48,920 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:07:48,921 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:07:48,921 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:07:48,921 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_5030ac78-2644-432d-9eb6-b3fb70af50e4/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 -> 1a7013a4cfa859e3e95189f90d363983a25fcd0e [2018-10-27 06:07:48,948 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:07:48,959 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:07:48,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:07:48,962 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:07:48,963 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:07:48,963 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5030ac78-2644-432d-9eb6-b3fb70af50e4/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/twisted-alloca_true-termination.c.i [2018-10-27 06:07:49,005 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5030ac78-2644-432d-9eb6-b3fb70af50e4/bin-2019/uautomizer/data/9ad84abde/a1d50f699c374e91a48bc00bbf75e66f/FLAGc3b9b9b2c [2018-10-27 06:07:49,409 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:07:49,410 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5030ac78-2644-432d-9eb6-b3fb70af50e4/sv-benchmarks/c/termination-memory-alloca/twisted-alloca_true-termination.c.i [2018-10-27 06:07:49,420 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5030ac78-2644-432d-9eb6-b3fb70af50e4/bin-2019/uautomizer/data/9ad84abde/a1d50f699c374e91a48bc00bbf75e66f/FLAGc3b9b9b2c [2018-10-27 06:07:49,432 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5030ac78-2644-432d-9eb6-b3fb70af50e4/bin-2019/uautomizer/data/9ad84abde/a1d50f699c374e91a48bc00bbf75e66f [2018-10-27 06:07:49,435 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:07:49,436 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:07:49,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:07:49,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:07:49,441 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:07:49,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:07:49" (1/1) ... [2018-10-27 06:07:49,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4523c546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:49, skipping insertion in model container [2018-10-27 06:07:49,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:07:49" (1/1) ... [2018-10-27 06:07:49,455 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:07:49,499 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:07:49,738 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:07:49,748 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:07:49,781 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:07:49,815 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:07:49,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:49 WrapperNode [2018-10-27 06:07:49,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:07:49,816 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:07:49,816 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:07:49,816 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:07:49,826 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:49" (1/1) ... [2018-10-27 06:07:49,836 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:49" (1/1) ... [2018-10-27 06:07:49,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:07:49,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:07:49,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:07:49,918 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:07:49,926 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:49" (1/1) ... [2018-10-27 06:07:49,926 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:49" (1/1) ... [2018-10-27 06:07:49,930 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:49" (1/1) ... [2018-10-27 06:07:49,930 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:49" (1/1) ... [2018-10-27 06:07:49,934 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:49" (1/1) ... [2018-10-27 06:07:49,938 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:49" (1/1) ... [2018-10-27 06:07:49,939 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:49" (1/1) ... [2018-10-27 06:07:49,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:07:49,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:07:49,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:07:49,943 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:07:49,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5030ac78-2644-432d-9eb6-b3fb70af50e4/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:49,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:07:49,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:07:49,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:07:49,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:07:50,425 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:07:50,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:50 BoogieIcfgContainer [2018-10-27 06:07:50,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:07:50,426 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:07:50,426 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:07:50,429 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:07:50,430 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:50,430 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:07:49" (1/3) ... [2018-10-27 06:07:50,431 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ab9e636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:07:50, skipping insertion in model container [2018-10-27 06:07:50,431 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:50,431 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:49" (2/3) ... [2018-10-27 06:07:50,432 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ab9e636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:07:50, skipping insertion in model container [2018-10-27 06:07:50,432 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:50,433 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:50" (3/3) ... [2018-10-27 06:07:50,435 INFO L375 chiAutomizerObserver]: Analyzing ICFG twisted-alloca_true-termination.c.i [2018-10-27 06:07:50,486 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:07:50,487 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:07:50,487 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:07:50,487 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:07:50,487 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:07:50,487 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:07:50,487 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:07:50,487 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:07:50,487 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:07:50,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-10-27 06:07:50,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-10-27 06:07:50,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:50,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:50,529 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:07:50,529 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:50,529 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:07:50,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-10-27 06:07:50,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-10-27 06:07:50,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:50,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:50,532 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:07:50,532 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:50,539 INFO L793 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;assume { :begin_inline_f } true;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset; 27#L553true SUMMARY for call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L553 29#L553-1true SUMMARY for call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4); srcloc: L553-1 25#L554true SUMMARY for call write~int(0, f_~i~0.base, f_~i~0.offset, 4); srcloc: L554 6#L555true SUMMARY for call write~int(0, f_~j~0.base, f_~j~0.offset, 4); srcloc: L555 17#L569true [2018-10-27 06:07:50,540 INFO L795 eck$LassoCheckResult]: Loop: 17#L569true assume !true; 26#L564true assume true; 21#L567true SUMMARY for call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); srcloc: L567 30#L564-2true assume !!(f_#t~mem11 < 1);havoc f_#t~mem11; 24#L565true SUMMARY for call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4); srcloc: L565 10#L565-1true f_#t~post13 := f_#t~mem12; 12#L565-2true SUMMARY for call write~int(f_#t~post13 + 1, f_~j~0.base, f_~j~0.offset, 4); srcloc: L565-2 13#L565-3true havoc f_#t~post13;havoc f_#t~mem12; 5#L566true SUMMARY for call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L566 8#L566-1true assume !((if f_#t~mem14 < 0 && f_#t~mem14 % 2 != 0 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2) != 0);havoc f_#t~mem14; 17#L569true [2018-10-27 06:07:50,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:50,545 INFO L82 PathProgramCache]: Analyzing trace with hash 889444101, now seen corresponding path program 1 times [2018-10-27 06:07:50,547 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:50,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:50,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:50,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:50,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:50,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:50,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1161734929, now seen corresponding path program 1 times [2018-10-27 06:07:50,714 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:50,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:50,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:50,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:50,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:50,750 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,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:50,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-27 06:07:50,757 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:50,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 06:07:50,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 06:07:50,777 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-10-27 06:07:50,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:50,788 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-10-27 06:07:50,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 06:07:50,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 35 transitions. [2018-10-27 06:07:50,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-10-27 06:07:50,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 25 states and 28 transitions. [2018-10-27 06:07:50,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-10-27 06:07:50,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-10-27 06:07:50,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2018-10-27 06:07:50,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:50,798 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-10-27 06:07:50,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2018-10-27 06:07:50,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-27 06:07:50,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-27 06:07:50,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-10-27 06:07:50,821 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-10-27 06:07:50,821 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-10-27 06:07:50,821 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:07:50,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 28 transitions. [2018-10-27 06:07:50,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-10-27 06:07:50,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:50,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:50,823 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:07:50,823 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:50,824 INFO L793 eck$LassoCheckResult]: Stem: 96#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 83#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;assume { :begin_inline_f } true;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset; 84#L553 SUMMARY for call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L553 95#L553-1 SUMMARY for call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4); srcloc: L553-1 94#L554 SUMMARY for call write~int(0, f_~i~0.base, f_~i~0.offset, 4); srcloc: L554 79#L555 SUMMARY for call write~int(0, f_~j~0.base, f_~j~0.offset, 4); srcloc: L555 80#L569 [2018-10-27 06:07:50,824 INFO L795 eck$LassoCheckResult]: Loop: 80#L569 assume true; 73#L560 SUMMARY for call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L560 75#L557-1 SUMMARY for call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L557-1 76#L557-2 assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6; 74#L564 assume true; 82#L567 SUMMARY for call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); srcloc: L567 91#L564-2 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11; 93#L565 SUMMARY for call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4); srcloc: L565 85#L565-1 f_#t~post13 := f_#t~mem12; 86#L565-2 SUMMARY for call write~int(f_#t~post13 + 1, f_~j~0.base, f_~j~0.offset, 4); srcloc: L565-2 87#L565-3 havoc f_#t~post13;havoc f_#t~mem12; 77#L566 SUMMARY for call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L566 78#L566-1 assume !((if f_#t~mem14 < 0 && f_#t~mem14 % 2 != 0 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2) != 0);havoc f_#t~mem14; 80#L569 [2018-10-27 06:07:50,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:50,824 INFO L82 PathProgramCache]: Analyzing trace with hash 889444101, now seen corresponding path program 2 times [2018-10-27 06:07:50,824 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:50,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:50,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:50,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:50,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:50,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:50,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1933748104, now seen corresponding path program 1 times [2018-10-27 06:07:50,863 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:50,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:50,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:50,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:50,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:50,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:50,904 INFO L82 PathProgramCache]: Analyzing trace with hash -2031397116, now seen corresponding path program 1 times [2018-10-27 06:07:50,904 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:50,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:50,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:50,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:50,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:51,230 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-10-27 06:07:51,521 WARN L179 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-10-27 06:07:52,264 WARN L179 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 119 [2018-10-27 06:07:52,560 WARN L179 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2018-10-27 06:07:52,578 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:52,579 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:52,580 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:52,580 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:52,580 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:52,580 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:52,581 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:52,581 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:52,581 INFO L131 ssoRankerPreferences]: Filename of dumped script: twisted-alloca_true-termination.c.i_Iteration2_Lasso [2018-10-27 06:07:52,581 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:52,581 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:52,607 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,632 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,634 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,661 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,663 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,672 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,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:52,683 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,690 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,700 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,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:52,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:53,494 WARN L179 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 125 [2018-10-27 06:07:53,640 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 93 [2018-10-27 06:07:53,641 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:53,644 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:53,647 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:53,648 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:53,650 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:53,652 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:53,654 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:53,656 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:53,657 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:53,911 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-10-27 06:07:54,246 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:54,251 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:54,253 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,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:54,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:54,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:54,260 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,260 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,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:54,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:54,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:54,262 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,263 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,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:54,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:54,269 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,270 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,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:54,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:54,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:54,272 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,272 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,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:54,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:54,280 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,280 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,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:54,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:54,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:54,283 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,283 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,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:54,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:54,289 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,289 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,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:54,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:54,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:54,291 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,292 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,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:54,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:54,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:54,294 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,294 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,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:54,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:54,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:54,296 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,296 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,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:54,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:54,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:54,299 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,299 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,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,299 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:54,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,302 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:54,302 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:54,313 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,314 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,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:54,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:54,331 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,331 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,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,332 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:54,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,334 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:54,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:54,345 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:54,346 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,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:54,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:54,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:54,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:54,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:54,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:54,357 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:07:54,372 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:07:54,372 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:07:54,374 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:07:54,376 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:07:54,386 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:07:54,387 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)_1 + 1 Supporting invariants [] [2018-10-27 06:07:54,551 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-10-27 06:07:54,558 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:07:54,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:54,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:54,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:55,026 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:55,030 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 39 treesize of output 38 [2018-10-27 06:07:55,034 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 38 treesize of output 29 [2018-10-27 06:07:55,035 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:07:55,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:07:55,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:07:55,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2018-10-27 06:07:55,113 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,115 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,115 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 4 Second operand 8 states. [2018-10-27 06:07:55,475 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 4. Second operand 8 states. Result 58 states and 65 transitions. Complement of second has 13 states. [2018-10-27 06:07:55,477 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,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:07:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-10-27 06:07:55,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 6 letters. Loop has 13 letters. [2018-10-27 06:07:55,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:55,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 19 letters. Loop has 13 letters. [2018-10-27 06:07:55,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:55,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 6 letters. Loop has 26 letters. [2018-10-27 06:07:55,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:55,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 65 transitions. [2018-10-27 06:07:55,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-10-27 06:07:55,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 49 states and 55 transitions. [2018-10-27 06:07:55,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-10-27 06:07:55,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-10-27 06:07:55,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 55 transitions. [2018-10-27 06:07:55,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:55,485 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-10-27 06:07:55,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 55 transitions. [2018-10-27 06:07:55,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-10-27 06:07:55,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-27 06:07:55,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-10-27 06:07:55,488 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-10-27 06:07:55,489 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-10-27 06:07:55,489 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:07:55,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 51 transitions. [2018-10-27 06:07:55,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-10-27 06:07:55,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:55,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:55,490 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:55,490 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:55,490 INFO L793 eck$LassoCheckResult]: Stem: 454#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 436#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;assume { :begin_inline_f } true;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset; 437#L553 SUMMARY for call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L553 453#L553-1 SUMMARY for call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4); srcloc: L553-1 452#L554 SUMMARY for call write~int(0, f_~i~0.base, f_~i~0.offset, 4); srcloc: L554 427#L555 SUMMARY for call write~int(0, f_~j~0.base, f_~j~0.offset, 4); srcloc: L555 428#L569 assume true; 442#L560 SUMMARY for call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L560 417#L557-1 SUMMARY for call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L557-1 418#L557-2 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6; 425#L558 [2018-10-27 06:07:55,491 INFO L795 eck$LassoCheckResult]: Loop: 425#L558 SUMMARY for call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L558 444#L558-1 f_#t~post9 := f_#t~mem8; 445#L558-2 SUMMARY for call write~int(f_#t~post9 + 1, f_~i~0.base, f_~i~0.offset, 4); srcloc: L558-2 449#L558-3 havoc f_#t~mem8;havoc f_#t~post9; 441#L559 SUMMARY for call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L559 414#L559-1 assume (if f_#t~mem10 < 0 && f_#t~mem10 % 2 != 0 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2) != 0;havoc f_#t~mem10; 415#L560 SUMMARY for call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L560 456#L557-1 SUMMARY for call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L557-1 455#L557-2 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6; 425#L558 [2018-10-27 06:07:55,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:55,491 INFO L82 PathProgramCache]: Analyzing trace with hash -779385108, now seen corresponding path program 1 times [2018-10-27 06:07:55,491 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:55,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:55,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:55,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:55,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:55,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:55,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1867331957, now seen corresponding path program 1 times [2018-10-27 06:07:55,560 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:55,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:55,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:55,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:55,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:55,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:55,574 INFO L82 PathProgramCache]: Analyzing trace with hash -64432128, now seen corresponding path program 1 times [2018-10-27 06:07:55,574 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:55,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:55,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:55,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:55,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:55,994 WARN L179 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-10-27 06:07:56,263 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2018-10-27 06:07:56,683 WARN L179 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 128 [2018-10-27 06:07:56,860 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-10-27 06:07:56,864 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:56,864 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:56,864 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:56,864 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:56,864 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:56,864 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:56,864 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:56,864 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:56,864 INFO L131 ssoRankerPreferences]: Filename of dumped script: twisted-alloca_true-termination.c.i_Iteration3_Lasso [2018-10-27 06:07:56,865 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:56,865 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:56,868 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:57,424 WARN L179 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 124 [2018-10-27 06:07:57,545 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2018-10-27 06:07:57,546 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:57,547 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:57,549 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:57,551 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:57,562 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:57,565 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:57,567 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:57,568 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:57,570 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:57,573 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:57,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:57,576 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:57,577 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:57,578 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:57,581 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:57,582 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:57,584 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:57,586 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:57,587 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:57,589 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:57,793 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2018-10-27 06:07:58,148 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:58,149 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:58,149 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:58,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:58,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:58,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:58,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:58,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:58,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:58,152 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:58,153 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:58,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:58,153 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:58,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:58,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:58,155 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:58,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:58,160 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:58,160 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:58,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:58,161 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:58,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:58,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:58,163 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:58,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:58,169 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:58,169 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:58,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:58,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:58,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:58,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:58,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:58,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:58,173 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:58,174 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:58,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:58,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:58,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:58,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:58,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:58,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:58,183 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:58,184 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:58,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:58,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:58,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:58,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:58,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:58,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:58,189 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:58,190 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:58,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:58,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:58,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:58,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:58,191 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:58,191 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:58,194 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:58,195 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:58,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:58,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:58,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:58,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:58,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:58,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:58,219 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:58,219 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:58,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:58,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:58,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:58,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:58,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:58,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:58,223 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:58,223 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:58,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:58,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:58,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:58,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:58,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:58,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:58,226 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:58,226 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:58,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:58,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:58,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:58,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:58,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:58,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:58,229 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:58,230 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:58,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:58,230 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:58,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:58,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:58,231 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:58,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:58,236 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:58,236 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:58,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:58,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:58,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:58,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:58,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:58,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:58,246 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:58,246 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:58,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:58,247 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:58,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:58,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:58,248 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:58,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:58,253 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:58,253 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:58,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:58,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:58,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:58,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:58,261 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:58,261 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:58,271 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:58,272 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:58,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:58,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:58,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:58,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:58,277 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:58,277 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:58,279 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:58,279 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:58,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:58,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:58,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:58,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:58,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:58,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:58,298 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:58,299 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:58,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:58,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:58,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:58,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:58,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:58,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:58,326 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:07:58,343 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:07:58,350 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:07:58,350 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:07:58,351 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:07:58,351 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:07:58,351 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_2 Supporting invariants [] [2018-10-27 06:07:59,316 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2018-10-27 06:07:59,320 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:07:59,321 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:07:59,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:59,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:59,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:59,455 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:59,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 50 [2018-10-27 06:07:59,468 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 39 treesize of output 32 [2018-10-27 06:07:59,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:59,492 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:59,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2018-10-27 06:07:59,508 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-10-27 06:07:59,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:07:59,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:07:59,561 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-10-27 06:07:59,632 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:59,633 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:59,633 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 51 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-10-27 06:07:59,740 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 51 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 75 states and 85 transitions. Complement of second has 13 states. [2018-10-27 06:07:59,742 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:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:07:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2018-10-27 06:07:59,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 10 letters. Loop has 9 letters. [2018-10-27 06:07:59,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:59,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 19 letters. Loop has 9 letters. [2018-10-27 06:07:59,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:59,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 10 letters. Loop has 18 letters. [2018-10-27 06:07:59,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:59,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 85 transitions. [2018-10-27 06:07:59,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-10-27 06:07:59,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 69 states and 78 transitions. [2018-10-27 06:07:59,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-10-27 06:07:59,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-10-27 06:07:59,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 78 transitions. [2018-10-27 06:07:59,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:59,746 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 78 transitions. [2018-10-27 06:07:59,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 78 transitions. [2018-10-27 06:07:59,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2018-10-27 06:07:59,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-27 06:07:59,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2018-10-27 06:07:59,749 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 72 transitions. [2018-10-27 06:07:59,750 INFO L608 BuchiCegarLoop]: Abstraction has 63 states and 72 transitions. [2018-10-27 06:07:59,750 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:07:59,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 72 transitions. [2018-10-27 06:07:59,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-10-27 06:07:59,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:59,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:59,753 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:59,753 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:59,753 INFO L793 eck$LassoCheckResult]: Stem: 837#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 813#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;assume { :begin_inline_f } true;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset; 814#L553 SUMMARY for call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L553 836#L553-1 SUMMARY for call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4); srcloc: L553-1 834#L554 SUMMARY for call write~int(0, f_~i~0.base, f_~i~0.offset, 4); srcloc: L554 803#L555 SUMMARY for call write~int(0, f_~j~0.base, f_~j~0.offset, 4); srcloc: L555 804#L569 assume true; 840#L560 SUMMARY for call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L560 843#L557-1 SUMMARY for call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L557-1 842#L557-2 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6; 841#L558 SUMMARY for call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L558 825#L558-1 f_#t~post9 := f_#t~mem8; 826#L558-2 SUMMARY for call write~int(f_#t~post9 + 1, f_~i~0.base, f_~i~0.offset, 4); srcloc: L558-2 830#L558-3 havoc f_#t~mem8;havoc f_#t~post9; 818#L559 SUMMARY for call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L559 789#L559-1 assume !((if f_#t~mem10 < 0 && f_#t~mem10 % 2 != 0 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2) != 0);havoc f_#t~mem10; 791#L564 [2018-10-27 06:07:59,753 INFO L795 eck$LassoCheckResult]: Loop: 791#L564 assume true; 805#L567 SUMMARY for call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); srcloc: L567 828#L564-2 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11; 832#L565 SUMMARY for call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4); srcloc: L565 809#L565-1 f_#t~post13 := f_#t~mem12; 810#L565-2 SUMMARY for call write~int(f_#t~post13 + 1, f_~j~0.base, f_~j~0.offset, 4); srcloc: L565-2 815#L565-3 havoc f_#t~post13;havoc f_#t~mem12; 798#L566 SUMMARY for call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L566 799#L566-1 assume !((if f_#t~mem14 < 0 && f_#t~mem14 % 2 != 0 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2) != 0);havoc f_#t~mem14; 806#L569 assume true; 820#L560 SUMMARY for call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L560 847#L557-1 SUMMARY for call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L557-1 845#L557-2 assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6; 791#L564 [2018-10-27 06:07:59,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:59,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1508019949, now seen corresponding path program 1 times [2018-10-27 06:07:59,754 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:59,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:59,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:59,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:59,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:59,888 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:59,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:59,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-27 06:07:59,888 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:59,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:59,889 INFO L82 PathProgramCache]: Analyzing trace with hash -253086798, now seen corresponding path program 2 times [2018-10-27 06:07:59,889 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:59,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:59,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:59,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:59,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:00,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:08:00,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:08:00,078 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. cyclomatic complexity: 12 Second operand 10 states. [2018-10-27 06:08:00,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:00,239 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2018-10-27 06:08:00,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 06:08:00,241 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 112 transitions. [2018-10-27 06:08:00,243 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2018-10-27 06:08:00,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 112 transitions. [2018-10-27 06:08:00,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2018-10-27 06:08:00,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2018-10-27 06:08:00,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 112 transitions. [2018-10-27 06:08:00,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:00,245 INFO L705 BuchiCegarLoop]: Abstraction has 100 states and 112 transitions. [2018-10-27 06:08:00,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 112 transitions. [2018-10-27 06:08:00,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 68. [2018-10-27 06:08:00,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-27 06:08:00,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2018-10-27 06:08:00,251 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 77 transitions. [2018-10-27 06:08:00,251 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 77 transitions. [2018-10-27 06:08:00,251 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:08:00,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 77 transitions. [2018-10-27 06:08:00,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-10-27 06:08:00,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:00,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:00,253 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:00,253 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:00,253 INFO L793 eck$LassoCheckResult]: Stem: 1029#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 998#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;assume { :begin_inline_f } true;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset; 999#L553 SUMMARY for call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L553 1028#L553-1 SUMMARY for call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4); srcloc: L553-1 1025#L554 SUMMARY for call write~int(0, f_~i~0.base, f_~i~0.offset, 4); srcloc: L554 989#L555 SUMMARY for call write~int(0, f_~j~0.base, f_~j~0.offset, 4); srcloc: L555 990#L569 assume true; 1032#L560 SUMMARY for call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L560 1036#L557-1 SUMMARY for call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L557-1 991#L557-2 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6; 992#L558 SUMMARY for call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L558 1042#L558-1 f_#t~post9 := f_#t~mem8; 1041#L558-2 SUMMARY for call write~int(f_#t~post9 + 1, f_~i~0.base, f_~i~0.offset, 4); srcloc: L558-2 1022#L558-3 havoc f_#t~mem8;havoc f_#t~post9; 1007#L559 SUMMARY for call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L559 977#L559-1 assume (if f_#t~mem10 < 0 && f_#t~mem10 % 2 != 0 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2) != 0;havoc f_#t~mem10; 978#L560 SUMMARY for call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L560 981#L557-1 SUMMARY for call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L557-1 982#L557-2 assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6; 1026#L564 [2018-10-27 06:08:00,254 INFO L795 eck$LassoCheckResult]: Loop: 1026#L564 assume true; 994#L567 SUMMARY for call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); srcloc: L567 1017#L564-2 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11; 1023#L565 SUMMARY for call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4); srcloc: L565 1000#L565-1 f_#t~post13 := f_#t~mem12; 1001#L565-2 SUMMARY for call write~int(f_#t~post13 + 1, f_~j~0.base, f_~j~0.offset, 4); srcloc: L565-2 1004#L565-3 havoc f_#t~post13;havoc f_#t~mem12; 985#L566 SUMMARY for call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L566 986#L566-1 assume !((if f_#t~mem14 < 0 && f_#t~mem14 % 2 != 0 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2) != 0);havoc f_#t~mem14; 995#L569 assume true; 1009#L560 SUMMARY for call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L560 1044#L557-1 SUMMARY for call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L557-1 1043#L557-2 assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6; 1026#L564 [2018-10-27 06:08:00,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:00,254 INFO L82 PathProgramCache]: Analyzing trace with hash -64432130, now seen corresponding path program 1 times [2018-10-27 06:08:00,254 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:00,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:00,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:00,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:00,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:00,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:00,288 INFO L82 PathProgramCache]: Analyzing trace with hash -253086798, now seen corresponding path program 3 times [2018-10-27 06:08:00,288 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:00,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:00,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:00,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:00,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:00,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:00,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1917255381, now seen corresponding path program 1 times [2018-10-27 06:08:00,301 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:00,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:00,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:00,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:00,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:00,588 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:00,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:00,588 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5030ac78-2644-432d-9eb6-b3fb70af50e4/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:00,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:00,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:00,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-10-27 06:08:00,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-10-27 06:08:00,671 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:00,672 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:00,673 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:00,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-10-27 06:08:00,674 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:00,682 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:00,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:00,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:00,689 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:14, output treesize:4 [2018-10-27 06:08:00,693 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 11 treesize of output 8 [2018-10-27 06:08:00,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:00,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:00,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:00,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:00,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-10-27 06:08:00,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 06:08:00,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:00,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:00,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:00,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:00,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-10-27 06:08:00,797 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:00,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2018-10-27 06:08:00,801 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-10-27 06:08:00,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:00,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:00,812 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:08:00,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:00,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-10-27 06:08:00,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-10-27 06:08:00,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:00,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:00,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:00,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:18 [2018-10-27 06:08:00,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 06:08:00,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-10-27 06:08:00,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:00,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:00,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:00,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:10 [2018-10-27 06:08:00,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:00,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:00,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2018-10-27 06:08:01,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-27 06:08:01,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-10-27 06:08:01,093 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. cyclomatic complexity: 12 Second operand 19 states. [2018-10-27 06:08:01,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:01,606 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2018-10-27 06:08:01,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 06:08:01,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 145 transitions. [2018-10-27 06:08:01,608 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-10-27 06:08:01,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 133 states and 145 transitions. [2018-10-27 06:08:01,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2018-10-27 06:08:01,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2018-10-27 06:08:01,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133 states and 145 transitions. [2018-10-27 06:08:01,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:01,610 INFO L705 BuchiCegarLoop]: Abstraction has 133 states and 145 transitions. [2018-10-27 06:08:01,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 145 transitions. [2018-10-27 06:08:01,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 80. [2018-10-27 06:08:01,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-27 06:08:01,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2018-10-27 06:08:01,617 INFO L728 BuchiCegarLoop]: Abstraction has 80 states and 89 transitions. [2018-10-27 06:08:01,617 INFO L608 BuchiCegarLoop]: Abstraction has 80 states and 89 transitions. [2018-10-27 06:08:01,617 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:08:01,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 89 transitions. [2018-10-27 06:08:01,618 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-10-27 06:08:01,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:01,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:01,619 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:01,619 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:01,619 INFO L793 eck$LassoCheckResult]: Stem: 1366#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1338#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;assume { :begin_inline_f } true;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset; 1339#L553 SUMMARY for call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L553 1365#L553-1 SUMMARY for call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4); srcloc: L553-1 1362#L554 SUMMARY for call write~int(0, f_~i~0.base, f_~i~0.offset, 4); srcloc: L554 1329#L555 SUMMARY for call write~int(0, f_~j~0.base, f_~j~0.offset, 4); srcloc: L555 1330#L569 assume true; 1346#L560 SUMMARY for call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L560 1387#L557-1 SUMMARY for call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L557-1 1372#L557-2 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6; 1348#L558 SUMMARY for call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L558 1349#L558-1 f_#t~post9 := f_#t~mem8; 1357#L558-2 SUMMARY for call write~int(f_#t~post9 + 1, f_~i~0.base, f_~i~0.offset, 4); srcloc: L558-2 1358#L558-3 havoc f_#t~mem8;havoc f_#t~post9; 1344#L559 SUMMARY for call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L559 1315#L559-1 assume (if f_#t~mem10 < 0 && f_#t~mem10 % 2 != 0 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2) != 0;havoc f_#t~mem10; 1316#L560 SUMMARY for call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L560 1319#L557-1 SUMMARY for call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L557-1 1320#L557-2 assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6; 1327#L564 assume true; 1363#L567 [2018-10-27 06:08:01,619 INFO L795 eck$LassoCheckResult]: Loop: 1363#L567 SUMMARY for call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); srcloc: L567 1385#L564-2 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11; 1382#L565 SUMMARY for call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4); srcloc: L565 1375#L565-1 f_#t~post13 := f_#t~mem12; 1374#L565-2 SUMMARY for call write~int(f_#t~post13 + 1, f_~j~0.base, f_~j~0.offset, 4); srcloc: L565-2 1342#L565-3 havoc f_#t~post13;havoc f_#t~mem12; 1343#L566 SUMMARY for call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L566 1369#L566-1 assume (if f_#t~mem14 < 0 && f_#t~mem14 % 2 != 0 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2) != 0;havoc f_#t~mem14; 1363#L567 [2018-10-27 06:08:01,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:01,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1997395996, now seen corresponding path program 1 times [2018-10-27 06:08:01,619 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:01,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:01,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:01,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:01,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:01,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:01,651 INFO L82 PathProgramCache]: Analyzing trace with hash -219388021, now seen corresponding path program 1 times [2018-10-27 06:08:01,651 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:01,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:01,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:01,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:01,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:01,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:01,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1333132398, now seen corresponding path program 1 times [2018-10-27 06:08:01,662 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:01,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:01,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:01,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:01,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:02,084 WARN L179 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-10-27 06:08:02,279 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-10-27 06:08:02,794 WARN L179 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 146 [2018-10-27 06:08:03,024 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-10-27 06:08:03,026 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:03,026 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:03,026 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:03,026 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:03,026 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:03,027 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:03,027 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:03,027 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:03,027 INFO L131 ssoRankerPreferences]: Filename of dumped script: twisted-alloca_true-termination.c.i_Iteration6_Lasso [2018-10-27 06:08:03,027 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:03,027 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:03,030 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:08:03,044 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:08:03,046 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:08:03,048 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:08:03,552 WARN L179 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 119 [2018-10-27 06:08:03,699 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2018-10-27 06:08:03,699 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:08:03,700 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:08:03,701 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:08:03,704 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:08:03,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:03,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:03,709 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:08:03,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:03,732 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:08:03,740 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:08:03,741 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:08:03,743 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:08:03,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:08:03,745 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:08:03,746 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:08:03,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:08:03,748 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:08:04,239 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:04,239 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:04,240 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:08:04,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:04,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:04,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:04,241 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,242 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:08:04,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:04,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:04,253 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,253 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:08:04,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:04,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:04,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:04,255 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,255 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:08:04,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:04,256 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:04,257 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,258 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:08:04,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,259 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:04,259 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:04,265 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,265 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:08:04,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,266 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:04,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,267 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:04,267 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:04,277 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,277 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:08:04,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,278 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:04,278 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:04,285 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:04,289 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:08:04,289 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:08:04,289 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:04,290 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:04,290 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:04,290 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)_3) = -2*v_rep(select (select #memory_int ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)_3 + 1 Supporting invariants [] [2018-10-27 06:08:04,528 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2018-10-27 06:08:04,537 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:08:04,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:04,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:04,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:04,712 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:04,712 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 39 treesize of output 38 [2018-10-27 06:08:04,716 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 38 treesize of output 29 [2018-10-27 06:08:04,717 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:04,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:04,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:04,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2018-10-27 06:08:04,742 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:08:04,743 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:08:04,743 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 89 transitions. cyclomatic complexity: 13 Second operand 7 states. [2018-10-27 06:08:04,786 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 89 transitions. cyclomatic complexity: 13. Second operand 7 states. Result 191 states and 210 transitions. Complement of second has 13 states. [2018-10-27 06:08:04,788 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:08:04,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:08:04,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2018-10-27 06:08:04,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 20 letters. Loop has 8 letters. [2018-10-27 06:08:04,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:04,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 28 letters. Loop has 8 letters. [2018-10-27 06:08:04,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:04,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 20 letters. Loop has 16 letters. [2018-10-27 06:08:04,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:04,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 210 transitions. [2018-10-27 06:08:04,796 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-10-27 06:08:04,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 132 states and 145 transitions. [2018-10-27 06:08:04,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2018-10-27 06:08:04,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 81 [2018-10-27 06:08:04,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 145 transitions. [2018-10-27 06:08:04,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:04,798 INFO L705 BuchiCegarLoop]: Abstraction has 132 states and 145 transitions. [2018-10-27 06:08:04,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 145 transitions. [2018-10-27 06:08:04,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2018-10-27 06:08:04,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-27 06:08:04,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2018-10-27 06:08:04,807 INFO L728 BuchiCegarLoop]: Abstraction has 122 states and 135 transitions. [2018-10-27 06:08:04,808 INFO L608 BuchiCegarLoop]: Abstraction has 122 states and 135 transitions. [2018-10-27 06:08:04,808 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:08:04,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 135 transitions. [2018-10-27 06:08:04,808 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-10-27 06:08:04,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:04,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:04,809 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:04,809 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:04,810 INFO L793 eck$LassoCheckResult]: Stem: 1914#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1877#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;assume { :begin_inline_f } true;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset; 1878#L553 SUMMARY for call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L553 1913#L553-1 SUMMARY for call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4); srcloc: L553-1 1910#L554 SUMMARY for call write~int(0, f_~i~0.base, f_~i~0.offset, 4); srcloc: L554 1867#L555 SUMMARY for call write~int(0, f_~j~0.base, f_~j~0.offset, 4); srcloc: L555 1868#L569 assume true; 1891#L560 SUMMARY for call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L560 1858#L557-1 SUMMARY for call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L557-1 1859#L557-2 assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6; 1866#L564 assume true; 1871#L567 SUMMARY for call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); srcloc: L567 1901#L564-2 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11; 1908#L565 SUMMARY for call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4); srcloc: L565 1909#L565-1 f_#t~post13 := f_#t~mem12; 1881#L565-2 SUMMARY for call write~int(f_#t~post13 + 1, f_~j~0.base, f_~j~0.offset, 4); srcloc: L565-2 1882#L565-3 havoc f_#t~post13;havoc f_#t~mem12; 1949#L566 SUMMARY for call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L566 1948#L566-1 assume !((if f_#t~mem14 < 0 && f_#t~mem14 % 2 != 0 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2) != 0);havoc f_#t~mem14; 1946#L569 assume true; 1944#L560 SUMMARY for call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L560 1942#L557-1 SUMMARY for call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L557-1 1941#L557-2 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6; 1939#L558 SUMMARY for call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L558 1940#L558-1 f_#t~post9 := f_#t~mem8; 1962#L558-2 SUMMARY for call write~int(f_#t~post9 + 1, f_~i~0.base, f_~i~0.offset, 4); srcloc: L558-2 1961#L558-3 havoc f_#t~mem8;havoc f_#t~post9; 1960#L559 SUMMARY for call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L559 1852#L559-1 assume (if f_#t~mem10 < 0 && f_#t~mem10 % 2 != 0 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2) != 0;havoc f_#t~mem10; 1853#L560 SUMMARY for call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L560 1856#L557-1 SUMMARY for call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L557-1 1857#L557-2 assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6; 1957#L564 assume true; 1918#L567 [2018-10-27 06:08:04,810 INFO L795 eck$LassoCheckResult]: Loop: 1918#L567 SUMMARY for call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); srcloc: L567 1919#L564-2 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11; 1906#L565 SUMMARY for call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4); srcloc: L565 1907#L565-1 f_#t~post13 := f_#t~mem12; 1879#L565-2 SUMMARY for call write~int(f_#t~post13 + 1, f_~j~0.base, f_~j~0.offset, 4); srcloc: L565-2 1880#L565-3 havoc f_#t~post13;havoc f_#t~mem12; 1938#L566 SUMMARY for call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L566 1936#L566-1 assume (if f_#t~mem14 < 0 && f_#t~mem14 % 2 != 0 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2) != 0;havoc f_#t~mem14; 1918#L567 [2018-10-27 06:08:04,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:04,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1440628131, now seen corresponding path program 2 times [2018-10-27 06:08:04,810 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:04,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:04,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:04,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:04,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:05,065 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:05,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:05,065 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5030ac78-2644-432d-9eb6-b3fb70af50e4/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:05,073 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:08:05,092 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:08:05,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:05,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:05,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-10-27 06:08:05,116 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:05,118 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:05,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2018-10-27 06:08:05,131 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:05,132 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:05,133 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:05,134 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:05,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-10-27 06:08:05,135 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:05,141 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:05,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:05,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:05,150 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-27 06:08:05,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 34 [2018-10-27 06:08:05,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 06:08:05,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:05,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:05,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:05,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:16 [2018-10-27 06:08:05,326 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:05,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:05,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-10-27 06:08:05,350 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:05,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:05,351 INFO L82 PathProgramCache]: Analyzing trace with hash -219388021, now seen corresponding path program 2 times [2018-10-27 06:08:05,351 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:05,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:05,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:05,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:05,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:05,728 WARN L179 SmtUtils]: Spent 368.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-10-27 06:08:06,129 WARN L179 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-10-27 06:08:06,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 06:08:06,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-10-27 06:08:06,130 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. cyclomatic complexity: 19 Second operand 17 states. [2018-10-27 06:08:06,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:06,354 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2018-10-27 06:08:06,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 06:08:06,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 134 transitions. [2018-10-27 06:08:06,357 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2018-10-27 06:08:06,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 73 states and 79 transitions. [2018-10-27 06:08:06,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2018-10-27 06:08:06,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2018-10-27 06:08:06,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 79 transitions. [2018-10-27 06:08:06,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:06,359 INFO L705 BuchiCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-10-27 06:08:06,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 79 transitions. [2018-10-27 06:08:06,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-10-27 06:08:06,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-27 06:08:06,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2018-10-27 06:08:06,362 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-10-27 06:08:06,362 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-10-27 06:08:06,362 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:08:06,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 79 transitions. [2018-10-27 06:08:06,363 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2018-10-27 06:08:06,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:06,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:06,363 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:06,364 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:06,371 INFO L793 eck$LassoCheckResult]: Stem: 2271#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2247#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;assume { :begin_inline_f } true;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset; 2248#L553 SUMMARY for call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L553 2270#L553-1 SUMMARY for call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4); srcloc: L553-1 2269#L554 SUMMARY for call write~int(0, f_~i~0.base, f_~i~0.offset, 4); srcloc: L554 2239#L555 SUMMARY for call write~int(0, f_~j~0.base, f_~j~0.offset, 4); srcloc: L555 2240#L569 assume true; 2282#L560 SUMMARY for call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L560 2281#L557-1 SUMMARY for call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L557-1 2279#L557-2 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6; 2277#L558 SUMMARY for call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L558 2258#L558-1 f_#t~post9 := f_#t~mem8; 2261#L558-2 SUMMARY for call write~int(f_#t~post9 + 1, f_~i~0.base, f_~i~0.offset, 4); srcloc: L558-2 2266#L558-3 havoc f_#t~mem8;havoc f_#t~post9; 2254#L559 SUMMARY for call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L559 2226#L559-1 assume (if f_#t~mem10 < 0 && f_#t~mem10 % 2 != 0 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2) != 0;havoc f_#t~mem10; 2227#L560 SUMMARY for call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L560 2230#L557-1 SUMMARY for call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L557-1 2231#L557-2 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6; 2238#L558 SUMMARY for call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L558 2259#L558-1 f_#t~post9 := f_#t~mem8; 2280#L558-2 SUMMARY for call write~int(f_#t~post9 + 1, f_~i~0.base, f_~i~0.offset, 4); srcloc: L558-2 2278#L558-3 havoc f_#t~mem8;havoc f_#t~post9; 2276#L559 SUMMARY for call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L559 2275#L559-1 assume !((if f_#t~mem10 < 0 && f_#t~mem10 % 2 != 0 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2) != 0);havoc f_#t~mem10; 2274#L564 assume true; 2273#L567 SUMMARY for call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); srcloc: L567 2264#L564-2 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11; 2268#L565 SUMMARY for call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4); srcloc: L565 2245#L565-1 f_#t~post13 := f_#t~mem12; 2246#L565-2 SUMMARY for call write~int(f_#t~post13 + 1, f_~j~0.base, f_~j~0.offset, 4); srcloc: L565-2 2251#L565-3 havoc f_#t~post13;havoc f_#t~mem12; 2232#L566 SUMMARY for call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L566 2233#L566-1 assume !((if f_#t~mem14 < 0 && f_#t~mem14 % 2 != 0 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2) != 0);havoc f_#t~mem14; 2241#L569 assume true; 2255#L560 SUMMARY for call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L560 2228#L557-1 SUMMARY for call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L557-1 2229#L557-2 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6; 2256#L558 [2018-10-27 06:08:06,371 INFO L795 eck$LassoCheckResult]: Loop: 2256#L558 SUMMARY for call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L558 2257#L558-1 f_#t~post9 := f_#t~mem8; 2260#L558-2 SUMMARY for call write~int(f_#t~post9 + 1, f_~i~0.base, f_~i~0.offset, 4); srcloc: L558-2 2265#L558-3 havoc f_#t~mem8;havoc f_#t~post9; 2253#L559 SUMMARY for call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L559 2223#L559-1 assume (if f_#t~mem10 < 0 && f_#t~mem10 % 2 != 0 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2) != 0;havoc f_#t~mem10; 2224#L560 SUMMARY for call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L560 2295#L557-1 SUMMARY for call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L557-1 2294#L557-2 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6; 2256#L558 [2018-10-27 06:08:06,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:06,372 INFO L82 PathProgramCache]: Analyzing trace with hash 88104526, now seen corresponding path program 1 times [2018-10-27 06:08:06,372 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:06,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:06,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:06,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:06,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:06,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:06,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1867331957, now seen corresponding path program 2 times [2018-10-27 06:08:06,413 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:06,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:06,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:06,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:06,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:06,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:06,423 INFO L82 PathProgramCache]: Analyzing trace with hash -451727650, now seen corresponding path program 2 times [2018-10-27 06:08:06,423 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:06,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:06,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:06,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:06,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:07,616 WARN L179 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 228 DAG size of output: 177 [2018-10-27 06:08:07,914 WARN L179 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-10-27 06:08:07,917 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:07,918 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:07,918 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:07,918 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:07,918 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:07,918 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:07,918 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:07,918 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:07,918 INFO L131 ssoRankerPreferences]: Filename of dumped script: twisted-alloca_true-termination.c.i_Iteration8_Lasso [2018-10-27 06:08:07,918 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:07,918 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:07,922 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:08:07,964 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:08:07,978 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:08:07,979 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:08:07,981 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:08:07,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:07,984 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:08:07,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:07,986 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:08:08,390 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 121 [2018-10-27 06:08:08,480 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:08:08,481 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:08:08,482 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:08:08,483 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:08:08,484 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:08:08,486 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:08:08,487 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:08:08,488 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:08:08,489 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:08:08,490 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:08:08,492 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:08:08,493 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:08:08,693 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-10-27 06:08:09,006 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:09,007 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:09,007 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:08:09,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:09,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:09,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:09,014 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,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:08:09,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:09,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:09,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:09,015 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,015 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:08:09,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:09,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:09,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:09,017 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,017 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:08:09,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:09,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,019 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,019 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:08:09,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:09,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:09,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:09,025 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,025 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:08:09,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:09,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,027 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,027 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:08:09,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:09,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:09,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:09,030 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,030 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:08:09,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,031 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:09,031 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,032 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,033 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:08:09,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:09,034 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,035 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,035 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:08:09,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:09,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,068 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,069 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:08:09,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:09,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,071 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,071 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:08:09,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,071 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:09,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,080 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:09,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,083 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,083 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:08:09,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:09,089 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,089 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,090 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:08:09,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:09,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,101 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,101 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:08:09,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,103 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:09,103 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,104 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,105 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:08:09,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,106 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:09,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,107 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,116 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:08:09,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:09,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,122 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,122 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:08:09,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,122 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:09,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,123 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:09,123 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,134 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,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:08:09,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,134 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:09,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,135 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:09,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,138 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,139 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:08:09,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:09,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,157 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,158 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:08:09,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:09,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,164 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,164 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:08:09,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,165 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:09,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,166 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:09,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,173 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,174 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:08:09,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:09,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,194 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,194 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:08:09,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:09,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,202 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,203 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:08:09,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:09,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,218 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:09,229 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:08:09,229 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-10-27 06:08:09,229 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:09,230 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:09,230 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:09,230 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_4, v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_4 - 1*v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_4 Supporting invariants [] [2018-10-27 06:08:09,471 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2018-10-27 06:08:09,472 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:08:09,472 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:08:09,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:09,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:09,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:09,542 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:09,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 50 [2018-10-27 06:08:09,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 46 [2018-10-27 06:08:09,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-10-27 06:08:09,596 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:09,596 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 27 treesize of output 28 [2018-10-27 06:08:09,597 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:09,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:09,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:09,618 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-10-27 06:08:09,660 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:08:09,660 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:08:09,660 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 79 transitions. cyclomatic complexity: 10 Second operand 7 states. [2018-10-27 06:08:09,730 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 73 states and 79 transitions. cyclomatic complexity: 10. Second operand 7 states. Result 96 states and 103 transitions. Complement of second has 13 states. [2018-10-27 06:08:09,740 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:08:09,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:08:09,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2018-10-27 06:08:09,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 38 letters. Loop has 9 letters. [2018-10-27 06:08:09,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:09,741 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:08:09,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:09,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:09,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:09,812 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:09,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 50 [2018-10-27 06:08:09,825 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 39 treesize of output 32 [2018-10-27 06:08:09,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:09,843 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:09,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2018-10-27 06:08:09,852 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-10-27 06:08:09,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:09,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:09,881 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-10-27 06:08:09,921 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:08:09,921 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:08:09,921 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 79 transitions. cyclomatic complexity: 10 Second operand 7 states. [2018-10-27 06:08:10,007 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 73 states and 79 transitions. cyclomatic complexity: 10. Second operand 7 states. Result 96 states and 103 transitions. Complement of second has 13 states. [2018-10-27 06:08:10,010 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:08:10,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:08:10,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2018-10-27 06:08:10,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 38 letters. Loop has 9 letters. [2018-10-27 06:08:10,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:10,011 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:08:10,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:10,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:10,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:10,079 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:10,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 50 [2018-10-27 06:08:10,096 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 39 treesize of output 32 [2018-10-27 06:08:10,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:10,115 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:10,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2018-10-27 06:08:10,125 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-10-27 06:08:10,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:10,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:10,149 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-10-27 06:08:10,192 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:08:10,192 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:08:10,192 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 79 transitions. cyclomatic complexity: 10 Second operand 7 states. [2018-10-27 06:08:10,268 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 73 states and 79 transitions. cyclomatic complexity: 10. Second operand 7 states. Result 131 states and 140 transitions. Complement of second has 12 states. [2018-10-27 06:08:10,268 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:08:10,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:08:10,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2018-10-27 06:08:10,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 45 transitions. Stem has 38 letters. Loop has 9 letters. [2018-10-27 06:08:10,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:10,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 45 transitions. Stem has 47 letters. Loop has 9 letters. [2018-10-27 06:08:10,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:10,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 45 transitions. Stem has 38 letters. Loop has 18 letters. [2018-10-27 06:08:10,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:10,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 140 transitions. [2018-10-27 06:08:10,272 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2018-10-27 06:08:10,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 100 states and 108 transitions. [2018-10-27 06:08:10,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-10-27 06:08:10,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2018-10-27 06:08:10,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 108 transitions. [2018-10-27 06:08:10,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:10,278 INFO L705 BuchiCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-10-27 06:08:10,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 108 transitions. [2018-10-27 06:08:10,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2018-10-27 06:08:10,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-27 06:08:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2018-10-27 06:08:10,282 INFO L728 BuchiCegarLoop]: Abstraction has 82 states and 90 transitions. [2018-10-27 06:08:10,282 INFO L608 BuchiCegarLoop]: Abstraction has 82 states and 90 transitions. [2018-10-27 06:08:10,282 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-10-27 06:08:10,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 90 transitions. [2018-10-27 06:08:10,282 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-10-27 06:08:10,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:10,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:10,283 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:10,283 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:10,283 INFO L793 eck$LassoCheckResult]: Stem: 3324#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3291#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;assume { :begin_inline_f } true;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset; 3292#L553 SUMMARY for call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L553 3323#L553-1 SUMMARY for call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4); srcloc: L553-1 3322#L554 SUMMARY for call write~int(0, f_~i~0.base, f_~i~0.offset, 4); srcloc: L554 3282#L555 SUMMARY for call write~int(0, f_~j~0.base, f_~j~0.offset, 4); srcloc: L555 3283#L569 assume true; 3339#L560 SUMMARY for call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L560 3336#L557-1 SUMMARY for call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L557-1 3334#L557-2 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6; 3305#L558 SUMMARY for call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L558 3306#L558-1 f_#t~post9 := f_#t~mem8; 3341#L558-2 SUMMARY for call write~int(f_#t~post9 + 1, f_~i~0.base, f_~i~0.offset, 4); srcloc: L558-2 3340#L558-3 havoc f_#t~mem8;havoc f_#t~post9; 3303#L559 SUMMARY for call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L559 3272#L559-1 assume (if f_#t~mem10 < 0 && f_#t~mem10 % 2 != 0 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2) != 0;havoc f_#t~mem10; 3273#L560 SUMMARY for call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L560 3327#L557-1 SUMMARY for call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L557-1 3286#L557-2 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6; 3287#L558 SUMMARY for call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L558 3332#L558-1 f_#t~post9 := f_#t~mem8; 3315#L558-2 SUMMARY for call write~int(f_#t~post9 + 1, f_~i~0.base, f_~i~0.offset, 4); srcloc: L558-2 3316#L558-3 havoc f_#t~mem8;havoc f_#t~post9; 3318#L559 SUMMARY for call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L559 3330#L559-1 assume !((if f_#t~mem10 < 0 && f_#t~mem10 % 2 != 0 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2) != 0);havoc f_#t~mem10; 3329#L564 assume true; 3328#L567 SUMMARY for call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); srcloc: L567 3314#L564-2 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11; 3321#L565 SUMMARY for call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4); srcloc: L565 3295#L565-1 f_#t~post13 := f_#t~mem12; 3296#L565-2 SUMMARY for call write~int(f_#t~post13 + 1, f_~j~0.base, f_~j~0.offset, 4); srcloc: L565-2 3299#L565-3 havoc f_#t~post13;havoc f_#t~mem12; 3301#L566 SUMMARY for call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L566 3350#L566-1 assume !((if f_#t~mem14 < 0 && f_#t~mem14 % 2 != 0 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2) != 0);havoc f_#t~mem14; 3349#L569 assume true; 3348#L560 SUMMARY for call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L560 3347#L557-1 SUMMARY for call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L557-1 3335#L557-2 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6; 3333#L558 [2018-10-27 06:08:10,284 INFO L795 eck$LassoCheckResult]: Loop: 3333#L558 SUMMARY for call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L558 3309#L558-1 f_#t~post9 := f_#t~mem8; 3310#L558-2 SUMMARY for call write~int(f_#t~post9 + 1, f_~i~0.base, f_~i~0.offset, 4); srcloc: L558-2 3331#L558-3 havoc f_#t~mem8;havoc f_#t~post9; 3302#L559 SUMMARY for call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L559 3269#L559-1 assume !((if f_#t~mem10 < 0 && f_#t~mem10 % 2 != 0 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2) != 0);havoc f_#t~mem10; 3271#L564 assume true; 3288#L567 SUMMARY for call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); srcloc: L567 3325#L564-2 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11; 3320#L565 SUMMARY for call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4); srcloc: L565 3293#L565-1 f_#t~post13 := f_#t~mem12; 3294#L565-2 SUMMARY for call write~int(f_#t~post13 + 1, f_~j~0.base, f_~j~0.offset, 4); srcloc: L565-2 3300#L565-3 havoc f_#t~post13;havoc f_#t~mem12; 3278#L566 SUMMARY for call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L566 3279#L566-1 assume !((if f_#t~mem14 < 0 && f_#t~mem14 % 2 != 0 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2) != 0);havoc f_#t~mem14; 3289#L569 assume true; 3342#L560 SUMMARY for call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4); srcloc: L560 3274#L557-1 SUMMARY for call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); srcloc: L557-1 3275#L557-2 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6; 3333#L558 [2018-10-27 06:08:10,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:10,284 INFO L82 PathProgramCache]: Analyzing trace with hash 88104526, now seen corresponding path program 3 times [2018-10-27 06:08:10,284 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:10,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:10,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:10,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:10,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:10,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:10,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1563036845, now seen corresponding path program 1 times [2018-10-27 06:08:10,330 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:10,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:10,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:10,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:10,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:10,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:10,360 INFO L82 PathProgramCache]: Analyzing trace with hash -397514432, now seen corresponding path program 4 times [2018-10-27 06:08:10,361 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:10,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:10,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:10,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:10,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:10,780 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 06:08:11,380 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 11 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:11,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:11,381 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5030ac78-2644-432d-9eb6-b3fb70af50e4/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:11,399 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 06:08:11,440 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 06:08:11,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:11,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:11,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-10-27 06:08:11,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-10-27 06:08:11,462 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:11,465 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:11,465 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:11,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-10-27 06:08:11,466 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,470 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,477 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:14, output treesize:4 [2018-10-27 06:08:11,480 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 11 treesize of output 8 [2018-10-27 06:08:11,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:11,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-10-27 06:08:11,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-10-27 06:08:11,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 06:08:11,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,598 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:08:11,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 [2018-10-27 06:08:11,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-10-27 06:08:11,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 06:08:11,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 [2018-10-27 06:08:11,658 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:11,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:08:11,660 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-10-27 06:08:11,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,678 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:08:11,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:12 [2018-10-27 06:08:11,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-10-27 06:08:11,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 06:08:11,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:7 [2018-10-27 06:08:11,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 06:08:11,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-10-27 06:08:11,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-27 06:08:11,757 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 17 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 06:08:11,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:11,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 24 [2018-10-27 06:08:11,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-27 06:08:11,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2018-10-27 06:08:11,937 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. cyclomatic complexity: 12 Second operand 24 states. [2018-10-27 06:08:13,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:13,239 INFO L93 Difference]: Finished difference Result 163 states and 168 transitions. [2018-10-27 06:08:13,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-27 06:08:13,241 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 168 transitions. [2018-10-27 06:08:13,242 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:08:13,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 0 states and 0 transitions. [2018-10-27 06:08:13,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:08:13,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:08:13,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:08:13,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:08:13,242 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:13,243 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:13,243 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:13,243 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-10-27 06:08:13,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:08:13,243 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:08:13,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:08:13,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:08:13 BoogieIcfgContainer [2018-10-27 06:08:13,251 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:08:13,251 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:08:13,251 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:08:13,252 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:08:13,252 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:50" (3/4) ... [2018-10-27 06:08:13,255 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:08:13,255 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:08:13,258 INFO L168 Benchmark]: Toolchain (without parser) took 23820.38 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 429.4 MB). Free memory was 957.0 MB in the beginning and 1.4 GB in the end (delta: -432.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:08:13,259 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:08:13,259 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.43 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 932.8 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:13,259 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 932.8 MB in the beginning and 1.2 GB in the end (delta: -224.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:13,264 INFO L168 Benchmark]: Boogie Preprocessor took 24.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:13,264 INFO L168 Benchmark]: RCFGBuilder took 483.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:13,265 INFO L168 Benchmark]: BuchiAutomizer took 22825.04 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 269.0 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -262.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:13,265 INFO L168 Benchmark]: Witness Printer took 3.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:08:13,277 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 378.43 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 932.8 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 101.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 932.8 MB in the beginning and 1.2 GB in the end (delta: -224.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 483.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22825.04 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 269.0 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -262.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 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 - 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 9 terminating modules (5 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[j][j] + 1 and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[k_ref][k_ref] + -1 * unknown-#memory_int-unknown[i][i] and consists of 7 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[j][j] + 1 and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[k_ref][k_ref] + -1 * unknown-#memory_int-unknown[i][i] and consists of 7 locations. 5 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 22.7s and 10 iterations. TraceHistogramMax:3. Analysis of lassos took 17.9s. Construction of modules took 1.4s. Büchi inclusion checks took 3.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 123 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 122 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 256 SDtfs, 574 SDslu, 970 SDs, 0 SdLazy, 1783 SolverSat, 116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital757 mio100 ax103 hnf100 lsp95 ukn50 mio100 lsp34 div100 bol100 ite100 ukn100 eq201 hnf87 smp95 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 2 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...