./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_97363a24-ecb4-447f-a872-46ad1a4a5cb9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_97363a24-ecb4-447f-a872-46ad1a4a5cb9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_97363a24-ecb4-447f-a872-46ad1a4a5cb9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_97363a24-ecb4-447f-a872-46ad1a4a5cb9/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_97363a24-ecb4-447f-a872-46ad1a4a5cb9/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_97363a24-ecb4-447f-a872-46ad1a4a5cb9/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-aa41828 [2018-11-23 11:36:56,894 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:36:56,894 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:36:56,901 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:36:56,901 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:36:56,902 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:36:56,902 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:36:56,904 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:36:56,905 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:36:56,905 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:36:56,906 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:36:56,906 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:36:56,907 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:36:56,907 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:36:56,908 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:36:56,908 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:36:56,909 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:36:56,910 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:36:56,911 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:36:56,911 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:36:56,912 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:36:56,913 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:36:56,914 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:36:56,914 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:36:56,914 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:36:56,914 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:36:56,915 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:36:56,916 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:36:56,916 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:36:56,917 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:36:56,917 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:36:56,918 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:36:56,918 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:36:56,918 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:36:56,919 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:36:56,919 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:36:56,919 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_97363a24-ecb4-447f-a872-46ad1a4a5cb9/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 11:36:56,927 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:36:56,927 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:36:56,928 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:36:56,928 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:36:56,928 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:36:56,928 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 11:36:56,928 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 11:36:56,928 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 11:36:56,929 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 11:36:56,929 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 11:36:56,929 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 11:36:56,929 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:36:56,929 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 11:36:56,929 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:36:56,929 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:36:56,930 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 11:36:56,930 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 11:36:56,930 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 11:36:56,930 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:36:56,930 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 11:36:56,930 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:36:56,930 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 11:36:56,931 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:36:56,931 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:36:56,931 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 11:36:56,931 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:36:56,931 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:36:56,931 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 11:36:56,932 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 11:36:56,932 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_97363a24-ecb4-447f-a872-46ad1a4a5cb9/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-11-23 11:36:56,955 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:36:56,963 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:36:56,966 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:36:56,967 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:36:56,967 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:36:56,968 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_97363a24-ecb4-447f-a872-46ad1a4a5cb9/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/twisted-alloca_true-termination.c.i [2018-11-23 11:36:57,012 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_97363a24-ecb4-447f-a872-46ad1a4a5cb9/bin-2019/uautomizer/data/02256ea0b/cbe752dc03b645a9b8151cabcefd2b08/FLAGfc01704b6 [2018-11-23 11:36:57,382 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:36:57,382 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_97363a24-ecb4-447f-a872-46ad1a4a5cb9/sv-benchmarks/c/termination-memory-alloca/twisted-alloca_true-termination.c.i [2018-11-23 11:36:57,393 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_97363a24-ecb4-447f-a872-46ad1a4a5cb9/bin-2019/uautomizer/data/02256ea0b/cbe752dc03b645a9b8151cabcefd2b08/FLAGfc01704b6 [2018-11-23 11:36:57,769 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_97363a24-ecb4-447f-a872-46ad1a4a5cb9/bin-2019/uautomizer/data/02256ea0b/cbe752dc03b645a9b8151cabcefd2b08 [2018-11-23 11:36:57,772 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:36:57,773 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:36:57,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:36:57,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:36:57,776 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:36:57,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:36:57" (1/1) ... [2018-11-23 11:36:57,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74858241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:57, skipping insertion in model container [2018-11-23 11:36:57,778 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:36:57" (1/1) ... [2018-11-23 11:36:57,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:36:57,814 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:36:57,990 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:36:57,998 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:36:58,065 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:36:58,088 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:36:58,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:58 WrapperNode [2018-11-23 11:36:58,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:36:58,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:36:58,089 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:36:58,089 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:36:58,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:58" (1/1) ... [2018-11-23 11:36:58,105 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:58" (1/1) ... [2018-11-23 11:36:58,118 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:36:58,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:36:58,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:36:58,119 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:36:58,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:58" (1/1) ... [2018-11-23 11:36:58,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:58" (1/1) ... [2018-11-23 11:36:58,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:58" (1/1) ... [2018-11-23 11:36:58,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:58" (1/1) ... [2018-11-23 11:36:58,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:58" (1/1) ... [2018-11-23 11:36:58,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:58" (1/1) ... [2018-11-23 11:36:58,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:58" (1/1) ... [2018-11-23 11:36:58,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:36:58,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:36:58,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:36:58,133 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:36:58,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97363a24-ecb4-447f-a872-46ad1a4a5cb9/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 11:36:58,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:36:58,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:36:58,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:36:58,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:36:58,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:36:58,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:36:58,332 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:36:58,332 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 11:36:58,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:36:58 BoogieIcfgContainer [2018-11-23 11:36:58,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:36:58,333 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 11:36:58,333 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 11:36:58,335 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 11:36:58,336 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 11:36:58,336 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 11:36:57" (1/3) ... [2018-11-23 11:36:58,337 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79b57b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 11:36:58, skipping insertion in model container [2018-11-23 11:36:58,337 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 11:36:58,337 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:58" (2/3) ... [2018-11-23 11:36:58,337 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79b57b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 11:36:58, skipping insertion in model container [2018-11-23 11:36:58,337 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 11:36:58,337 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:36:58" (3/3) ... [2018-11-23 11:36:58,338 INFO L375 chiAutomizerObserver]: Analyzing ICFG twisted-alloca_true-termination.c.i [2018-11-23 11:36:58,374 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:36:58,374 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 11:36:58,374 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 11:36:58,374 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 11:36:58,374 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:36:58,374 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:36:58,374 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 11:36:58,375 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:36:58,375 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 11:36:58,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-23 11:36:58,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 11:36:58,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:36:58,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:36:58,402 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 11:36:58,402 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 11:36:58,402 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 11:36:58,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-23 11:36:58,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 11:36:58,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:36:58,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:36:58,403 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 11:36:58,404 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 11:36:58,410 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;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;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 3#L569true [2018-11-23 11:36:58,410 INFO L796 eck$LassoCheckResult]: Loop: 3#L569true assume !true; 8#L564true goto; 4#L567true call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 11#L564-1true assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~post13;havoc f_#t~mem12;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 6#L566true assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 3#L569true [2018-11-23 11:36:58,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:58,415 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 11:36:58,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:36:58,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:36:58,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:36:58,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:58,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:36:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:36:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:36:58,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:58,523 INFO L82 PathProgramCache]: Analyzing trace with hash 46885240, now seen corresponding path program 1 times [2018-11-23 11:36:58,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:36:58,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:36:58,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:36:58,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:58,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:36:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:58,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:58,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:58,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-23 11:36:58,543 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 11:36:58,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:36:58,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:36:58,555 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-11-23 11:36:58,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:58,559 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-11-23 11:36:58,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:36:58,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2018-11-23 11:36:58,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 11:36:58,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2018-11-23 11:36:58,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 11:36:58,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 11:36:58,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-11-23 11:36:58,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 11:36:58,567 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 11:36:58,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-11-23 11:36:58,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-23 11:36:58,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:36:58,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-23 11:36:58,586 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 11:36:58,586 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 11:36:58,586 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 11:36:58,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-23 11:36:58,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 11:36:58,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:36:58,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:36:58,587 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 11:36:58,587 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:58,587 INFO L794 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;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;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 39#L569 [2018-11-23 11:36:58,587 INFO L796 eck$LassoCheckResult]: Loop: 39#L569 goto; 42#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 46#L557-1 assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7; 40#L564 goto; 41#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 44#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~post13;havoc f_#t~mem12;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 45#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 39#L569 [2018-11-23 11:36:58,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:58,587 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-23 11:36:58,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:36:58,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:36:58,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:36:58,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:58,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:36:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:36:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:36:58,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:58,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1311753714, now seen corresponding path program 1 times [2018-11-23 11:36:58,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:36:58,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:36:58,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:36:58,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:36:58,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:36:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:36:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:36:58,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:58,649 INFO L82 PathProgramCache]: Analyzing trace with hash 234543116, now seen corresponding path program 1 times [2018-11-23 11:36:58,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:36:58,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:36:58,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:36:58,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:58,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:36:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:36:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:36:59,137 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2018-11-23 11:36:59,278 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-11-23 11:36:59,289 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 11:36:59,289 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 11:36:59,290 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 11:36:59,290 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 11:36:59,290 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 11:36:59,290 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 11:36:59,290 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 11:36:59,290 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 11:36:59,290 INFO L131 ssoRankerPreferences]: Filename of dumped script: twisted-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-23 11:36:59,290 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 11:36:59,291 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 11:36:59,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:36:59,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:36:59,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:36:59,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:36:59,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:36:59,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:36:59,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:36:59,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:36:59,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:36:59,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:36:59,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:36:59,677 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 90 [2018-11-23 11:36:59,788 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2018-11-23 11:36:59,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:36:59,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:36:59,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:36:59,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:36:59,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:36:59,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:36:59,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:36:59,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:36:59,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:36:59,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:00,148 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 11:37:00,152 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 11:37:00,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-11-23 11:37:00,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:00,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:37:00,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:00,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:00,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:00,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:37:00,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:37:00,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:00,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-11-23 11:37:00,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:00,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:37:00,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:00,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:00,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:00,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:37:00,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:37:00,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:00,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:00,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:00,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:37:00,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:00,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:00,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:00,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:37:00,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:37:00,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:00,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:00,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:00,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:00,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:00,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:00,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:00,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:00,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:00,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:00,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:00,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:00,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:00,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:00,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:00,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:00,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:00,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:00,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:00,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:00,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:00,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:00,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:00,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:00,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:00,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-11-23 11:37:00,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:00,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:37:00,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:00,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:00,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:00,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:37:00,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:37:00,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:00,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:00,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:00,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:00,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:00,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:00,189 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:00,189 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:00,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:00,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:00,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:00,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:37:00,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:00,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:00,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:00,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:37:00,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:37:00,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:00,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-11-23 11:37:00,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:00,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:37:00,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:00,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:00,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:00,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:37:00,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:37:00,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:00,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:00,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:00,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:00,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:00,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:00,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:00,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:00,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:00,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:00,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:00,211 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 11:37:00,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:00,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:00,213 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 11:37:00,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:00,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:00,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:00,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:00,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:00,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:00,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:00,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:00,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:00,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:00,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:00,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:00,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:00,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:00,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:00,226 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:00,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:00,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:00,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:00,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:00,231 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 11:37:00,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:00,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:00,233 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 11:37:00,233 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:00,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:00,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-11-23 11:37:00,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:00,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:00,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:00,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:00,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:00,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:00,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:00,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-11-23 11:37:00,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:00,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:00,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:00,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:00,267 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:00,267 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:00,275 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 11:37:00,279 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 11:37:00,279 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 11:37:00,281 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 11:37:00,282 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 11:37:00,282 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 11:37:00,282 INFO L520 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-11-23 11:37:00,377 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-11-23 11:37:00,381 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:37:00,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:00,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:00,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:00,455 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:37:00,459 INFO L478 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 36 treesize of output 37 [2018-11-23 11:37:00,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:37:00,463 INFO L478 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 37 treesize of output 26 [2018-11-23 11:37:00,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:37:00,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:37:00,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:37:00,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2018-11-23 11:37:00,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:00,479 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 11:37:00,480 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 5 states. [2018-11-23 11:37:00,508 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 5 states. Result 20 states and 27 transitions. Complement of second has 6 states. [2018-11-23 11:37:00,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 11:37:00,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:37:00,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-23 11:37:00,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 7 letters. [2018-11-23 11:37:00,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:37:00,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-23 11:37:00,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:37:00,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 14 letters. [2018-11-23 11:37:00,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:37:00,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2018-11-23 11:37:00,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 11:37:00,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 21 transitions. [2018-11-23 11:37:00,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 11:37:00,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-23 11:37:00,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2018-11-23 11:37:00,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 11:37:00,515 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-11-23 11:37:00,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2018-11-23 11:37:00,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-23 11:37:00,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:37:00,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-11-23 11:37:00,516 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-23 11:37:00,516 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-23 11:37:00,516 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 11:37:00,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-11-23 11:37:00,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 11:37:00,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:37:00,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:37:00,519 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 11:37:00,519 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 11:37:00,519 INFO L794 eck$LassoCheckResult]: Stem: 277#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 267#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;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;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 268#L569 goto; 272#L560 [2018-11-23 11:37:00,520 INFO L796 eck$LassoCheckResult]: Loop: 272#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 278#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 279#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 272#L560 [2018-11-23 11:37:00,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:00,520 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2018-11-23 11:37:00,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:37:00,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:37:00,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:37:00,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:00,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:37:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:37:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:37:00,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:00,538 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2018-11-23 11:37:00,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:37:00,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:37:00,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:37:00,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:00,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:37:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:37:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:37:00,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:00,547 INFO L82 PathProgramCache]: Analyzing trace with hash 889536583, now seen corresponding path program 1 times [2018-11-23 11:37:00,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:37:00,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:37:00,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:37:00,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:00,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:37:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:37:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:37:00,982 WARN L180 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 103 [2018-11-23 11:37:01,113 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2018-11-23 11:37:01,115 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 11:37:01,115 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 11:37:01,115 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 11:37:01,115 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 11:37:01,115 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 11:37:01,115 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 11:37:01,115 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 11:37:01,115 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 11:37:01,115 INFO L131 ssoRankerPreferences]: Filename of dumped script: twisted-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-23 11:37:01,115 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 11:37:01,116 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 11:37:01,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:01,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:01,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:01,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:01,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:01,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:01,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:01,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:01,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:01,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:01,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:01,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:01,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:01,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:01,379 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2018-11-23 11:37:01,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:01,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:01,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:01,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:01,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:01,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:01,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:01,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:01,753 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 11:37:01,753 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 11:37:01,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:37:01,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:01,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:37:01,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:37:01,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:01,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:37:01,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:01,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:37:01,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:37:01,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:01,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:37:01,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:01,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:37:01,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:37:01,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:01,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:01,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:01,764 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:01,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:01,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:01,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:01,767 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:01,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:01,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:37:01,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:01,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:37:01,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:37:01,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:01,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:37:01,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:01,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:37:01,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:37:01,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:01,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:01,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:01,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:01,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:01,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:37:01,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:01,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:37:01,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:37:01,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:01,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:37:01,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:01,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:37:01,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:37:01,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:01,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:37:01,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:01,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:37:01,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:37:01,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:01,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:01,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:01,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:01,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:01,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:37:01,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:01,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:37:01,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:37:01,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:01,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,786 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 11:37:01,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,786 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 11:37:01,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:01,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:01,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:01,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,792 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:01,792 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:01,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:01,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:01,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,796 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:01,796 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:01,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:01,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,798 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 11:37:01,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,799 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 11:37:01,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:01,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:01,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:01,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,803 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:01,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:01,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:01,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:01,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:01,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:01,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:01,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,808 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 11:37:01,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,813 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 11:37:01,814 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:01,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:01,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,818 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 11:37:01,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,819 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 11:37:01,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:01,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:01,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:01,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,827 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:01,827 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:01,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:01,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:01,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:01,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:01,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:01,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:01,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:01,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:01,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:01,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:01,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:01,841 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:01,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:01,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:01,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:01,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:01,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:01,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:01,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:01,859 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:01,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:01,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:01,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:01,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:01,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:01,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:01,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:01,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:01,874 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 11:37:01,879 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 11:37:01,880 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 11:37:01,880 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 11:37:01,881 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 11:37:01,881 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 11:37:01,881 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_2, 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 + 1*v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_2 Supporting invariants [] [2018-11-23 11:37:01,997 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2018-11-23 11:37:01,998 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:37:01,999 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:37:02,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:02,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:02,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:02,047 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:37:02,057 INFO L478 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 44 treesize of output 58 [2018-11-23 11:37:02,064 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:37:02,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-11-23 11:37:02,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:37:02,081 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:37:02,082 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:37:02,107 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:37:02,109 INFO L478 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 34 treesize of output 49 [2018-11-23 11:37:02,109 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:37:02,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:37:02,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:37:02,132 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-11-23 11:37:02,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:02,148 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 11:37:02,148 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-23 11:37:02,162 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 34 states and 43 transitions. Complement of second has 7 states. [2018-11-23 11:37:02,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 11:37:02,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:37:02,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-23 11:37:02,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 3 letters. [2018-11-23 11:37:02,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:37:02,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-23 11:37:02,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:37:02,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-23 11:37:02,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:37:02,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2018-11-23 11:37:02,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 11:37:02,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 31 transitions. [2018-11-23 11:37:02,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 11:37:02,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-23 11:37:02,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2018-11-23 11:37:02,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 11:37:02,165 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2018-11-23 11:37:02,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2018-11-23 11:37:02,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-11-23 11:37:02,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:37:02,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2018-11-23 11:37:02,166 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-23 11:37:02,166 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-23 11:37:02,166 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 11:37:02,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2018-11-23 11:37:02,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 11:37:02,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:37:02,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:37:02,168 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:02,168 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 11:37:02,168 INFO L794 eck$LassoCheckResult]: Stem: 512#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 505#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;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;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 506#L569 goto; 507#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 515#L557-1 assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7; 503#L564 goto; 504#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 510#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~post13;havoc f_#t~mem12;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 511#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 516#L569 goto; 517#L560 [2018-11-23 11:37:02,168 INFO L796 eck$LassoCheckResult]: Loop: 517#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 513#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 514#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 517#L560 [2018-11-23 11:37:02,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:02,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1319097990, now seen corresponding path program 2 times [2018-11-23 11:37:02,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:37:02,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:37:02,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:37:02,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:02,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:37:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:37:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:37:02,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:02,186 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 2 times [2018-11-23 11:37:02,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:37:02,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:37:02,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:37:02,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:37:02,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:37:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:37:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:37:02,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:02,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1702545424, now seen corresponding path program 1 times [2018-11-23 11:37:02,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:37:02,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:37:02,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:37:02,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:37:02,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:37:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:02,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:02,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:37:02,313 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97363a24-ecb4-447f-a872-46ad1a4a5cb9/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:37:02,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:02,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:02,350 INFO L478 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-11-23 11:37:02,354 INFO L478 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-11-23 11:37:02,363 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:37:02,364 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:37:02,366 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:37:02,367 INFO L478 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-11-23 11:37:02,367 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:37:02,376 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:37:02,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:37:02,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:37:02,386 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:14, output treesize:9 [2018-11-23 11:37:02,412 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:37:02,416 INFO L478 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 1 case distinctions, treesize of input 29 treesize of output 42 [2018-11-23 11:37:02,419 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:37:02,420 INFO L478 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 23 treesize of output 16 [2018-11-23 11:37:02,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:37:02,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:37:02,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:37:02,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2018-11-23 11:37:02,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-11-23 11:37:02,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2018-11-23 11:37:02,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 11:37:02,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:37:02,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:37:02,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-23 11:37:02,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:02,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:37:02,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2018-11-23 11:37:02,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:37:02,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:37:02,567 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. cyclomatic complexity: 10 Second operand 9 states. [2018-11-23 11:37:02,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:02,650 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2018-11-23 11:37:02,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:37:02,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2018-11-23 11:37:02,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 11:37:02,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 19 states and 23 transitions. [2018-11-23 11:37:02,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 11:37:02,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-23 11:37:02,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2018-11-23 11:37:02,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 11:37:02,652 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-23 11:37:02,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2018-11-23 11:37:02,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-11-23 11:37:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:37:02,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-11-23 11:37:02,653 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-23 11:37:02,653 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-23 11:37:02,653 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 11:37:02,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2018-11-23 11:37:02,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 11:37:02,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:37:02,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:37:02,654 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:02,654 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 11:37:02,654 INFO L794 eck$LassoCheckResult]: Stem: 617#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 611#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;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;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 612#L569 goto; 613#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 620#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 621#L559 assume !(0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2));havoc f_#t~mem10; 609#L564 goto; 610#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 615#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~post13;havoc f_#t~mem12;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 616#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 622#L569 goto; 623#L560 [2018-11-23 11:37:02,654 INFO L796 eck$LassoCheckResult]: Loop: 623#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 618#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 619#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 623#L560 [2018-11-23 11:37:02,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:02,655 INFO L82 PathProgramCache]: Analyzing trace with hash -635175977, now seen corresponding path program 1 times [2018-11-23 11:37:02,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:37:02,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:37:02,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:37:02,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:02,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:37:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:02,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:02,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:02,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:37:02,741 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 11:37:02,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:02,741 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 3 times [2018-11-23 11:37:02,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:37:02,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:37:02,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:37:02,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:02,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:37:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:37:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:37:02,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:37:02,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:37:02,830 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-23 11:37:02,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:02,853 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-11-23 11:37:02,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:37:02,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2018-11-23 11:37:02,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 11:37:02,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2018-11-23 11:37:02,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 11:37:02,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-23 11:37:02,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-11-23 11:37:02,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 11:37:02,858 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-23 11:37:02,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-11-23 11:37:02,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 11:37:02,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:37:02,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-11-23 11:37:02,859 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-23 11:37:02,859 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-23 11:37:02,859 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 11:37:02,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2018-11-23 11:37:02,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 11:37:02,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:37:02,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:37:02,860 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:02,860 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 11:37:02,860 INFO L794 eck$LassoCheckResult]: Stem: 659#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 652#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;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;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 653#L569 goto; 654#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 662#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 663#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 656#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 667#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 666#L559 assume !(0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2));havoc f_#t~mem10; 650#L564 goto; 651#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 657#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~post13;havoc f_#t~mem12;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 658#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 664#L569 goto; 665#L560 [2018-11-23 11:37:02,860 INFO L796 eck$LassoCheckResult]: Loop: 665#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 660#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 661#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 665#L560 [2018-11-23 11:37:02,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:02,861 INFO L82 PathProgramCache]: Analyzing trace with hash 184869755, now seen corresponding path program 1 times [2018-11-23 11:37:02,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:37:02,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:37:02,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:37:02,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:37:02,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:37:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:37:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:37:02,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:02,887 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 4 times [2018-11-23 11:37:02,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:37:02,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:37:02,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:37:02,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:02,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:37:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:37:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:37:02,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:02,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1306804847, now seen corresponding path program 2 times [2018-11-23 11:37:02,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:37:02,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:37:02,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:37:02,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:37:02,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:37:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:37:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:37:04,317 WARN L180 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 193 DAG size of output: 149 [2018-11-23 11:37:04,712 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-11-23 11:37:04,715 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 11:37:04,715 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 11:37:04,715 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 11:37:04,715 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 11:37:04,715 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 11:37:04,715 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 11:37:04,715 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 11:37:04,715 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 11:37:04,715 INFO L131 ssoRankerPreferences]: Filename of dumped script: twisted-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-23 11:37:04,715 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 11:37:04,716 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 11:37:04,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:04,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:04,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:04,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:04,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:04,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:04,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:04,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:04,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:05,062 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 92 [2018-11-23 11:37:05,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:05,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:05,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:05,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:05,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:05,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:05,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:05,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:05,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:05,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:05,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:37:05,434 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 11:37:05,434 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 11:37:05,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:05,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:05,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:37:05,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:05,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:05,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:05,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:37:05,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:37:05,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:05,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:05,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:05,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:05,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:05,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:05,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:05,441 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:05,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:05,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:05,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:05,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:37:05,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:05,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:05,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:05,442 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:37:05,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:37:05,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:05,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:05,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:05,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:37:05,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:05,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:05,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:05,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:37:05,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:37:05,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:05,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:05,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:05,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:37:05,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:05,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:05,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:05,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:37:05,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:37:05,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:05,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:05,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:05,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:37:05,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:05,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:05,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:05,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:37:05,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:37:05,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:05,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:05,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:05,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:05,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:05,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:05,447 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:05,447 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:05,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:05,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:05,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:05,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:37:05,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:05,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:05,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:05,450 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:37:05,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:37:05,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:05,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:05,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:05,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:05,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:05,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:05,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:05,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:05,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:05,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:05,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:05,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:05,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:05,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:05,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:05,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:05,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:05,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:05,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:05,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:05,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:05,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:05,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:05,460 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:05,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:05,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:05,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:05,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:05,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:05,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:05,463 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:05,463 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:05,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:05,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:05,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:05,465 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 11:37:05,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:05,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:05,466 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 11:37:05,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:05,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:05,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:05,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:05,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:05,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:05,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:05,470 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:05,470 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:05,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:05,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:05,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:05,471 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 11:37:05,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:05,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:05,472 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 11:37:05,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:05,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:05,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:05,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:05,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:05,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:05,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:05,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:05,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:05,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:05,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:05,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:05,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:05,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:05,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:05,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:05,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:05,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:05,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:05,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:05,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:05,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:05,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:05,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:05,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:05,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:05,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:05,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:05,485 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 11:37:05,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:05,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:05,486 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 11:37:05,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:05,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:37:05,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:37:05,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:37:05,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:37:05,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:37:05,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:37:05,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:37:05,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:37:05,500 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 11:37:05,507 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 11:37:05,508 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 11:37:05,508 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 11:37:05,508 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 11:37:05,509 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 11:37:05,509 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_3) = -1*v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_3 + 1*v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_3 Supporting invariants [] [2018-11-23 11:37:05,644 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2018-11-23 11:37:05,645 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:37:05,645 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:37:05,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:05,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:05,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:05,684 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:37:05,691 INFO L478 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 44 treesize of output 58 [2018-11-23 11:37:05,695 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:37:05,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-11-23 11:37:05,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:37:05,710 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:37:05,711 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:37:05,712 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:37:05,713 INFO L478 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 34 treesize of output 49 [2018-11-23 11:37:05,713 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:37:05,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:37:05,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:37:05,732 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-11-23 11:37:05,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:05,746 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 11:37:05,746 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-23 11:37:05,758 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 30 states and 35 transitions. Complement of second has 7 states. [2018-11-23 11:37:05,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 11:37:05,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:37:05,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-23 11:37:05,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 11:37:05,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:37:05,760 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 11:37:05,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:05,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:05,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:05,801 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:37:05,811 INFO L478 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 44 treesize of output 58 [2018-11-23 11:37:05,814 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:37:05,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-11-23 11:37:05,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:37:05,833 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:37:05,833 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:37:05,835 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:37:05,835 INFO L478 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 34 treesize of output 49 [2018-11-23 11:37:05,836 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:37:05,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:37:05,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:37:05,860 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-11-23 11:37:05,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:05,877 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 11:37:05,877 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-23 11:37:05,901 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 51 states and 59 transitions. Complement of second has 9 states. [2018-11-23 11:37:05,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 11:37:05,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:37:05,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-11-23 11:37:05,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 11:37:05,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:37:05,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-23 11:37:05,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:37:05,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-23 11:37:05,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:37:05,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 59 transitions. [2018-11-23 11:37:05,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 11:37:05,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 37 states and 43 transitions. [2018-11-23 11:37:05,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 11:37:05,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-23 11:37:05,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2018-11-23 11:37:05,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 11:37:05,905 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-11-23 11:37:05,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2018-11-23 11:37:05,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-23 11:37:05,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:37:05,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-23 11:37:05,907 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-23 11:37:05,907 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-23 11:37:05,907 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 11:37:05,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 41 transitions. [2018-11-23 11:37:05,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 11:37:05,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:37:05,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:37:05,908 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:05,908 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 11:37:05,908 INFO L794 eck$LassoCheckResult]: Stem: 1058#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1051#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;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;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 1052#L569 goto; 1053#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1075#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1068#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 1069#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1083#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1082#L559 assume !(0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2));havoc f_#t~mem10; 1081#L564 goto; 1079#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 1056#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~post13;havoc f_#t~mem12;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1057#L566 assume 0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2);havoc f_#t~mem14; 1072#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 1074#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~post13;havoc f_#t~mem12;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1071#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 1070#L569 goto; 1066#L560 [2018-11-23 11:37:05,908 INFO L796 eck$LassoCheckResult]: Loop: 1066#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1060#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1061#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 1066#L560 [2018-11-23 11:37:05,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:05,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1305515858, now seen corresponding path program 1 times [2018-11-23 11:37:05,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:37:05,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:37:05,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:37:05,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:37:05,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:37:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:05,977 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:37:05,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:37:05,977 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97363a24-ecb4-447f-a872-46ad1a4a5cb9/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-11-23 11:37:05,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:06,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:06,013 INFO L478 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-11-23 11:37:06,029 INFO L478 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-11-23 11:37:06,037 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:37:06,038 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:37:06,039 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:37:06,040 INFO L478 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-11-23 11:37:06,040 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:37:06,044 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:37:06,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:37:06,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:37:06,052 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:14, output treesize:4 [2018-11-23 11:37:06,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 18 treesize of output 14 [2018-11-23 11:37:06,097 INFO L478 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 14 treesize of output 6 [2018-11-23 11:37:06,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:37:06,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:37:06,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:37:06,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:6 [2018-11-23 11:37:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 11:37:06,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:37:06,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-11-23 11:37:06,126 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 11:37:06,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:06,126 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 5 times [2018-11-23 11:37:06,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:37:06,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:37:06,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:37:06,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:06,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:37:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:37:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:37:06,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:37:06,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:37:06,210 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. cyclomatic complexity: 10 Second operand 11 states. [2018-11-23 11:37:06,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:06,309 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-23 11:37:06,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:37:06,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 38 transitions. [2018-11-23 11:37:06,310 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 11:37:06,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2018-11-23 11:37:06,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 11:37:06,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 11:37:06,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 11:37:06,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 11:37:06,311 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:37:06,311 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:37:06,311 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:37:06,311 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 11:37:06,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:37:06,311 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 11:37:06,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 11:37:06,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 11:37:06 BoogieIcfgContainer [2018-11-23 11:37:06,316 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 11:37:06,316 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:37:06,316 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:37:06,317 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:37:06,317 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:36:58" (3/4) ... [2018-11-23 11:37:06,319 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 11:37:06,319 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:37:06,320 INFO L168 Benchmark]: Toolchain (without parser) took 8548.11 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 241.2 MB). Free memory was 956.6 MB in the beginning and 1.2 GB in the end (delta: -268.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:37:06,321 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:37:06,321 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -161.9 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-11-23 11:37:06,321 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 11:37:06,322 INFO L168 Benchmark]: Boogie Preprocessor took 13.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:37:06,322 INFO L168 Benchmark]: RCFGBuilder took 200.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2018-11-23 11:37:06,322 INFO L168 Benchmark]: BuchiAutomizer took 7982.89 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 111.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -128.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:37:06,323 INFO L168 Benchmark]: Witness Printer took 3.21 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:37:06,325 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 315.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -161.9 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 200.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7982.89 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 111.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -128.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.21 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[j][j] + 1 and consists of 4 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] + unknown-#memory_int-unknown[k_ref][k_ref] and consists of 4 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] + unknown-#memory_int-unknown[k_ref][k_ref] and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.9s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 7.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 10 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 6. Nontrivial modules had stage [2, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 74 SDtfs, 60 SDslu, 134 SDs, 0 SdLazy, 170 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital879 mio100 ax103 hnf100 lsp94 ukn41 mio100 lsp36 div100 bol100 ite100 ukn100 eq183 hnf88 smp93 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 2 VariablesLoop: 0 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...