./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/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 32bit --witnessprinter.graph.data.programhash 13fe1afeee88065faace0f9ad16456f5e678cf43 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:04:42,596 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:04:42,597 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:04:42,606 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:04:42,606 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:04:42,607 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:04:42,608 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:04:42,609 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:04:42,610 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:04:42,611 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:04:42,611 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:04:42,612 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:04:42,612 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:04:42,613 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:04:42,614 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:04:42,614 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:04:42,615 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:04:42,616 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:04:42,617 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:04:42,618 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:04:42,619 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:04:42,620 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:04:42,622 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:04:42,622 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:04:42,622 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:04:42,623 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:04:42,623 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:04:42,624 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:04:42,624 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:04:42,625 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:04:42,625 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:04:42,625 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:04:42,625 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:04:42,625 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:04:42,626 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:04:42,626 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:04:42,626 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 11:04:42,637 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:04:42,637 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:04:42,638 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:04:42,639 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:04:42,639 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:04:42,639 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 11:04:42,639 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 11:04:42,639 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 11:04:42,639 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 11:04:42,639 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 11:04:42,640 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 11:04:42,640 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:04:42,640 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:04:42,640 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:04:42,640 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:04:42,640 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:04:42,641 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:04:42,641 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 11:04:42,641 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 11:04:42,641 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 11:04:42,641 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:04:42,641 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:04:42,641 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 11:04:42,642 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:04:42,642 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 11:04:42,642 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:04:42,642 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:04:42,642 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 11:04:42,642 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:04:42,642 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:04:42,643 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 11:04:42,643 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 11:04:42,643 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_fd739781-7a55-4881-9516-3e310124fba4/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 13fe1afeee88065faace0f9ad16456f5e678cf43 [2018-11-28 11:04:42,668 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:04:42,679 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:04:42,682 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:04:42,683 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:04:42,684 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:04:42,684 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-11-28 11:04:42,740 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/data/e360a92ec/0edc335bd27442e2b975060ba4d1a74f/FLAGf5ebec2b9 [2018-11-28 11:04:43,135 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:04:43,136 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-11-28 11:04:43,144 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/data/e360a92ec/0edc335bd27442e2b975060ba4d1a74f/FLAGf5ebec2b9 [2018-11-28 11:04:43,511 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/data/e360a92ec/0edc335bd27442e2b975060ba4d1a74f [2018-11-28 11:04:43,514 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:04:43,515 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:04:43,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:04:43,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:04:43,519 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:04:43,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:04:43" (1/1) ... [2018-11-28 11:04:43,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75eb1ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:04:43, skipping insertion in model container [2018-11-28 11:04:43,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:04:43" (1/1) ... [2018-11-28 11:04:43,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:04:43,556 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:04:43,768 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:04:43,779 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:04:43,870 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:04:43,908 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:04:43,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:04:43 WrapperNode [2018-11-28 11:04:43,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:04:43,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:04:43,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:04:43,910 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:04:43,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:04:43" (1/1) ... [2018-11-28 11:04:43,930 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:04:43" (1/1) ... [2018-11-28 11:04:43,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:04:43,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:04:43,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:04:43,948 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:04:43,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:04:43" (1/1) ... [2018-11-28 11:04:43,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:04:43" (1/1) ... [2018-11-28 11:04:43,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:04:43" (1/1) ... [2018-11-28 11:04:43,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:04:43" (1/1) ... [2018-11-28 11:04:43,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:04:43" (1/1) ... [2018-11-28 11:04:43,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:04:43" (1/1) ... [2018-11-28 11:04:43,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:04:43" (1/1) ... [2018-11-28 11:04:43,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:04:43,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:04:43,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:04:43,972 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:04:43,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:04:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/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-28 11:04:44,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:04:44,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:04:44,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:04:44,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:04:44,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:04:44,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:04:44,235 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:04:44,236 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-11-28 11:04:44,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:04:44 BoogieIcfgContainer [2018-11-28 11:04:44,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:04:44,237 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 11:04:44,237 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 11:04:44,240 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 11:04:44,241 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:04:44,241 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:04:43" (1/3) ... [2018-11-28 11:04:44,242 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a309284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:04:44, skipping insertion in model container [2018-11-28 11:04:44,242 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:04:44,242 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:04:43" (2/3) ... [2018-11-28 11:04:44,242 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a309284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:04:44, skipping insertion in model container [2018-11-28 11:04:44,242 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:04:44,242 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:04:44" (3/3) ... [2018-11-28 11:04:44,244 INFO L375 chiAutomizerObserver]: Analyzing ICFG lis-alloca_true-valid-memsafety_true-termination.i [2018-11-28 11:04:44,285 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:04:44,286 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 11:04:44,286 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 11:04:44,286 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 11:04:44,286 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:04:44,286 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:04:44,286 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 11:04:44,286 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:04:44,287 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 11:04:44,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-28 11:04:44,319 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-28 11:04:44,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:04:44,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:04:44,325 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 11:04:44,325 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 11:04:44,325 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 11:04:44,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-28 11:04:44,327 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-28 11:04:44,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:04:44,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:04:44,328 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 11:04:44,328 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 11:04:44,334 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 15#L-1true havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 4#L558true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 8#L558-2true call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 16#L545-3true [2018-11-28 11:04:44,334 INFO L796 eck$LassoCheckResult]: Loop: 16#L545-3true assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 13#L545-2true lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 16#L545-3true [2018-11-28 11:04:44,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:04:44,339 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-28 11:04:44,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:04:44,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:04:44,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:44,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:04:44,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:44,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:04:44,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2018-11-28 11:04:44,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:04:44,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:04:44,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:44,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:04:44,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:44,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:04:44,467 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2018-11-28 11:04:44,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:04:44,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:04:44,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:44,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:04:44,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:44,800 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:04:44,801 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:04:44,801 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:04:44,801 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:04:44,801 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:04:44,801 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:04:44,802 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:04:44,802 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:04:44,802 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-28 11:04:44,802 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:04:44,802 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:04:44,826 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-28 11:04:44,845 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-28 11:04:44,850 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-28 11:04:44,852 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-28 11:04:44,855 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-28 11:04:44,857 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-28 11:04:44,860 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-28 11:04:44,862 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-28 11:04:44,866 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-28 11:04:44,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:04:44,871 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-28 11:04:44,873 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-28 11:04:44,882 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-28 11:04:44,884 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-28 11:04:44,886 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-28 11:04:44,888 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-28 11:04:44,890 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-28 11:04:44,892 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-28 11:04:44,894 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-28 11:04:44,905 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-28 11:04:44,908 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-28 11:04:45,153 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-11-28 11:04:45,212 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-28 11:04:45,607 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:04:45,613 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:04:45,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:45,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:45,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:04:45,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:45,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:45,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:45,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:04:45,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:04:45,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:45,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:45,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:45,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:45,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:45,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:45,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:04:45,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:04:45,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:45,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:45,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:45,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:04:45,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:45,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:45,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:45,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:04:45,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:04:45,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:45,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:45,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:45,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:04:45,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:45,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:45,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:45,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:04:45,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:04:45,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:45,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:45,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:45,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:04:45,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:45,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:45,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:45,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:04:45,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:04:45,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:45,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:45,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:45,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:45,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:45,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:45,645 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:04:45,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:04:45,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:45,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:45,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:45,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:04:45,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:45,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:45,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:45,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:04:45,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:04:45,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:45,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:45,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:45,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:04:45,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:45,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:45,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:45,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:04:45,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:04:45,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:45,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:45,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:45,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:04:45,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:45,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:45,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:45,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:04:45,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:04:45,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:45,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:04:45,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:45,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:04:45,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:45,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:45,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:45,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:04:45,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:04:45,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:45,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:04:45,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:45,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:04:45,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:45,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:45,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:45,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:04:45,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:04:45,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:45,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:45,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:45,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:45,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:45,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:45,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:04:45,673 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:04:45,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:45,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:45,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:45,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:04:45,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:45,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:45,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:45,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:04:45,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:04:45,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:45,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:04:45,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:45,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:04:45,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:45,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:45,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:45,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:04:45,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:04:45,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:45,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:45,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:45,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:04:45,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:45,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:45,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:45,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:04:45,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:04:45,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:45,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:45,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:45,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:04:45,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:45,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:45,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:45,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:04:45,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:04:45,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:45,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:45,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:45,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:04:45,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:45,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:45,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:45,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:04:45,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:04:45,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:45,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:45,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:45,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:04:45,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:45,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:45,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:45,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:04:45,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:04:45,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:45,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:45,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:45,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:04:45,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:45,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:45,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:45,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:04:45,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:04:45,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:45,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:04:45,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:45,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:45,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:45,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:45,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:04:45,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:04:45,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:45,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:04:45,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:45,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:45,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:45,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:45,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:04:45,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:04:45,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:45,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:45,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:45,727 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:04:45,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:45,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:45,729 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:04:45,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:04:45,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:45,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:45,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:45,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:45,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:45,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:45,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:04:45,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:04:45,825 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:04:45,876 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 11:04:45,876 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 11:04:45,878 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:04:45,882 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:04:45,882 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:04:45,882 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~N) = -1*ULTIMATE.start_lis_~i~0 + 1*ULTIMATE.start_lis_~N Supporting invariants [] [2018-11-28 11:04:45,949 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-11-28 11:04:45,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:04:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:04:45,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:04:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:04:46,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:04:46,024 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-28 11:04:46,038 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 11:04:46,039 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 3 states. [2018-11-28 11:04:46,099 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 3 states. Result 41 states and 64 transitions. Complement of second has 8 states. [2018-11-28 11:04:46,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 11:04:46,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 11:04:46,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-11-28 11:04:46,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-28 11:04:46,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:04:46,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-28 11:04:46,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:04:46,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-28 11:04:46,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:04:46,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 64 transitions. [2018-11-28 11:04:46,111 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 11:04:46,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 18 states and 28 transitions. [2018-11-28 11:04:46,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 11:04:46,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-28 11:04:46,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 28 transitions. [2018-11-28 11:04:46,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:04:46,117 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2018-11-28 11:04:46,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 28 transitions. [2018-11-28 11:04:46,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-28 11:04:46,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 11:04:46,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2018-11-28 11:04:46,139 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2018-11-28 11:04:46,140 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2018-11-28 11:04:46,140 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 11:04:46,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2018-11-28 11:04:46,141 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 11:04:46,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:04:46,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:04:46,141 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:04:46,141 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 11:04:46,141 INFO L794 eck$LassoCheckResult]: Stem: 189#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 187#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 175#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 176#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 180#L545-3 assume !(lis_~i~0 < lis_~N); 188#L545-4 lis_~i~0 := 1; 183#L547-3 [2018-11-28 11:04:46,142 INFO L796 eck$LassoCheckResult]: Loop: 183#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 179#L548-3 assume !(lis_~j~0 < lis_~i~0); 181#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 183#L547-3 [2018-11-28 11:04:46,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:04:46,142 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2018-11-28 11:04:46,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:04:46,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:04:46,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:46,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:04:46,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:04:46,203 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-28 11:04:46,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:04:46,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:04:46,206 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:04:46,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:04:46,206 INFO L82 PathProgramCache]: Analyzing trace with hash 60785, now seen corresponding path program 1 times [2018-11-28 11:04:46,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:04:46,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:04:46,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:46,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:04:46,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:46,224 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:04:46,224 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:04:46,225 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:04:46,225 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:04:46,225 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:04:46,225 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:04:46,225 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:04:46,225 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:04:46,225 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration2_Loop [2018-11-28 11:04:46,225 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:04:46,225 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:04:46,226 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-28 11:04:46,233 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-28 11:04:46,251 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:04:46,252 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:04:46,255 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:04:46,256 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:04:46,281 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:04:46,281 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:04:46,417 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 11:04:46,419 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:04:46,419 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:04:46,419 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:04:46,419 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:04:46,419 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:04:46,419 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:04:46,419 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:04:46,420 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:04:46,420 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration2_Loop [2018-11-28 11:04:46,420 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:04:46,420 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:04:46,420 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-28 11:04:46,427 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-28 11:04:46,455 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:04:46,455 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:04:46,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:04:46,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:46,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:04:46,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:46,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:46,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:46,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:04:46,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:04:46,459 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:04:46,462 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 11:04:46,462 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:04:46,462 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:04:46,462 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 11:04:46,463 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:04:46,463 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0) = -2*ULTIMATE.start_lis_~i~0 + 1 Supporting invariants [] [2018-11-28 11:04:46,463 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 11:04:46,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:04:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:04:46,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:04:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:04:46,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:04:46,551 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-28 11:04:46,551 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-28 11:04:46,552 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-11-28 11:04:46,651 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 49 states and 84 transitions. Complement of second has 10 states. [2018-11-28 11:04:46,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 11:04:46,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:04:46,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2018-11-28 11:04:46,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-28 11:04:46,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:04:46,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-28 11:04:46,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:04:46,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-28 11:04:46,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:04:46,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 84 transitions. [2018-11-28 11:04:46,655 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-28 11:04:46,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 37 states and 57 transitions. [2018-11-28 11:04:46,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-28 11:04:46,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-28 11:04:46,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 57 transitions. [2018-11-28 11:04:46,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:04:46,657 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 57 transitions. [2018-11-28 11:04:46,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 57 transitions. [2018-11-28 11:04:46,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2018-11-28 11:04:46,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 11:04:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2018-11-28 11:04:46,659 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 45 transitions. [2018-11-28 11:04:46,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:04:46,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:04:46,663 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand 4 states. [2018-11-28 11:04:46,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:04:46,729 INFO L93 Difference]: Finished difference Result 30 states and 45 transitions. [2018-11-28 11:04:46,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:04:46,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 45 transitions. [2018-11-28 11:04:46,730 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 11:04:46,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 45 transitions. [2018-11-28 11:04:46,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-28 11:04:46,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-28 11:04:46,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 45 transitions. [2018-11-28 11:04:46,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:04:46,732 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 45 transitions. [2018-11-28 11:04:46,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 45 transitions. [2018-11-28 11:04:46,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-28 11:04:46,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 11:04:46,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 44 transitions. [2018-11-28 11:04:46,734 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 44 transitions. [2018-11-28 11:04:46,734 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 44 transitions. [2018-11-28 11:04:46,734 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 11:04:46,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 44 transitions. [2018-11-28 11:04:46,735 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 11:04:46,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:04:46,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:04:46,735 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:04:46,735 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:04:46,735 INFO L794 eck$LassoCheckResult]: Stem: 382#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 380#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 360#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 361#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 368#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 378#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 379#L545-3 assume !(lis_~i~0 < lis_~N); 381#L545-4 lis_~i~0 := 1; 384#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 369#L548-3 [2018-11-28 11:04:46,736 INFO L796 eck$LassoCheckResult]: Loop: 369#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 370#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 362#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 363#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 366#L548-3 assume !(lis_~j~0 < lis_~i~0); 373#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 374#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 369#L548-3 [2018-11-28 11:04:46,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:04:46,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2018-11-28 11:04:46,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:04:46,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:04:46,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:46,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:04:46,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:04:46,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:04:46,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:04:46,793 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:04:46,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:04:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:04:46,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:04:46,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:04:46,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:04:46,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-28 11:04:46,873 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:04:46,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:04:46,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 1 times [2018-11-28 11:04:46,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:04:46,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:04:46,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:46,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:04:46,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:47,044 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2018-11-28 11:04:47,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:04:47,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:04:47,110 INFO L87 Difference]: Start difference. First operand 29 states and 44 transitions. cyclomatic complexity: 19 Second operand 8 states. [2018-11-28 11:04:47,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:04:47,222 INFO L93 Difference]: Finished difference Result 59 states and 84 transitions. [2018-11-28 11:04:47,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:04:47,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 84 transitions. [2018-11-28 11:04:47,224 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-28 11:04:47,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 51 states and 74 transitions. [2018-11-28 11:04:47,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-28 11:04:47,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-28 11:04:47,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 74 transitions. [2018-11-28 11:04:47,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:04:47,225 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 74 transitions. [2018-11-28 11:04:47,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 74 transitions. [2018-11-28 11:04:47,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 31. [2018-11-28 11:04:47,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-28 11:04:47,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2018-11-28 11:04:47,227 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2018-11-28 11:04:47,227 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2018-11-28 11:04:47,228 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 11:04:47,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2018-11-28 11:04:47,228 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 11:04:47,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:04:47,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:04:47,229 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:04:47,229 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:04:47,229 INFO L794 eck$LassoCheckResult]: Stem: 511#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 509#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 487#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 488#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 495#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 506#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 507#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 510#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 514#L545-3 assume !(lis_~i~0 < lis_~N); 513#L545-4 lis_~i~0 := 1; 505#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 496#L548-3 [2018-11-28 11:04:47,229 INFO L796 eck$LassoCheckResult]: Loop: 496#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 497#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 489#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 490#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 493#L548-3 assume !(lis_~j~0 < lis_~i~0); 501#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 502#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 496#L548-3 [2018-11-28 11:04:47,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:04:47,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 2 times [2018-11-28 11:04:47,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:04:47,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:04:47,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:47,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:04:47,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:47,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:04:47,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 2 times [2018-11-28 11:04:47,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:04:47,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:04:47,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:47,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:04:47,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:47,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:04:47,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1776402153, now seen corresponding path program 1 times [2018-11-28 11:04:47,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:04:47,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:04:47,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:47,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:04:47,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:04:47,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:04:47,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:04:47,341 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:04:47,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:04:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:04:47,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:04:47,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:04:47,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:04:47,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-11-28 11:04:47,613 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 81 [2018-11-28 11:04:47,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 11:04:47,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:04:47,655 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. cyclomatic complexity: 18 Second operand 14 states. [2018-11-28 11:04:47,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:04:47,860 INFO L93 Difference]: Finished difference Result 106 states and 151 transitions. [2018-11-28 11:04:47,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 11:04:47,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 151 transitions. [2018-11-28 11:04:47,863 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 25 [2018-11-28 11:04:47,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 87 states and 126 transitions. [2018-11-28 11:04:47,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-11-28 11:04:47,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-11-28 11:04:47,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 126 transitions. [2018-11-28 11:04:47,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:04:47,865 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 126 transitions. [2018-11-28 11:04:47,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 126 transitions. [2018-11-28 11:04:47,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 39. [2018-11-28 11:04:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 11:04:47,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2018-11-28 11:04:47,871 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2018-11-28 11:04:47,871 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2018-11-28 11:04:47,871 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 11:04:47,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 56 transitions. [2018-11-28 11:04:47,872 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-28 11:04:47,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:04:47,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:04:47,873 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:04:47,873 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:04:47,875 INFO L794 eck$LassoCheckResult]: Stem: 736#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 732#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 710#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 711#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 719#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 733#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 734#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 735#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 744#L545-3 assume !(lis_~i~0 < lis_~N); 738#L545-4 lis_~i~0 := 1; 727#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 717#L548-3 [2018-11-28 11:04:47,876 INFO L796 eck$LassoCheckResult]: Loop: 717#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 746#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 745#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 716#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 717#L548-3 [2018-11-28 11:04:47,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:04:47,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 3 times [2018-11-28 11:04:47,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:04:47,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:04:47,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:47,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:04:47,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:47,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:04:47,899 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 1 times [2018-11-28 11:04:47,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:04:47,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:04:47,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:47,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:04:47,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:47,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:04:47,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1166707861, now seen corresponding path program 1 times [2018-11-28 11:04:47,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:04:47,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:04:47,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:47,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:04:47,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:48,091 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2018-11-28 11:04:48,435 WARN L180 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 115 [2018-11-28 11:04:48,524 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:04:48,525 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:04:48,525 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:04:48,525 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:04:48,525 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:04:48,525 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:04:48,525 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:04:48,525 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:04:48,525 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-28 11:04:48,525 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:04:48,525 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:04:48,530 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-28 11:04:48,534 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-28 11:04:48,536 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-28 11:04:48,538 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-28 11:04:48,539 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-28 11:04:48,540 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-28 11:04:48,542 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-28 11:04:48,543 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-28 11:04:48,544 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-28 11:04:48,930 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 99 [2018-11-28 11:04:49,101 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2018-11-28 11:04:49,102 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-28 11:04:49,104 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-28 11:04:49,109 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-28 11:04:49,112 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-28 11:04:49,114 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-28 11:04:49,116 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-28 11:04:49,120 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-28 11:04:49,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-28 11:04:49,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-28 11:04:49,128 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-28 11:04:49,130 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-28 11:04:49,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-28 11:04:49,329 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2018-11-28 11:04:49,634 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:04:49,634 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:04:49,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:49,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:49,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:49,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:49,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:49,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:04:49,636 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:04:49,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:49,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:49,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:49,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:04:49,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:49,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:49,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:49,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:04:49,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:04:49,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:49,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:49,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:49,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:04:49,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:49,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:49,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:49,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:04:49,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:04:49,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:49,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:49,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:49,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:04:49,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:49,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:49,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:49,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:04:49,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:04:49,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:49,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:04:49,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:49,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:04:49,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:49,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:49,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:49,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:04:49,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:04:49,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:49,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:49,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:49,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:49,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:49,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:49,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:04:49,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:04:49,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:49,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:49,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:49,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:04:49,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:49,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:49,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:49,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:04:49,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:04:49,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:49,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:49,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:49,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:04:49,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:49,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:49,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:49,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:04:49,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:04:49,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:49,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:49,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:49,661 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:04:49,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:49,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:49,662 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:04:49,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:04:49,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:49,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:49,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:49,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:49,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:49,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:49,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:04:49,667 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:04:49,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:49,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:04:49,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:49,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:49,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:49,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:49,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:04:49,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:04:49,710 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:04:49,745 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 11:04:49,745 INFO L444 ModelExtractionUtils]: 56 out of 64 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-28 11:04:49,746 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:04:49,747 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:04:49,747 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:04:49,747 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0) = -2*ULTIMATE.start_lis_~j~0 + 1 Supporting invariants [] [2018-11-28 11:04:49,909 INFO L297 tatePredicateManager]: 40 out of 43 supporting invariants were superfluous and have been removed [2018-11-28 11:04:49,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:04:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:04:49,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:04:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:04:49,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:04:50,000 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-28 11:04:50,001 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-28 11:04:50,001 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 56 transitions. cyclomatic complexity: 22 Second operand 5 states. [2018-11-28 11:04:50,058 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 56 transitions. cyclomatic complexity: 22. Second operand 5 states. Result 65 states and 98 transitions. Complement of second has 9 states. [2018-11-28 11:04:50,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 11:04:50,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 11:04:50,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2018-11-28 11:04:50,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-28 11:04:50,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:04:50,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-28 11:04:50,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:04:50,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 11 letters. Loop has 8 letters. [2018-11-28 11:04:50,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:04:50,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 98 transitions. [2018-11-28 11:04:50,062 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 11:04:50,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 46 states and 67 transitions. [2018-11-28 11:04:50,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-28 11:04:50,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 11:04:50,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 67 transitions. [2018-11-28 11:04:50,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:04:50,063 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 67 transitions. [2018-11-28 11:04:50,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 67 transitions. [2018-11-28 11:04:50,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2018-11-28 11:04:50,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 11:04:50,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2018-11-28 11:04:50,066 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 55 transitions. [2018-11-28 11:04:50,067 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 55 transitions. [2018-11-28 11:04:50,067 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 11:04:50,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 55 transitions. [2018-11-28 11:04:50,067 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 11:04:50,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:04:50,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:04:50,068 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:04:50,068 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:04:50,068 INFO L794 eck$LassoCheckResult]: Stem: 1089#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1087#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1066#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1067#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1075#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1085#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1086#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1088#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1097#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1095#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1094#L545-3 assume !(lis_~i~0 < lis_~N); 1091#L545-4 lis_~i~0 := 1; 1082#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1083#L548-3 assume !(lis_~j~0 < lis_~i~0); 1099#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1098#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1096#L548-3 [2018-11-28 11:04:50,068 INFO L796 eck$LassoCheckResult]: Loop: 1096#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1092#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1068#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1069#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1072#L548-3 assume !(lis_~j~0 < lis_~i~0); 1078#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1079#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1096#L548-3 [2018-11-28 11:04:50,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:04:50,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1270630400, now seen corresponding path program 1 times [2018-11-28 11:04:50,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:04:50,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:04:50,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:50,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:04:50,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:04:50,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 11:04:50,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:04:50,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:04:50,112 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:04:50,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:04:50,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 3 times [2018-11-28 11:04:50,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:04:50,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:04:50,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:50,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:04:50,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:50,333 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2018-11-28 11:04:50,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:04:50,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:04:50,384 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. cyclomatic complexity: 22 Second operand 4 states. [2018-11-28 11:04:50,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:04:50,439 INFO L93 Difference]: Finished difference Result 51 states and 75 transitions. [2018-11-28 11:04:50,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:04:50,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 75 transitions. [2018-11-28 11:04:50,441 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 11:04:50,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 75 transitions. [2018-11-28 11:04:50,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 11:04:50,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 11:04:50,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 75 transitions. [2018-11-28 11:04:50,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:04:50,442 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 75 transitions. [2018-11-28 11:04:50,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 75 transitions. [2018-11-28 11:04:50,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2018-11-28 11:04:50,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 11:04:50,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2018-11-28 11:04:50,447 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2018-11-28 11:04:50,447 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2018-11-28 11:04:50,447 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 11:04:50,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 56 transitions. [2018-11-28 11:04:50,448 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 11:04:50,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:04:50,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:04:50,448 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:04:50,448 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:04:50,449 INFO L794 eck$LassoCheckResult]: Stem: 1186#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1184#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1162#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1163#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1170#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1182#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1183#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1185#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1193#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1192#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1191#L545-3 assume !(lis_~i~0 < lis_~N); 1188#L545-4 lis_~i~0 := 1; 1189#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1171#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1172#L549 assume !lis_#t~short11; 1198#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 1197#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1196#L548-3 assume !(lis_~j~0 < lis_~i~0); 1175#L547-2 [2018-11-28 11:04:50,449 INFO L796 eck$LassoCheckResult]: Loop: 1175#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1176#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1180#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1190#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1164#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1165#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1168#L548-3 assume !(lis_~j~0 < lis_~i~0); 1175#L547-2 [2018-11-28 11:04:50,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:04:50,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1306611794, now seen corresponding path program 1 times [2018-11-28 11:04:50,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:04:50,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:04:50,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:50,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:04:50,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:50,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:04:50,473 INFO L82 PathProgramCache]: Analyzing trace with hash 828228918, now seen corresponding path program 4 times [2018-11-28 11:04:50,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:04:50,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:04:50,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:50,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:04:50,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:50,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:04:50,483 INFO L82 PathProgramCache]: Analyzing trace with hash -257841211, now seen corresponding path program 1 times [2018-11-28 11:04:50,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:04:50,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:04:50,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:50,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:04:50,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:04:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 11:04:50,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:04:50,544 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:04:50,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:04:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:04:50,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:04:50,604 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 11:04:50,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:04:50,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2018-11-28 11:04:50,767 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2018-11-28 11:04:50,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:04:50,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:04:50,826 INFO L87 Difference]: Start difference. First operand 39 states and 56 transitions. cyclomatic complexity: 22 Second operand 12 states. [2018-11-28 11:04:50,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:04:50,928 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-11-28 11:04:50,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:04:50,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 82 transitions. [2018-11-28 11:04:50,929 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-28 11:04:50,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 37 states and 51 transitions. [2018-11-28 11:04:50,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-28 11:04:50,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-28 11:04:50,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 51 transitions. [2018-11-28 11:04:50,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:04:50,930 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2018-11-28 11:04:50,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 51 transitions. [2018-11-28 11:04:50,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-11-28 11:04:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 11:04:50,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2018-11-28 11:04:50,932 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2018-11-28 11:04:50,932 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2018-11-28 11:04:50,932 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 11:04:50,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 45 transitions. [2018-11-28 11:04:50,933 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-28 11:04:50,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:04:50,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:04:50,933 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:04:50,933 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2018-11-28 11:04:50,933 INFO L794 eck$LassoCheckResult]: Stem: 1373#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1371#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1353#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1354#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1362#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1369#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1370#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1372#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1380#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1378#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1377#L545-3 assume !(lis_~i~0 < lis_~N); 1375#L545-4 lis_~i~0 := 1; 1376#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1379#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1365#L549 assume !lis_#t~short11; 1357#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 1358#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1361#L548-3 assume !(lis_~j~0 < lis_~i~0); 1364#L547-2 [2018-11-28 11:04:50,933 INFO L796 eck$LassoCheckResult]: Loop: 1364#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1366#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1368#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1383#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1382#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1359#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1360#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1363#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1355#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1356#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1381#L548-3 assume !(lis_~j~0 < lis_~i~0); 1364#L547-2 [2018-11-28 11:04:50,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:04:50,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1306611794, now seen corresponding path program 2 times [2018-11-28 11:04:50,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:04:50,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:04:50,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:50,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:04:50,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:50,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:04:50,952 INFO L82 PathProgramCache]: Analyzing trace with hash 370948975, now seen corresponding path program 5 times [2018-11-28 11:04:50,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:04:50,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:04:50,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:50,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:04:50,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:50,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:04:50,969 INFO L82 PathProgramCache]: Analyzing trace with hash -193053058, now seen corresponding path program 2 times [2018-11-28 11:04:50,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:04:50,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:04:50,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:50,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:04:50,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:04:51,542 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:04:51,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:04:51,542 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:04:51,549 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:04:51,572 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:04:51,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:04:51,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:04:51,592 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:04:51,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-28 11:04:51,612 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:04:51,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:04:51,614 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 13 [2018-11-28 11:04:51,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:04:51,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:04:51,624 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-28 11:04:51,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-11-28 11:04:51,658 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-28 11:04:51,660 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 11:04:51,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:04:51,668 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-28 11:04:51,671 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 11:04:51,671 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:04:51,675 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:04:51,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:04:51,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:04:51,684 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2018-11-28 11:04:51,736 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 0 case distinctions, treesize of input 52 treesize of output 44 [2018-11-28 11:04:51,740 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:04:51,740 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-28 11:04:51,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:04:51,753 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-28 11:04:51,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:04:51,757 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:04:51,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-28 11:04:51,758 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:04:51,773 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:04:51,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:04:51,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:04:51,785 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:59, output treesize:44 [2018-11-28 11:04:51,976 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:04:51,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 105 [2018-11-28 11:04:51,984 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:04:51,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:04:51,987 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:04:51,989 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:04:51,996 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:04:51,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 119 [2018-11-28 11:04:51,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:04:52,035 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:04:52,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 82 [2018-11-28 11:04:52,049 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:04:52,050 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:04:52,050 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:04:52,051 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:04:52,052 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:04:52,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 37 treesize of output 72 [2018-11-28 11:04:52,053 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:04:52,065 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:04:52,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:04:52,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:04:52,086 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:128, output treesize:75 [2018-11-28 11:04:52,242 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:04:52,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:04:52,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-11-28 11:04:52,617 WARN L180 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 114 [2018-11-28 11:04:52,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-28 11:04:52,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2018-11-28 11:04:52,703 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. cyclomatic complexity: 16 Second operand 28 states. [2018-11-28 11:04:54,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:04:54,641 INFO L93 Difference]: Finished difference Result 99 states and 134 transitions. [2018-11-28 11:04:54,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-28 11:04:54,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 134 transitions. [2018-11-28 11:04:54,642 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 42 [2018-11-28 11:04:54,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 99 states and 134 transitions. [2018-11-28 11:04:54,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2018-11-28 11:04:54,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2018-11-28 11:04:54,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 134 transitions. [2018-11-28 11:04:54,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:04:54,644 INFO L705 BuchiCegarLoop]: Abstraction has 99 states and 134 transitions. [2018-11-28 11:04:54,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 134 transitions. [2018-11-28 11:04:54,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 52. [2018-11-28 11:04:54,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-28 11:04:54,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2018-11-28 11:04:54,648 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2018-11-28 11:04:54,648 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2018-11-28 11:04:54,648 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 11:04:54,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 71 transitions. [2018-11-28 11:04:54,649 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-28 11:04:54,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:04:54,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:04:54,649 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:04:54,649 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2018-11-28 11:04:54,649 INFO L794 eck$LassoCheckResult]: Stem: 1679#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1676#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1658#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1659#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1667#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1677#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1678#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1674#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1675#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1688#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1687#L545-3 assume !(lis_~i~0 < lis_~N); 1681#L545-4 lis_~i~0 := 1; 1682#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1689#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1684#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1685#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1663#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1666#L548-3 assume !(lis_~j~0 < lis_~i~0); 1669#L547-2 [2018-11-28 11:04:54,650 INFO L796 eck$LassoCheckResult]: Loop: 1669#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1671#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1673#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1696#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1694#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1664#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1665#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1668#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1697#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1661#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1693#L548-3 assume !(lis_~j~0 < lis_~i~0); 1669#L547-2 [2018-11-28 11:04:54,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:04:54,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1306550290, now seen corresponding path program 1 times [2018-11-28 11:04:54,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:04:54,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:04:54,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:54,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:04:54,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:54,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:04:54,679 INFO L82 PathProgramCache]: Analyzing trace with hash 370948975, now seen corresponding path program 6 times [2018-11-28 11:04:54,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:04:54,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:04:54,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:54,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:04:54,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:54,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:04:54,695 INFO L82 PathProgramCache]: Analyzing trace with hash 2097927870, now seen corresponding path program 2 times [2018-11-28 11:04:54,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:04:54,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:04:54,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:54,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:04:54,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:04:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:04:55,140 WARN L180 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 112 [2018-11-28 11:04:57,275 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 227 DAG size of output: 167 [2018-11-28 11:04:57,651 WARN L180 SmtUtils]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-11-28 11:04:57,653 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:04:57,653 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:04:57,653 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:04:57,653 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:04:57,654 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:04:57,654 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:04:57,654 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:04:57,654 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:04:57,654 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration9_Lasso [2018-11-28 11:04:57,654 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:04:57,654 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:04:57,659 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-28 11:04:57,665 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-28 11:04:59,006 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 111 [2018-11-28 11:04:59,495 WARN L180 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 116 [2018-11-28 11:04:59,495 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-28 11:04:59,496 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-28 11:04:59,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:04:59,499 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-28 11:04:59,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:04:59,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:04:59,502 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-28 11:04:59,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:04:59,504 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-28 11:04:59,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:04:59,507 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-28 11:04:59,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:04:59,509 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-28 11:04:59,510 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-28 11:04:59,510 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-28 11:04:59,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:04:59,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:04:59,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:04:59,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:04:59,946 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:04:59,946 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:04:59,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:04:59,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:59,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:04:59,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:59,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:59,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:59,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:04:59,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:04:59,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:59,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:59,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:59,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:59,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:59,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:59,959 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:04:59,959 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:04:59,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:04:59,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:04:59,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:04:59,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:04:59,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:04:59,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:04:59,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:04:59,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:04:59,978 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:04:59,984 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 11:04:59,984 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:04:59,984 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:04:59,985 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:04:59,986 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:04:59,986 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ (* 4 ULTIMATE.start_lis_~i~0) ULTIMATE.start_lis_~best~0.offset))_1, v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 8))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ (* 4 ULTIMATE.start_lis_~i~0) ULTIMATE.start_lis_~best~0.offset))_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 8))_1 Supporting invariants [] [2018-11-28 11:05:00,315 INFO L297 tatePredicateManager]: 69 out of 70 supporting invariants were superfluous and have been removed [2018-11-28 11:05:00,317 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:05:00,318 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:05:00,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:05:00,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:05:00,362 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 11 treesize of output 14 [2018-11-28 11:05:00,368 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:00,369 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:00,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:05:00,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:00,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:00,376 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-28 11:05:00,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-28 11:05:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:05:00,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:05:00,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:00,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 85 [2018-11-28 11:05:00,441 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:00,443 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:00,450 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:00,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 70 treesize of output 138 [2018-11-28 11:05:00,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 9 xjuncts. [2018-11-28 11:05:00,522 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-11-28 11:05:00,524 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 11:05:00,525 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:00,529 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:00,534 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 69 [2018-11-28 11:05:00,536 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 11:05:00,536 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:00,542 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:00,546 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-11-28 11:05:00,549 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 11:05:00,549 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:00,556 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:00,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:05:00,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:05:00,606 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 1 variables, input treesize:106, output treesize:192 [2018-11-28 11:05:00,858 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:00,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 134 [2018-11-28 11:05:00,866 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:00,868 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:00,869 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:00,870 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:00,871 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:05:00,873 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:00,877 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:00,883 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:00,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 212 [2018-11-28 11:05:00,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:00,918 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:00,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 106 [2018-11-28 11:05:00,923 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2018-11-28 11:05:00,923 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:00,932 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:00,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:00,993 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:00,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 132 [2018-11-28 11:05:00,999 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:01,000 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:01,001 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:01,002 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:01,003 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:01,004 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:01,005 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:01,007 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:01,008 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:01,012 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:01,021 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:01,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 248 [2018-11-28 11:05:01,026 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:01,064 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:01,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 101 [2018-11-28 11:05:01,067 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2018-11-28 11:05:01,067 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:01,075 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:01,087 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:01,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:05:01,113 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:303, output treesize:191 [2018-11-28 11:05:01,224 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:05:01,224 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2018-11-28 11:05:01,225 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 71 transitions. cyclomatic complexity: 23 Second operand 12 states. [2018-11-28 11:05:01,556 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 71 transitions. cyclomatic complexity: 23. Second operand 12 states. Result 117 states and 162 transitions. Complement of second has 22 states. [2018-11-28 11:05:01,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2018-11-28 11:05:01,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 11:05:01,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2018-11-28 11:05:01,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 46 transitions. Stem has 18 letters. Loop has 11 letters. [2018-11-28 11:05:01,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:05:01,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 46 transitions. Stem has 29 letters. Loop has 11 letters. [2018-11-28 11:05:01,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:05:01,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 46 transitions. Stem has 18 letters. Loop has 22 letters. [2018-11-28 11:05:01,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:05:01,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 162 transitions. [2018-11-28 11:05:01,560 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2018-11-28 11:05:01,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 90 states and 121 transitions. [2018-11-28 11:05:01,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2018-11-28 11:05:01,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2018-11-28 11:05:01,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 121 transitions. [2018-11-28 11:05:01,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:05:01,562 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 121 transitions. [2018-11-28 11:05:01,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 121 transitions. [2018-11-28 11:05:01,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 72. [2018-11-28 11:05:01,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-28 11:05:01,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 98 transitions. [2018-11-28 11:05:01,566 INFO L728 BuchiCegarLoop]: Abstraction has 72 states and 98 transitions. [2018-11-28 11:05:01,566 INFO L608 BuchiCegarLoop]: Abstraction has 72 states and 98 transitions. [2018-11-28 11:05:01,566 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 11:05:01,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 98 transitions. [2018-11-28 11:05:01,567 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-28 11:05:01,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:05:01,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:05:01,567 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:05:01,568 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 11:05:01,568 INFO L794 eck$LassoCheckResult]: Stem: 2280#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2277#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 2254#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2255#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 2263#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2278#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2279#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2275#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2276#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2289#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2288#L545-3 assume !(lis_~i~0 < lis_~N); 2282#L545-4 lis_~i~0 := 1; 2283#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2300#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2298#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 2296#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2261#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2262#L548-3 assume !(lis_~j~0 < lis_~i~0); 2295#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2272#L547-3 assume !(lis_~i~0 < lis_~N); 2273#L547-4 lis_~i~0 := 0; 2252#L551-3 [2018-11-28 11:05:01,568 INFO L796 eck$LassoCheckResult]: Loop: 2252#L551-3 assume !!(lis_~i~0 < lis_~N);call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4); 2253#L552 assume lis_~max~0 < lis_#t~mem14;havoc lis_#t~mem14;call lis_#t~mem15 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);lis_~max~0 := lis_#t~mem15;havoc lis_#t~mem15; 2281#L551-2 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 2252#L551-3 [2018-11-28 11:05:01,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:01,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1848859483, now seen corresponding path program 1 times [2018-11-28 11:05:01,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:01,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:01,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:01,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:05:01,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:05:01,664 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:05:01,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:05:01,664 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:05:01,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:05:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:05:01,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:05:01,747 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:05:01,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:05:01,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-11-28 11:05:01,772 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:05:01,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:01,772 INFO L82 PathProgramCache]: Analyzing trace with hash 97415, now seen corresponding path program 1 times [2018-11-28 11:05:01,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:01,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:01,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:01,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:05:01,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:01,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 11:05:01,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-11-28 11:05:01,803 INFO L87 Difference]: Start difference. First operand 72 states and 98 transitions. cyclomatic complexity: 31 Second operand 16 states. [2018-11-28 11:05:01,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:05:01,966 INFO L93 Difference]: Finished difference Result 106 states and 141 transitions. [2018-11-28 11:05:01,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 11:05:01,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 141 transitions. [2018-11-28 11:05:01,968 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2018-11-28 11:05:01,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 106 states and 141 transitions. [2018-11-28 11:05:01,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2018-11-28 11:05:01,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2018-11-28 11:05:01,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 141 transitions. [2018-11-28 11:05:01,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:05:01,969 INFO L705 BuchiCegarLoop]: Abstraction has 106 states and 141 transitions. [2018-11-28 11:05:01,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 141 transitions. [2018-11-28 11:05:01,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 73. [2018-11-28 11:05:01,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-28 11:05:01,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 98 transitions. [2018-11-28 11:05:01,972 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 98 transitions. [2018-11-28 11:05:01,972 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 98 transitions. [2018-11-28 11:05:01,972 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 11:05:01,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 98 transitions. [2018-11-28 11:05:01,973 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-28 11:05:01,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:05:01,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:05:01,974 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:05:01,975 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:05:01,975 INFO L794 eck$LassoCheckResult]: Stem: 2551#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2548#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 2525#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2526#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 2534#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2549#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2550#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2545#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2546#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2557#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2556#L545-3 assume !(lis_~i~0 < lis_~N); 2553#L545-4 lis_~i~0 := 1; 2554#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2573#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2571#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 2568#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2567#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2565#L548-3 assume !(lis_~j~0 < lis_~i~0); 2564#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2544#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2535#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2536#L549 assume !lis_#t~short11; 2527#L549-2 [2018-11-28 11:05:01,975 INFO L796 eck$LassoCheckResult]: Loop: 2527#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 2528#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2581#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2580#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 2578#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2575#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2576#L548-3 assume !(lis_~j~0 < lis_~i~0); 2558#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2559#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2594#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2593#L549 assume !lis_#t~short11; 2527#L549-2 [2018-11-28 11:05:01,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:01,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1480067810, now seen corresponding path program 1 times [2018-11-28 11:05:01,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:01,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:01,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:01,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:05:01,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:02,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:02,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1565507769, now seen corresponding path program 1 times [2018-11-28 11:05:02,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:02,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:02,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:02,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:05:02,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:02,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:02,016 INFO L82 PathProgramCache]: Analyzing trace with hash 183297546, now seen corresponding path program 3 times [2018-11-28 11:05:02,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:02,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:02,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:02,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:05:02,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:05:02,111 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 11:05:02,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:05:02,111 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:05:02,132 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 11:05:02,189 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-28 11:05:02,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:05:02,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:05:02,297 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 11:05:02,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:05:02,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-28 11:05:02,557 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 102 [2018-11-28 11:05:02,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 11:05:02,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-11-28 11:05:02,620 INFO L87 Difference]: Start difference. First operand 73 states and 98 transitions. cyclomatic complexity: 30 Second operand 20 states. [2018-11-28 11:05:02,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:05:02,862 INFO L93 Difference]: Finished difference Result 143 states and 187 transitions. [2018-11-28 11:05:02,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 11:05:02,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 187 transitions. [2018-11-28 11:05:02,864 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-28 11:05:02,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 142 states and 186 transitions. [2018-11-28 11:05:02,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2018-11-28 11:05:02,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2018-11-28 11:05:02,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 186 transitions. [2018-11-28 11:05:02,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:05:02,866 INFO L705 BuchiCegarLoop]: Abstraction has 142 states and 186 transitions. [2018-11-28 11:05:02,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 186 transitions. [2018-11-28 11:05:02,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 126. [2018-11-28 11:05:02,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-28 11:05:02,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 167 transitions. [2018-11-28 11:05:02,870 INFO L728 BuchiCegarLoop]: Abstraction has 126 states and 167 transitions. [2018-11-28 11:05:02,870 INFO L608 BuchiCegarLoop]: Abstraction has 126 states and 167 transitions. [2018-11-28 11:05:02,870 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 11:05:02,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 167 transitions. [2018-11-28 11:05:02,871 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2018-11-28 11:05:02,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:05:02,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:05:02,872 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:05:02,872 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:05:02,873 INFO L794 eck$LassoCheckResult]: Stem: 2907#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2904#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 2882#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2883#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 2891#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2905#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2906#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2902#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2903#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2932#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2928#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2929#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2931#L545-3 assume !(lis_~i~0 < lis_~N); 2930#L545-4 lis_~i~0 := 1; 2927#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2926#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2924#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 2921#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2920#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2918#L548-3 assume !(lis_~j~0 < lis_~i~0); 2915#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2916#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3003#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3002#L549 assume !lis_#t~short11; 2968#L549-2 [2018-11-28 11:05:02,873 INFO L796 eck$LassoCheckResult]: Loop: 2968#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 2965#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2995#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2958#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 2945#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2946#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2963#L548-3 assume !(lis_~j~0 < lis_~i~0); 2971#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2970#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2969#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2967#L549 assume !lis_#t~short11; 2968#L549-2 [2018-11-28 11:05:02,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:02,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1862607488, now seen corresponding path program 2 times [2018-11-28 11:05:02,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:02,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:02,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:02,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:05:02,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:02,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:02,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1565507769, now seen corresponding path program 2 times [2018-11-28 11:05:02,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:02,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:02,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:02,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:05:02,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:02,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:02,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1101378456, now seen corresponding path program 4 times [2018-11-28 11:05:02,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:02,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:02,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:02,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:05:02,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:05:03,492 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 36 [2018-11-28 11:05:03,926 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 49 [2018-11-28 11:05:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:05:04,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:05:04,848 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:05:04,855 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 11:05:04,876 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 11:05:04,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:05:04,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:05:04,888 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:04,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-28 11:05:04,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:04,900 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:04,900 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 13 [2018-11-28 11:05:04,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:04,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:04,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:04,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-11-28 11:05:05,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 47 [2018-11-28 11:05:05,070 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:05,071 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:05,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 36 [2018-11-28 11:05:05,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:05,091 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 0 case distinctions, treesize of input 44 treesize of output 53 [2018-11-28 11:05:05,093 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 11:05:05,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:05,105 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:05,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:05,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-28 11:05:05,118 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:73, output treesize:52 [2018-11-28 11:05:05,429 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-28 11:05:05,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:05:05,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13] total 33 [2018-11-28 11:05:05,646 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 102 [2018-11-28 11:05:05,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-28 11:05:05,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2018-11-28 11:05:05,703 INFO L87 Difference]: Start difference. First operand 126 states and 167 transitions. cyclomatic complexity: 47 Second operand 33 states. [2018-11-28 11:05:10,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:05:10,795 INFO L93 Difference]: Finished difference Result 399 states and 518 transitions. [2018-11-28 11:05:10,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-11-28 11:05:10,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 399 states and 518 transitions. [2018-11-28 11:05:10,798 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 96 [2018-11-28 11:05:10,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 399 states to 394 states and 513 transitions. [2018-11-28 11:05:10,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 332 [2018-11-28 11:05:10,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 354 [2018-11-28 11:05:10,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 394 states and 513 transitions. [2018-11-28 11:05:10,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:05:10,801 INFO L705 BuchiCegarLoop]: Abstraction has 394 states and 513 transitions. [2018-11-28 11:05:10,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states and 513 transitions. [2018-11-28 11:05:10,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 228. [2018-11-28 11:05:10,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-11-28 11:05:10,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 306 transitions. [2018-11-28 11:05:10,808 INFO L728 BuchiCegarLoop]: Abstraction has 228 states and 306 transitions. [2018-11-28 11:05:10,808 INFO L608 BuchiCegarLoop]: Abstraction has 228 states and 306 transitions. [2018-11-28 11:05:10,808 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-28 11:05:10,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 228 states and 306 transitions. [2018-11-28 11:05:10,809 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 47 [2018-11-28 11:05:10,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:05:10,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:05:10,810 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:05:10,810 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2018-11-28 11:05:10,811 INFO L794 eck$LassoCheckResult]: Stem: 3711#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3708#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 3685#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 3686#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 3694#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3709#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3742#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3741#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3740#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3739#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3738#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3737#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3736#L545-3 assume !(lis_~i~0 < lis_~N); 3735#L545-4 lis_~i~0 := 1; 3734#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3732#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3729#L549 assume !lis_#t~short11; 3730#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 3744#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3751#L548-3 assume !(lis_~j~0 < lis_~i~0); 3749#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3750#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3799#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3797#L549 assume !lis_#t~short11; 3798#L549-2 [2018-11-28 11:05:10,811 INFO L796 eck$LassoCheckResult]: Loop: 3798#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 3796#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3885#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3824#L549 assume !lis_#t~short11; 3882#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 3850#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3823#L548-3 assume !(lis_~j~0 < lis_~i~0); 3819#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3816#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3813#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3809#L549 assume !lis_#t~short11; 3798#L549-2 [2018-11-28 11:05:10,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:10,811 INFO L82 PathProgramCache]: Analyzing trace with hash -896946752, now seen corresponding path program 1 times [2018-11-28 11:05:10,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:10,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:10,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:10,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:05:10,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:10,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:10,835 INFO L82 PathProgramCache]: Analyzing trace with hash -599847033, now seen corresponding path program 1 times [2018-11-28 11:05:10,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:10,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:10,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:10,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:05:10,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:10,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:10,842 INFO L82 PathProgramCache]: Analyzing trace with hash 476161128, now seen corresponding path program 2 times [2018-11-28 11:05:10,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:10,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:10,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:10,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:05:10,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:11,001 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2018-11-28 11:05:13,404 WARN L180 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 243 DAG size of output: 181 [2018-11-28 11:05:14,007 WARN L180 SmtUtils]: Spent 600.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2018-11-28 11:05:14,009 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:05:14,009 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:05:14,009 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:05:14,009 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:05:14,010 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:05:14,010 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:05:14,010 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:05:14,010 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:05:14,010 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration13_Lasso [2018-11-28 11:05:14,010 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:05:14,010 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:05:14,013 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-28 11:05:14,014 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-28 11:05:14,015 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-28 11:05:14,017 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-28 11:05:14,019 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-28 11:05:14,020 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-28 11:05:14,021 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-28 11:05:14,022 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-28 11:05:14,023 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-28 11:05:14,024 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-28 11:05:14,025 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-28 11:05:14,026 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-28 11:05:14,027 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-28 11:05:14,028 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-28 11:05:14,029 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-28 11:05:14,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:05:14,031 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-28 11:05:14,926 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 117 [2018-11-28 11:05:15,045 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-28 11:05:15,218 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2018-11-28 11:05:15,449 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:05:15,449 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:05:15,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-28 11:05:15,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:15,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:15,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:15,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:15,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:15,450 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:15,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:15,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:15,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-28 11:05:15,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:15,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:15,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:15,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:15,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:15,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:15,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:15,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:15,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:15,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:15,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:15,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:15,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:15,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:15,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:05:15,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:15,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-28 11:05:15,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:15,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:15,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:15,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:15,466 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:15,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:05:15,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:15,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:15,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:15,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:15,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:15,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:15,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:15,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:15,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:15,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:15,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-28 11:05:15,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:15,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:15,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:15,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:15,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:15,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:15,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:15,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:15,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-28 11:05:15,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:15,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:15,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:15,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:15,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:15,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:05:15,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:15,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:15,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:15,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:15,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:15,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:15,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:15,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:15,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:15,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:15,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-28 11:05:15,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:15,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:15,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:15,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:15,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:15,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:15,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:15,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:15,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:05:15,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:15,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:15,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:15,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:15,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:15,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:15,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:15,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:15,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-28 11:05:15,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:15,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:15,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:15,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:15,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:15,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:15,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:15,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:15,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:15,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:15,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:15,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:15,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:15,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:15,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:15,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:15,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:15,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-28 11:05:15,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:15,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:15,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:15,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:15,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:15,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:15,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:15,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:15,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:05:15,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:15,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:15,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:15,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:15,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:15,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:15,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:15,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:15,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:05:15,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:15,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:15,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:15,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:15,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:15,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:05:15,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:15,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:15,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:15,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:15,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:15,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:15,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:15,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:15,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:15,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:15,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-28 11:05:15,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:15,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:15,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:15,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:15,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:15,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:05:15,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:15,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:15,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:15,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:15,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:15,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:15,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:15,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:05:15,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:15,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:15,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:15,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:15,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:15,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:15,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:15,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:05:15,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:15,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:15,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:15,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:15,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:15,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:15,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:15,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:05:15,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:15,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:15,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:15,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:15,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:15,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:15,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:15,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:05:15,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:15,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:15,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:15,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:15,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:15,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:15,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:15,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:05:15,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:15,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:15,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:15,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:15,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:15,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:15,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:15,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:05:15,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:15,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:15,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:15,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:15,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:15,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:15,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:15,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:05:15,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:15,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:15,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:15,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:15,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:15,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:15,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:15,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:05:15,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:15,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:05:15,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:15,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:15,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:15,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:15,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:15,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:05:15,538 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:05:15,560 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 11:05:15,560 INFO L444 ModelExtractionUtils]: 45 out of 55 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-28 11:05:15,560 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:05:15,561 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:05:15,561 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:05:15,561 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0) = -2*ULTIMATE.start_lis_~i~0 + 5 Supporting invariants [] [2018-11-28 11:05:15,817 INFO L297 tatePredicateManager]: 55 out of 56 supporting invariants were superfluous and have been removed [2018-11-28 11:05:15,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:05:15,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:05:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:05:15,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:05:15,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:05:15,904 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-28 11:05:15,904 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 228 states and 306 transitions. cyclomatic complexity: 88 Second operand 9 states. [2018-11-28 11:05:15,990 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 228 states and 306 transitions. cyclomatic complexity: 88. Second operand 9 states. Result 558 states and 763 transitions. Complement of second has 15 states. [2018-11-28 11:05:15,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 5 non-accepting loop states 2 accepting loop states [2018-11-28 11:05:15,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 11:05:15,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2018-11-28 11:05:15,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 53 transitions. Stem has 24 letters. Loop has 11 letters. [2018-11-28 11:05:15,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:05:15,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 53 transitions. Stem has 35 letters. Loop has 11 letters. [2018-11-28 11:05:15,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:05:15,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 53 transitions. Stem has 24 letters. Loop has 22 letters. [2018-11-28 11:05:15,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:05:15,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 558 states and 763 transitions. [2018-11-28 11:05:15,995 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 84 [2018-11-28 11:05:15,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 558 states to 525 states and 714 transitions. [2018-11-28 11:05:15,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 363 [2018-11-28 11:05:15,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 432 [2018-11-28 11:05:15,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 525 states and 714 transitions. [2018-11-28 11:05:15,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:05:15,999 INFO L705 BuchiCegarLoop]: Abstraction has 525 states and 714 transitions. [2018-11-28 11:05:16,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states and 714 transitions. [2018-11-28 11:05:16,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 439. [2018-11-28 11:05:16,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-11-28 11:05:16,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 604 transitions. [2018-11-28 11:05:16,010 INFO L728 BuchiCegarLoop]: Abstraction has 439 states and 604 transitions. [2018-11-28 11:05:16,010 INFO L608 BuchiCegarLoop]: Abstraction has 439 states and 604 transitions. [2018-11-28 11:05:16,010 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-28 11:05:16,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 439 states and 604 transitions. [2018-11-28 11:05:16,012 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 77 [2018-11-28 11:05:16,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:05:16,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:05:16,013 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:05:16,013 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:05:16,013 INFO L794 eck$LassoCheckResult]: Stem: 4879#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4875#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 4851#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 4852#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 4860#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4876#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4891#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4894#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4877#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4878#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4954#L545-3 assume !(lis_~i~0 < lis_~N); 4881#L545-4 lis_~i~0 := 1; 4882#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 5043#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 5041#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 5038#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 5039#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5067#L548-3 assume !(lis_~j~0 < lis_~i~0); 5065#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 5066#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 5168#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 5169#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 5192#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 5172#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5255#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 5072#L549 [2018-11-28 11:05:16,013 INFO L796 eck$LassoCheckResult]: Loop: 5072#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 5254#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 5253#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5071#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 5072#L549 [2018-11-28 11:05:16,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:16,014 INFO L82 PathProgramCache]: Analyzing trace with hash -565876855, now seen corresponding path program 1 times [2018-11-28 11:05:16,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:16,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:16,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:16,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:05:16,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:05:16,400 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:05:16,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:05:16,400 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:05:16,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:05:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:05:16,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:05:16,433 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 11 treesize of output 14 [2018-11-28 11:05:16,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:16,441 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:16,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:05:16,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:16,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:16,448 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-28 11:05:16,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:8 [2018-11-28 11:05:16,469 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-28 11:05:16,471 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 11:05:16,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:16,478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-28 11:05:16,480 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 11:05:16,480 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:16,484 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:16,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:16,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:16,492 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-11-28 11:05:16,531 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 0 case distinctions, treesize of input 52 treesize of output 44 [2018-11-28 11:05:16,534 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:16,535 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-28 11:05:16,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:16,548 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-28 11:05:16,550 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:16,551 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:16,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-28 11:05:16,552 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:16,560 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:16,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:16,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:16,572 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 [2018-11-28 11:05:16,693 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:16,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 93 [2018-11-28 11:05:16,698 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:05:16,701 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:16,702 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:16,703 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:16,708 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:16,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 91 [2018-11-28 11:05:16,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:16,733 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:16,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 74 [2018-11-28 11:05:16,737 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:16,737 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:05:16,738 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:16,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:16,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 37 treesize of output 58 [2018-11-28 11:05:16,740 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:16,759 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:16,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:16,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:05:16,779 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:110, output treesize:61 [2018-11-28 11:05:16,909 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:05:16,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:05:16,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2018-11-28 11:05:16,926 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:05:16,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:16,926 INFO L82 PathProgramCache]: Analyzing trace with hash 2222522, now seen corresponding path program 2 times [2018-11-28 11:05:16,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:16,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:16,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:16,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:05:16,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:17,086 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2018-11-28 11:05:17,192 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-11-28 11:05:17,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-28 11:05:17,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2018-11-28 11:05:17,193 INFO L87 Difference]: Start difference. First operand 439 states and 604 transitions. cyclomatic complexity: 183 Second operand 28 states. [2018-11-28 11:05:19,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:05:19,602 INFO L93 Difference]: Finished difference Result 675 states and 900 transitions. [2018-11-28 11:05:19,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-11-28 11:05:19,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 675 states and 900 transitions. [2018-11-28 11:05:19,606 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 160 [2018-11-28 11:05:19,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 675 states to 655 states and 880 transitions. [2018-11-28 11:05:19,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 550 [2018-11-28 11:05:19,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 558 [2018-11-28 11:05:19,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 655 states and 880 transitions. [2018-11-28 11:05:19,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:05:19,610 INFO L705 BuchiCegarLoop]: Abstraction has 655 states and 880 transitions. [2018-11-28 11:05:19,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states and 880 transitions. [2018-11-28 11:05:19,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 367. [2018-11-28 11:05:19,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-11-28 11:05:19,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 494 transitions. [2018-11-28 11:05:19,618 INFO L728 BuchiCegarLoop]: Abstraction has 367 states and 494 transitions. [2018-11-28 11:05:19,618 INFO L608 BuchiCegarLoop]: Abstraction has 367 states and 494 transitions. [2018-11-28 11:05:19,618 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-28 11:05:19,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 367 states and 494 transitions. [2018-11-28 11:05:19,620 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 61 [2018-11-28 11:05:19,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:05:19,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:05:19,621 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:05:19,621 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:05:19,621 INFO L794 eck$LassoCheckResult]: Stem: 6203#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6199#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 6174#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 6175#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 6183#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6200#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6212#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6213#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6201#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6202#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6211#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6196#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6197#L545-3 assume !(lis_~i~0 < lis_~N); 6228#L545-4 lis_~i~0 := 1; 6245#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6243#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 6240#L549 assume !lis_#t~short11; 6222#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 6238#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6233#L548-3 assume !(lis_~j~0 < lis_~i~0); 6234#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 6193#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6195#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 6506#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 6507#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 6177#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6500#L548-3 [2018-11-28 11:05:19,625 INFO L796 eck$LassoCheckResult]: Loop: 6500#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 6531#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 6455#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6452#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6356#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 6357#L549 assume !lis_#t~short11; 6295#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 6478#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6520#L548-3 assume !(lis_~j~0 < lis_~i~0); 6511#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 6501#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6500#L548-3 [2018-11-28 11:05:19,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:19,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1322597504, now seen corresponding path program 1 times [2018-11-28 11:05:19,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:19,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:19,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:19,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:05:19,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:05:19,934 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:05:19,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:05:19,935 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:05:19,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:05:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:05:19,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:05:19,958 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 11 treesize of output 14 [2018-11-28 11:05:19,962 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:19,963 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:19,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:05:19,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:19,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:19,969 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-28 11:05:19,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:8 [2018-11-28 11:05:19,982 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-28 11:05:19,985 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 11:05:19,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:19,994 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-28 11:05:19,996 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 11:05:19,996 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:20,001 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:20,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:20,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:20,011 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-11-28 11:05:20,048 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 0 case distinctions, treesize of input 54 treesize of output 44 [2018-11-28 11:05:20,051 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,052 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-28 11:05:20,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:20,066 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-28 11:05:20,068 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,068 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 35 [2018-11-28 11:05:20,069 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:20,077 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:20,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:20,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:20,089 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:61, output treesize:44 [2018-11-28 11:05:20,129 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 0 case distinctions, treesize of input 72 treesize of output 60 [2018-11-28 11:05:20,132 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,133 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,134 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,134 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-28 11:05:20,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:20,151 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 56 [2018-11-28 11:05:20,154 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,154 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,155 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,156 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,157 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,157 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 84 [2018-11-28 11:05:20,158 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:20,172 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:20,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:20,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:20,188 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:79, output treesize:62 [2018-11-28 11:05:20,246 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 0 case distinctions, treesize of input 90 treesize of output 76 [2018-11-28 11:05:20,249 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,250 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,251 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,252 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,253 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,254 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2018-11-28 11:05:20,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:20,280 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 72 [2018-11-28 11:05:20,283 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,284 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,284 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,285 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,286 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,287 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,288 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,288 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,289 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,290 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,291 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,292 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:20,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 157 [2018-11-28 11:05:20,293 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:20,318 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:20,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:20,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-28 11:05:20,339 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:97, output treesize:80 [2018-11-28 11:05:20,523 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:05:20,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:05:20,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-11-28 11:05:20,542 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:05:20,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:20,543 INFO L82 PathProgramCache]: Analyzing trace with hash 237530077, now seen corresponding path program 3 times [2018-11-28 11:05:20,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:20,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:20,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:20,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:05:20,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:20,750 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 96 [2018-11-28 11:05:20,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-28 11:05:20,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2018-11-28 11:05:20,796 INFO L87 Difference]: Start difference. First operand 367 states and 494 transitions. cyclomatic complexity: 139 Second operand 25 states. [2018-11-28 11:05:22,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:05:22,745 INFO L93 Difference]: Finished difference Result 548 states and 718 transitions. [2018-11-28 11:05:22,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-28 11:05:22,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 548 states and 718 transitions. [2018-11-28 11:05:22,747 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 123 [2018-11-28 11:05:22,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 548 states to 548 states and 718 transitions. [2018-11-28 11:05:22,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 436 [2018-11-28 11:05:22,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 436 [2018-11-28 11:05:22,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 548 states and 718 transitions. [2018-11-28 11:05:22,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:05:22,750 INFO L705 BuchiCegarLoop]: Abstraction has 548 states and 718 transitions. [2018-11-28 11:05:22,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states and 718 transitions. [2018-11-28 11:05:22,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 331. [2018-11-28 11:05:22,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-11-28 11:05:22,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 438 transitions. [2018-11-28 11:05:22,756 INFO L728 BuchiCegarLoop]: Abstraction has 331 states and 438 transitions. [2018-11-28 11:05:22,757 INFO L608 BuchiCegarLoop]: Abstraction has 331 states and 438 transitions. [2018-11-28 11:05:22,757 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-28 11:05:22,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 331 states and 438 transitions. [2018-11-28 11:05:22,758 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 65 [2018-11-28 11:05:22,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:05:22,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:05:22,759 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:05:22,759 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:05:22,759 INFO L794 eck$LassoCheckResult]: Stem: 7285#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7281#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 7256#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 7257#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 7265#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 7282#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7297#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 7298#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7283#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 7284#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7292#L545-3 assume !(lis_~i~0 < lis_~N); 7287#L545-4 lis_~i~0 := 1; 7288#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7394#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7393#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 7390#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 7388#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7389#L548-3 assume !(lis_~j~0 < lis_~i~0); 7384#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 7273#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7274#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7510#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 7511#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 7522#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7521#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7519#L549 assume !lis_#t~short11; 7520#L549-2 [2018-11-28 11:05:22,759 INFO L796 eck$LassoCheckResult]: Loop: 7520#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 7515#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7573#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7574#L549 assume !lis_#t~short11; 7520#L549-2 [2018-11-28 11:05:22,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:22,759 INFO L82 PathProgramCache]: Analyzing trace with hash -362372859, now seen corresponding path program 3 times [2018-11-28 11:05:22,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:22,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:22,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:22,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:05:22,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:22,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:22,790 INFO L82 PathProgramCache]: Analyzing trace with hash 2464296, now seen corresponding path program 1 times [2018-11-28 11:05:22,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:22,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:22,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:22,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:05:22,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:22,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:22,794 INFO L82 PathProgramCache]: Analyzing trace with hash 613161260, now seen corresponding path program 5 times [2018-11-28 11:05:22,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:22,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:22,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:22,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:05:22,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:05:22,847 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 11:05:22,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:05:22,848 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:05:22,860 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 11:05:22,966 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-28 11:05:22,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:05:22,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:05:23,027 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:05:23,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:05:23,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2018-11-28 11:05:23,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 11:05:23,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-11-28 11:05:23,086 INFO L87 Difference]: Start difference. First operand 331 states and 438 transitions. cyclomatic complexity: 120 Second operand 17 states. [2018-11-28 11:05:23,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:05:23,272 INFO L93 Difference]: Finished difference Result 418 states and 526 transitions. [2018-11-28 11:05:23,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 11:05:23,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 418 states and 526 transitions. [2018-11-28 11:05:23,274 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 59 [2018-11-28 11:05:23,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 418 states to 376 states and 481 transitions. [2018-11-28 11:05:23,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 289 [2018-11-28 11:05:23,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 289 [2018-11-28 11:05:23,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 376 states and 481 transitions. [2018-11-28 11:05:23,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:05:23,276 INFO L705 BuchiCegarLoop]: Abstraction has 376 states and 481 transitions. [2018-11-28 11:05:23,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states and 481 transitions. [2018-11-28 11:05:23,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 287. [2018-11-28 11:05:23,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-11-28 11:05:23,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 374 transitions. [2018-11-28 11:05:23,285 INFO L728 BuchiCegarLoop]: Abstraction has 287 states and 374 transitions. [2018-11-28 11:05:23,285 INFO L608 BuchiCegarLoop]: Abstraction has 287 states and 374 transitions. [2018-11-28 11:05:23,285 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-28 11:05:23,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 287 states and 374 transitions. [2018-11-28 11:05:23,286 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 48 [2018-11-28 11:05:23,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:05:23,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:05:23,287 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:05:23,287 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 11:05:23,287 INFO L794 eck$LassoCheckResult]: Stem: 8156#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8154#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 8131#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 8132#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 8140#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 8151#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8152#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 8155#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8177#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 8178#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8196#L545-3 assume !(lis_~i~0 < lis_~N); 8158#L545-4 lis_~i~0 := 1; 8159#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 8277#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 8276#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 8273#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 8271#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8272#L548-3 assume !(lis_~j~0 < lis_~i~0); 8267#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 8148#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 8149#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 8412#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 8307#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 8137#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8138#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 8141#L549 assume !lis_#t~short11; 8161#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 8296#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8297#L548-3 assume !(lis_~j~0 < lis_~i~0); 8402#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 8163#L547-3 assume !(lis_~i~0 < lis_~N); 8153#L547-4 lis_~i~0 := 0; 8129#L551-3 [2018-11-28 11:05:23,287 INFO L796 eck$LassoCheckResult]: Loop: 8129#L551-3 assume !!(lis_~i~0 < lis_~N);call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4); 8130#L552 assume lis_~max~0 < lis_#t~mem14;havoc lis_#t~mem14;call lis_#t~mem15 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);lis_~max~0 := lis_#t~mem15;havoc lis_#t~mem15; 8157#L551-2 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 8129#L551-3 [2018-11-28 11:05:23,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:23,288 INFO L82 PathProgramCache]: Analyzing trace with hash 837404217, now seen corresponding path program 1 times [2018-11-28 11:05:23,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:23,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:23,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:23,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:05:23,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:23,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:23,327 INFO L82 PathProgramCache]: Analyzing trace with hash 97415, now seen corresponding path program 2 times [2018-11-28 11:05:23,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:23,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:23,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:23,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:05:23,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:23,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:23,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1939041103, now seen corresponding path program 1 times [2018-11-28 11:05:23,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:23,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:23,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:23,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:05:23,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:28,613 WARN L180 SmtUtils]: Spent 5.20 s on a formula simplification. DAG size of input: 333 DAG size of output: 233 [2018-11-28 11:05:30,754 WARN L180 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 160 [2018-11-28 11:05:30,757 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:05:30,757 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:05:30,757 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:05:30,757 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:05:30,757 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:05:30,757 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:05:30,757 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:05:30,757 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:05:30,757 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration17_Lasso [2018-11-28 11:05:30,757 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:05:30,757 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:05:30,759 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-28 11:05:30,760 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-28 11:05:30,761 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-28 11:05:30,765 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-28 11:05:30,766 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-28 11:05:30,767 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-28 11:05:30,768 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-28 11:05:30,769 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-28 11:05:30,770 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-28 11:05:30,771 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-28 11:05:30,773 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-28 11:05:30,773 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-28 11:05:30,775 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-28 11:05:30,776 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-28 11:05:30,777 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-28 11:05:30,778 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-28 11:05:30,779 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-28 11:05:30,779 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-28 11:05:30,781 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-28 11:05:30,782 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-28 11:05:32,451 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 99 [2018-11-28 11:05:32,516 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-28 11:05:32,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:05:32,834 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:05:32,834 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:05:32,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:05:32,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:32,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:32,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:32,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:32,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:32,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:32,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:32,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:32,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-28 11:05:32,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:32,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:32,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:32,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:32,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:32,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:32,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:32,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:32,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:32,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:32,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:32,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:32,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:32,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:32,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:05:32,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:32,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:32,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:32,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:32,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:32,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:32,841 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:32,841 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:05:32,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:32,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:32,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:32,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:32,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:32,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:32,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:32,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:32,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:32,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:32,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:32,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:32,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:32,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:32,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:32,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:32,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:32,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:32,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:32,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-28 11:05:32,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:32,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:32,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:32,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:32,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:32,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:32,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:32,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:32,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:05:32,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:32,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:32,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:32,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:32,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:32,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:32,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:32,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:32,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:32,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:32,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:32,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:32,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:32,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:32,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:32,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:32,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:32,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:32,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:32,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:32,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:32,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:32,848 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:32,848 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:05:32,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:32,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:32,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:32,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:32,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:32,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:32,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:32,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:32,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:32,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:32,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:32,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:32,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:32,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:32,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:32,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:32,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:05:32,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:32,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:32,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:32,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:32,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:32,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:32,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:32,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:32,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:32,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:32,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:32,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:32,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:32,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:32,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:32,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:32,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:32,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:32,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:32,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:32,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:32,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:32,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:32,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:32,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:32,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:32,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:32,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:32,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-28 11:05:32,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:32,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:32,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:32,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:32,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:32,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:32,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:32,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:32,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:32,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:32,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:32,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:32,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:32,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:32,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:32,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:32,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:32,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:32,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:32,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:32,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:32,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:32,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:32,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:05:32,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:32,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:32,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:32,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:32,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:32,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:32,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:32,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:32,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:32,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:32,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:32,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:32,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:32,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:32,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:32,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:32,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:05:32,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:32,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:32,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:32,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:32,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:32,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:32,870 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:32,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:05:32,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:32,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:32,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:32,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:32,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:32,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:32,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:32,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:05:32,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:32,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:32,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:32,875 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:05:32,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:32,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:32,876 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:05:32,876 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:05:32,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:32,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:32,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:32,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:32,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:32,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:32,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:32,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:05:32,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:32,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:32,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:32,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:32,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:32,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:32,883 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:32,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:05:32,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:32,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:05:32,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:32,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:32,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:32,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:32,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:32,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:05:32,902 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:05:32,918 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 11:05:32,918 INFO L444 ModelExtractionUtils]: 42 out of 49 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 11:05:32,919 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:05:32,919 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:05:32,920 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:05:32,920 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~N) = -1*ULTIMATE.start_lis_~i~0 + 1*ULTIMATE.start_lis_~N Supporting invariants [] [2018-11-28 11:05:33,187 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2018-11-28 11:05:33,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:05:33,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:05:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:05:33,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:05:33,221 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-28 11:05:33,222 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 11:05:33,222 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 287 states and 374 transitions. cyclomatic complexity: 96 Second operand 3 states. [2018-11-28 11:05:33,228 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 287 states and 374 transitions. cyclomatic complexity: 96. Second operand 3 states. Result 290 states and 379 transitions. Complement of second has 4 states. [2018-11-28 11:05:33,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 11:05:33,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 11:05:33,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2018-11-28 11:05:33,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 32 letters. Loop has 3 letters. [2018-11-28 11:05:33,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:05:33,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 35 letters. Loop has 3 letters. [2018-11-28 11:05:33,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:05:33,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 32 letters. Loop has 6 letters. [2018-11-28 11:05:33,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:05:33,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 290 states and 379 transitions. [2018-11-28 11:05:33,232 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 45 [2018-11-28 11:05:33,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 290 states to 233 states and 294 transitions. [2018-11-28 11:05:33,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 168 [2018-11-28 11:05:33,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 168 [2018-11-28 11:05:33,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 233 states and 294 transitions. [2018-11-28 11:05:33,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:05:33,233 INFO L705 BuchiCegarLoop]: Abstraction has 233 states and 294 transitions. [2018-11-28 11:05:33,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states and 294 transitions. [2018-11-28 11:05:33,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 206. [2018-11-28 11:05:33,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-11-28 11:05:33,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 259 transitions. [2018-11-28 11:05:33,237 INFO L728 BuchiCegarLoop]: Abstraction has 206 states and 259 transitions. [2018-11-28 11:05:33,237 INFO L608 BuchiCegarLoop]: Abstraction has 206 states and 259 transitions. [2018-11-28 11:05:33,237 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-28 11:05:33,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 206 states and 259 transitions. [2018-11-28 11:05:33,238 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 45 [2018-11-28 11:05:33,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:05:33,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:05:33,238 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:05:33,238 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2018-11-28 11:05:33,239 INFO L794 eck$LassoCheckResult]: Stem: 9014#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9011#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 8991#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 8992#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 8999#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9012#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9013#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9009#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9010#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9026#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9025#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9023#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9024#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9021#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9020#L545-3 assume !(lis_~i~0 < lis_~N); 9022#L545-4 lis_~i~0 := 1; 9038#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9037#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9035#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 9034#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9033#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9032#L548-3 assume !(lis_~j~0 < lis_~i~0); 9027#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 9029#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9084#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9081#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 9082#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9117#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9116#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9113#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 9107#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 9106#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9097#L548-3 assume !(lis_~j~0 < lis_~i~0); 9096#L547-2 [2018-11-28 11:05:33,239 INFO L796 eck$LassoCheckResult]: Loop: 9096#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 9095#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9094#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9092#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 9093#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9102#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9105#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9103#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 9100#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9098#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9099#L548-3 assume !(lis_~j~0 < lis_~i~0); 9096#L547-2 [2018-11-28 11:05:33,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:33,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1848019324, now seen corresponding path program 2 times [2018-11-28 11:05:33,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:33,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:33,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:33,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:05:33,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:05:33,792 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 11:05:33,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:05:33,793 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:05:33,801 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:05:33,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:05:33,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:05:33,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:05:33,831 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:33,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-28 11:05:33,847 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:33,847 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:33,848 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 13 [2018-11-28 11:05:33,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:33,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:33,855 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-28 11:05:33,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:8 [2018-11-28 11:05:33,892 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 32 [2018-11-28 11:05:33,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:33,896 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:33,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 40 [2018-11-28 11:05:33,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:33,907 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-11-28 11:05:33,909 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 11:05:33,910 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:33,914 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:33,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:33,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:33,923 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:62, output treesize:39 [2018-11-28 11:05:33,990 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 0 case distinctions, treesize of input 84 treesize of output 60 [2018-11-28 11:05:33,993 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:33,993 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:05:33,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:33,995 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:33,996 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:33,997 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:33,997 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:05:33,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 32 treesize of output 120 [2018-11-28 11:05:33,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:34,015 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 64 [2018-11-28 11:05:34,018 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:34,018 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-11-28 11:05:34,019 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:34,026 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:34,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:34,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:05:34,043 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:97, output treesize:74 [2018-11-28 11:05:34,117 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-28 11:05:34,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:05:34,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 27 [2018-11-28 11:05:34,134 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:05:34,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:34,134 INFO L82 PathProgramCache]: Analyzing trace with hash 370948975, now seen corresponding path program 7 times [2018-11-28 11:05:34,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:34,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:34,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:34,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:05:34,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:34,509 WARN L180 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 114 [2018-11-28 11:05:34,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-28 11:05:34,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2018-11-28 11:05:34,597 INFO L87 Difference]: Start difference. First operand 206 states and 259 transitions. cyclomatic complexity: 61 Second operand 27 states. [2018-11-28 11:05:36,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:05:36,626 INFO L93 Difference]: Finished difference Result 417 states and 528 transitions. [2018-11-28 11:05:36,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-28 11:05:36,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 417 states and 528 transitions. [2018-11-28 11:05:36,628 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 103 [2018-11-28 11:05:36,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 417 states to 413 states and 524 transitions. [2018-11-28 11:05:36,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 267 [2018-11-28 11:05:36,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 267 [2018-11-28 11:05:36,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 413 states and 524 transitions. [2018-11-28 11:05:36,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:05:36,630 INFO L705 BuchiCegarLoop]: Abstraction has 413 states and 524 transitions. [2018-11-28 11:05:36,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states and 524 transitions. [2018-11-28 11:05:36,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 311. [2018-11-28 11:05:36,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-11-28 11:05:36,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 403 transitions. [2018-11-28 11:05:36,637 INFO L728 BuchiCegarLoop]: Abstraction has 311 states and 403 transitions. [2018-11-28 11:05:36,637 INFO L608 BuchiCegarLoop]: Abstraction has 311 states and 403 transitions. [2018-11-28 11:05:36,637 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-28 11:05:36,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 311 states and 403 transitions. [2018-11-28 11:05:36,638 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 82 [2018-11-28 11:05:36,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:05:36,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:05:36,639 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:05:36,639 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2018-11-28 11:05:36,639 INFO L794 eck$LassoCheckResult]: Stem: 9842#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9839#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 9816#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 9817#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 9825#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9840#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9841#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9837#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9838#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9853#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9852#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9850#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9851#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9848#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9847#L545-3 assume !(lis_~i~0 < lis_~N); 9849#L545-4 lis_~i~0 := 1; 9863#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9862#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9860#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 9859#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9858#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9857#L548-3 assume !(lis_~j~0 < lis_~i~0); 9854#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 9856#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9971#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9969#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 9970#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10064#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10063#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10062#L549 assume !lis_#t~short11; 10061#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 10060#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10014#L548-3 assume !(lis_~j~0 < lis_~i~0); 10015#L547-2 [2018-11-28 11:05:36,640 INFO L796 eck$LassoCheckResult]: Loop: 10015#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 10007#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 10008#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10003#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 10000#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10001#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9996#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9997#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 9990#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9991#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10057#L548-3 assume !(lis_~j~0 < lis_~i~0); 10015#L547-2 [2018-11-28 11:05:36,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:36,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1848078906, now seen corresponding path program 6 times [2018-11-28 11:05:36,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:36,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:36,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:36,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:05:36,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:36,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:36,697 INFO L82 PathProgramCache]: Analyzing trace with hash 370948975, now seen corresponding path program 8 times [2018-11-28 11:05:36,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:36,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:36,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:36,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:05:36,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:36,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:36,708 INFO L82 PathProgramCache]: Analyzing trace with hash -339256426, now seen corresponding path program 7 times [2018-11-28 11:05:36,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:36,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:36,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:36,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:05:36,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:05:36,810 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 31 proven. 27 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-28 11:05:36,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:05:36,810 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:05:36,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:05:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:05:36,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:05:36,910 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 49 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-28 11:05:36,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:05:36,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-11-28 11:05:37,297 WARN L180 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 112 [2018-11-28 11:05:37,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 11:05:37,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-11-28 11:05:37,383 INFO L87 Difference]: Start difference. First operand 311 states and 403 transitions. cyclomatic complexity: 102 Second operand 17 states. [2018-11-28 11:05:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:05:37,586 INFO L93 Difference]: Finished difference Result 359 states and 456 transitions. [2018-11-28 11:05:37,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 11:05:37,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 359 states and 456 transitions. [2018-11-28 11:05:37,588 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 127 [2018-11-28 11:05:37,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 359 states to 309 states and 394 transitions. [2018-11-28 11:05:37,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2018-11-28 11:05:37,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 299 [2018-11-28 11:05:37,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 309 states and 394 transitions. [2018-11-28 11:05:37,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:05:37,590 INFO L705 BuchiCegarLoop]: Abstraction has 309 states and 394 transitions. [2018-11-28 11:05:37,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states and 394 transitions. [2018-11-28 11:05:37,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 183. [2018-11-28 11:05:37,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-28 11:05:37,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 223 transitions. [2018-11-28 11:05:37,594 INFO L728 BuchiCegarLoop]: Abstraction has 183 states and 223 transitions. [2018-11-28 11:05:37,594 INFO L608 BuchiCegarLoop]: Abstraction has 183 states and 223 transitions. [2018-11-28 11:05:37,595 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-28 11:05:37,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 223 transitions. [2018-11-28 11:05:37,595 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 66 [2018-11-28 11:05:37,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:05:37,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:05:37,596 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:05:37,596 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 1, 1, 1] [2018-11-28 11:05:37,596 INFO L794 eck$LassoCheckResult]: Stem: 10673#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10670#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 10657#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 10658#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 10662#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10671#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 10672#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10668#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 10669#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10683#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 10682#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10680#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 10681#L545-3 assume !(lis_~i~0 < lis_~N); 10674#L545-4 lis_~i~0 := 1; 10675#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 10715#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10716#L549 assume !lis_#t~short11; 10710#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 10709#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10708#L548-3 assume !(lis_~j~0 < lis_~i~0); 10707#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 10706#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 10705#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10703#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 10704#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10750#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10748#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10743#L549 assume !lis_#t~short11; 10744#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 10802#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10684#L548-3 assume !(lis_~j~0 < lis_~i~0); 10664#L547-2 [2018-11-28 11:05:37,596 INFO L796 eck$LassoCheckResult]: Loop: 10664#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 10665#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 10800#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10799#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 10797#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10796#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10795#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10792#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 10790#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10789#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10788#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10736#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 10786#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10772#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10735#L548-3 assume !(lis_~j~0 < lis_~i~0); 10664#L547-2 [2018-11-28 11:05:37,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:37,597 INFO L82 PathProgramCache]: Analyzing trace with hash -2081786852, now seen corresponding path program 8 times [2018-11-28 11:05:37,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:37,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:37,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:37,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:05:37,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:05:38,239 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 11:05:38,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:05:38,239 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:05:38,252 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:05:38,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:05:38,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:05:38,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:05:38,289 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-28 11:05:38,307 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,307 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,308 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 13 [2018-11-28 11:05:38,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:38,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:38,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:38,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:25 [2018-11-28 11:05:38,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-28 11:05:38,347 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 11:05:38,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:38,354 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2018-11-28 11:05:38,360 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-11-28 11:05:38,360 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:38,366 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:38,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:38,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:38,382 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:64, output treesize:43 [2018-11-28 11:05:38,434 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,435 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 63 [2018-11-28 11:05:38,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,453 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 58 [2018-11-28 11:05:38,454 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:05:38,471 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,472 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,474 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 59 [2018-11-28 11:05:38,479 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,482 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,488 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 66 [2018-11-28 11:05:38,489 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:05:38,504 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:38,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:38,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:38,521 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:74, output treesize:57 [2018-11-28 11:05:38,573 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,574 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,575 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 79 [2018-11-28 11:05:38,580 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,582 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,585 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,586 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,594 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 89 [2018-11-28 11:05:38,595 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:05:38,626 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,627 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,629 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 75 [2018-11-28 11:05:38,632 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,634 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,636 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,639 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,640 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,640 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,647 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 121 [2018-11-28 11:05:38,648 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:05:38,676 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:38,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:38,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:38,696 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:92, output treesize:75 [2018-11-28 11:05:38,762 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,762 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 89 [2018-11-28 11:05:38,768 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,771 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,771 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,772 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,773 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,774 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,774 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,786 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 112 [2018-11-28 11:05:38,787 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:05:38,816 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,818 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,820 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 85 [2018-11-28 11:05:38,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,828 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,829 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,830 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,830 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,831 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,832 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,835 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,836 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,836 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,837 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,838 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,838 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:38,848 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 184 [2018-11-28 11:05:38,850 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:05:38,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:38,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:38,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:38,917 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:86 [2018-11-28 11:05:39,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,390 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,392 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,394 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,396 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,397 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,398 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 175 [2018-11-28 11:05:39,407 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,408 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,420 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,425 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:05:39,426 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,427 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:05:39,464 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 11 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 16 case distinctions, treesize of input 80 treesize of output 169 [2018-11-28 11:05:39,468 INFO L267 ElimStorePlain]: Start of recursive call 3: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 9 xjuncts. [2018-11-28 11:05:39,740 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,742 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,746 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,748 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,749 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,750 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 185 [2018-11-28 11:05:39,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,758 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,760 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,761 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,763 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:05:39,769 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,771 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,771 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,778 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,782 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,795 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 183 [2018-11-28 11:05:39,798 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-28 11:05:39,933 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-28 11:05:39,936 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,937 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,938 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,939 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,942 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,943 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,945 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,946 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 186 [2018-11-28 11:05:39,966 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,978 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,980 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,985 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:39,990 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:05:40,013 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,017 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,020 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,034 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,055 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 183 [2018-11-28 11:05:40,058 INFO L267 ElimStorePlain]: Start of recursive call 7: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-28 11:05:40,201 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-28 11:05:40,204 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,205 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,206 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,207 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,208 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,211 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,212 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,213 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 195 [2018-11-28 11:05:40,226 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,227 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,228 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,242 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,243 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,245 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,246 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,248 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:05:40,277 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,278 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,279 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,287 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,290 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,308 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 19 disjoint index pairs (out of 28 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 83 treesize of output 209 [2018-11-28 11:05:40,311 INFO L267 ElimStorePlain]: Start of recursive call 9: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-28 11:05:40,482 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-28 11:05:40,487 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,490 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,491 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,493 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,494 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,495 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,496 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 202 [2018-11-28 11:05:40,505 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,508 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,509 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,515 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:05:40,517 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,521 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,529 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,531 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,534 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,545 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,550 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,556 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,576 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 20 disjoint index pairs (out of 28 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 83 treesize of output 217 [2018-11-28 11:05:40,578 INFO L267 ElimStorePlain]: Start of recursive call 11: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-28 11:05:40,747 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-28 11:05:40,750 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,751 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,754 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,757 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,758 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,760 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,761 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 169 [2018-11-28 11:05:40,766 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,769 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:05:40,772 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,776 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,781 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,784 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,786 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,789 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,814 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 179 [2018-11-28 11:05:40,816 INFO L267 ElimStorePlain]: Start of recursive call 13: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-28 11:05:40,946 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-28 11:05:40,950 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,951 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,952 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,954 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,955 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,959 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,960 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 196 [2018-11-28 11:05:40,968 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,970 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,971 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,974 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,981 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:05:40,983 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,984 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,995 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,996 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:40,998 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:41,005 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:41,008 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:41,036 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 19 disjoint index pairs (out of 28 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 83 treesize of output 205 [2018-11-28 11:05:41,038 INFO L267 ElimStorePlain]: Start of recursive call 15: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-28 11:05:41,211 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-28 11:05:41,214 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:41,215 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:41,216 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:41,217 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:41,218 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:41,219 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:41,220 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:41,221 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:41,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 203 [2018-11-28 11:05:41,227 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:41,230 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:41,231 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:41,233 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:41,234 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:05:41,236 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:41,241 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:41,243 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:41,246 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:41,246 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:41,254 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:41,260 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:41,262 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:41,278 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 20 disjoint index pairs (out of 28 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 83 treesize of output 217 [2018-11-28 11:05:41,280 INFO L267 ElimStorePlain]: Start of recursive call 17: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-28 11:05:41,422 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-28 11:05:42,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 65 dim-0 vars, and 21 xjuncts. [2018-11-28 11:05:43,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 107 dim-0 vars, and 21 xjuncts. [2018-11-28 11:05:43,040 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 3 variables, input treesize:149, output treesize:3653 [2018-11-28 11:05:46,732 WARN L180 SmtUtils]: Spent 3.35 s on a formula simplification. DAG size of input: 975 DAG size of output: 67 [2018-11-28 11:05:46,823 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:05:46,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:05:46,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 37 [2018-11-28 11:05:46,843 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:05:46,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:46,844 INFO L82 PathProgramCache]: Analyzing trace with hash -304943832, now seen corresponding path program 9 times [2018-11-28 11:05:46,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:46,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:46,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:46,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:05:46,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:48,064 WARN L180 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 195 DAG size of output: 145 [2018-11-28 11:05:48,313 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-11-28 11:05:48,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-28 11:05:48,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1111, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 11:05:48,314 INFO L87 Difference]: Start difference. First operand 183 states and 223 transitions. cyclomatic complexity: 45 Second operand 37 states. [2018-11-28 11:05:54,452 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2018-11-28 11:05:54,641 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2018-11-28 11:05:54,954 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2018-11-28 11:05:55,974 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 86 [2018-11-28 11:05:56,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:05:56,112 INFO L93 Difference]: Finished difference Result 408 states and 524 transitions. [2018-11-28 11:05:56,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-11-28 11:05:56,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 408 states and 524 transitions. [2018-11-28 11:05:56,114 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 234 [2018-11-28 11:05:56,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 408 states to 408 states and 524 transitions. [2018-11-28 11:05:56,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 395 [2018-11-28 11:05:56,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 395 [2018-11-28 11:05:56,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 408 states and 524 transitions. [2018-11-28 11:05:56,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:05:56,117 INFO L705 BuchiCegarLoop]: Abstraction has 408 states and 524 transitions. [2018-11-28 11:05:56,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states and 524 transitions. [2018-11-28 11:05:56,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 204. [2018-11-28 11:05:56,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-28 11:05:56,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 247 transitions. [2018-11-28 11:05:56,123 INFO L728 BuchiCegarLoop]: Abstraction has 204 states and 247 transitions. [2018-11-28 11:05:56,123 INFO L608 BuchiCegarLoop]: Abstraction has 204 states and 247 transitions. [2018-11-28 11:05:56,123 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-28 11:05:56,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 204 states and 247 transitions. [2018-11-28 11:05:56,124 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 70 [2018-11-28 11:05:56,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:05:56,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:05:56,125 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:05:56,125 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-11-28 11:05:56,127 INFO L794 eck$LassoCheckResult]: Stem: 11577#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11573#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 11560#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 11561#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 11565#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 11574#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 11584#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 11582#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 11583#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 11585#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 11575#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 11576#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 11711#L545-3 assume !(lis_~i~0 < lis_~N); 11578#L545-4 lis_~i~0 := 1; 11579#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 11597#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11598#L549 assume !lis_#t~short11; 11631#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 11630#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11629#L548-3 assume !(lis_~j~0 < lis_~i~0); 11628#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 11627#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 11626#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11624#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 11625#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 11661#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11660#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11657#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 11591#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 11590#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11586#L548-3 assume !(lis_~j~0 < lis_~i~0); 11567#L547-2 [2018-11-28 11:05:56,127 INFO L796 eck$LassoCheckResult]: Loop: 11567#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 11568#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 11745#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11744#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 11742#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 11741#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11740#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11728#L549 assume !lis_#t~short11; 11687#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 11686#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11723#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11680#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 11721#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 11682#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11679#L548-3 assume !(lis_~j~0 < lis_~i~0); 11567#L547-2 [2018-11-28 11:05:56,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:56,128 INFO L82 PathProgramCache]: Analyzing trace with hash -2081846434, now seen corresponding path program 9 times [2018-11-28 11:05:56,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:56,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:56,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:56,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:05:56,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:56,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:56,171 INFO L82 PathProgramCache]: Analyzing trace with hash 660716904, now seen corresponding path program 4 times [2018-11-28 11:05:56,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:56,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:56,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:56,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:05:56,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:56,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:56,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1506700395, now seen corresponding path program 10 times [2018-11-28 11:05:56,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:56,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:56,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:56,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:05:56,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:05:57,906 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 21 proven. 76 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 11:05:57,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:05:57,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:05:57,917 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 11:05:57,949 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 11:05:57,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:05:57,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:05:57,958 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:57,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-28 11:05:57,976 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:57,981 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:57,982 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 13 [2018-11-28 11:05:57,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:57,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:57,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:57,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-11-28 11:05:58,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 53 [2018-11-28 11:05:58,171 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:58,177 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 2 case distinctions, treesize of input 20 treesize of output 43 [2018-11-28 11:05:58,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:05:58,195 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 0 case distinctions, treesize of input 50 treesize of output 59 [2018-11-28 11:05:58,199 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 11:05:58,199 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:58,218 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:58,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-11-28 11:05:58,229 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 11:05:58,230 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:58,237 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:58,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:05:58,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:05:58,273 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:85, output treesize:93 [2018-11-28 11:05:58,694 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2018-11-28 11:05:58,834 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 110 [2018-11-28 11:05:58,842 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:58,844 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:58,850 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:58,852 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:58,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 147 [2018-11-28 11:05:58,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-11-28 11:05:58,938 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 0 case distinctions, treesize of input 102 treesize of output 109 [2018-11-28 11:05:58,941 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:05:58,942 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 31 treesize of output 35 [2018-11-28 11:05:58,943 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:58,956 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:58,968 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 0 case distinctions, treesize of input 100 treesize of output 107 [2018-11-28 11:05:58,980 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 2 case distinctions, treesize of input 40 treesize of output 56 [2018-11-28 11:05:58,981 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:05:58,999 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:59,009 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 0 case distinctions, treesize of input 110 treesize of output 115 [2018-11-28 11:05:59,012 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:59,013 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:59,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 75 [2018-11-28 11:05:59,014 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:59,041 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:05:59,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:05:59,182 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 100 [2018-11-28 11:05:59,185 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:59,186 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:05:59,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 56 [2018-11-28 11:05:59,187 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 11:05:59,214 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 0 case distinctions, treesize of input 82 treesize of output 89 [2018-11-28 11:05:59,222 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 35 [2018-11-28 11:05:59,222 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-28 11:05:59,240 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:05:59,264 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:05:59,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 2 dim-2 vars, End of recursive call: 19 dim-0 vars, and 4 xjuncts. [2018-11-28 11:05:59,330 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:259, output treesize:388 [2018-11-28 11:06:27,998 WARN L180 SmtUtils]: Spent 28.58 s on a formula simplification. DAG size of input: 141 DAG size of output: 46 [2018-11-28 11:06:28,078 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 58 proven. 20 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-28 11:06:28,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:06:28,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14] total 34 [2018-11-28 11:06:28,544 WARN L180 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 126 [2018-11-28 11:06:28,648 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2018-11-28 11:06:28,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-28 11:06:28,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1021, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 11:06:28,649 INFO L87 Difference]: Start difference. First operand 204 states and 247 transitions. cyclomatic complexity: 49 Second operand 34 states. [2018-11-28 11:06:40,898 WARN L180 SmtUtils]: Spent 12.07 s on a formula simplification. DAG size of input: 55 DAG size of output: 31 [2018-11-28 11:06:41,967 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 69 [2018-11-28 11:06:42,397 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2018-11-28 11:06:42,639 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2018-11-28 11:06:43,438 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2018-11-28 11:06:43,647 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2018-11-28 11:06:43,923 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2018-11-28 11:06:44,289 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 73 [2018-11-28 11:06:44,647 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 96 [2018-11-28 11:06:44,821 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 77 [2018-11-28 11:06:45,529 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 92 [2018-11-28 11:06:45,696 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 73 [2018-11-28 11:06:46,218 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2018-11-28 11:06:46,599 WARN L180 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 94 [2018-11-28 11:06:46,788 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 76 [2018-11-28 11:06:46,974 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2018-11-28 11:06:47,335 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 101 [2018-11-28 11:06:47,536 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 76 [2018-11-28 11:06:47,863 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 74 [2018-11-28 11:06:48,218 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 97 [2018-11-28 11:06:48,725 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 82 [2018-11-28 11:06:49,227 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 93 [2018-11-28 11:06:49,597 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 89 [2018-11-28 11:06:49,861 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 84 [2018-11-28 11:06:50,209 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 112 [2018-11-28 11:06:50,455 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 80 [2018-11-28 11:06:50,681 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2018-11-28 11:06:50,959 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 117 [2018-11-28 11:06:51,350 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 103 [2018-11-28 11:06:51,702 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2018-11-28 11:06:51,993 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 118 [2018-11-28 11:06:52,430 WARN L180 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 109 [2018-11-28 11:06:52,771 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2018-11-28 11:06:53,265 WARN L180 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 110 [2018-11-28 11:06:53,565 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 84 [2018-11-28 11:06:53,951 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2018-11-28 11:06:54,618 WARN L180 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 108 [2018-11-28 11:06:54,873 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 75 [2018-11-28 11:06:55,104 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 80 [2018-11-28 11:06:55,461 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 98 [2018-11-28 11:06:55,847 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 103 [2018-11-28 11:06:56,063 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 74 [2018-11-28 11:06:56,297 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 77 [2018-11-28 11:06:56,655 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 97 [2018-11-28 11:06:57,027 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 100 [2018-11-28 11:06:57,397 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 76 [2018-11-28 11:06:57,786 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 99 [2018-11-28 11:06:58,258 WARN L180 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 94 [2018-11-28 11:06:58,488 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 75 [2018-11-28 11:06:58,912 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 98 [2018-11-28 11:06:59,322 WARN L180 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 107 [2018-11-28 11:06:59,715 WARN L180 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 103 [2018-11-28 11:07:00,040 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 95 [2018-11-28 11:07:00,426 WARN L180 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2018-11-28 11:07:00,591 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2018-11-28 11:07:00,896 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 70 [2018-11-28 11:07:01,252 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 92 [2018-11-28 11:07:01,424 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 60 [2018-11-28 11:07:01,665 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 100 [2018-11-28 11:07:01,903 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 93 [2018-11-28 11:07:02,157 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 94 [2018-11-28 11:07:02,418 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 75 [2018-11-28 11:07:02,829 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 82 [2018-11-28 11:07:03,045 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 78 [2018-11-28 11:07:03,772 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 84 [2018-11-28 11:07:04,098 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 90 [2018-11-28 11:07:04,429 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 91 [2018-11-28 11:07:04,753 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 89 [2018-11-28 11:07:05,012 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 79 [2018-11-28 11:07:05,278 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 84 [2018-11-28 11:07:05,567 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 78 [2018-11-28 11:07:05,843 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 81 [2018-11-28 11:07:06,085 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 80 [2018-11-28 11:07:06,355 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 79 [2018-11-28 11:07:06,653 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 88 [2018-11-28 11:07:06,939 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 84 [2018-11-28 11:07:06,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:07:06,952 INFO L93 Difference]: Finished difference Result 421 states and 523 transitions. [2018-11-28 11:07:06,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-11-28 11:07:06,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 421 states and 523 transitions. [2018-11-28 11:07:06,954 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 204 [2018-11-28 11:07:06,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 421 states to 421 states and 523 transitions. [2018-11-28 11:07:06,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 410 [2018-11-28 11:07:06,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 410 [2018-11-28 11:07:06,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 421 states and 523 transitions. [2018-11-28 11:07:06,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:07:06,956 INFO L705 BuchiCegarLoop]: Abstraction has 421 states and 523 transitions. [2018-11-28 11:07:06,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states and 523 transitions. [2018-11-28 11:07:06,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 360. [2018-11-28 11:07:06,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-11-28 11:07:06,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 445 transitions. [2018-11-28 11:07:06,961 INFO L728 BuchiCegarLoop]: Abstraction has 360 states and 445 transitions. [2018-11-28 11:07:06,961 INFO L608 BuchiCegarLoop]: Abstraction has 360 states and 445 transitions. [2018-11-28 11:07:06,961 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-28 11:07:06,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 360 states and 445 transitions. [2018-11-28 11:07:06,962 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 171 [2018-11-28 11:07:06,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:07:06,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:07:06,963 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:07:06,963 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 1, 1, 1, 1] [2018-11-28 11:07:06,963 INFO L794 eck$LassoCheckResult]: Stem: 12606#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12602#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 12589#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 12590#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 12594#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 12603#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 12613#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 12600#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 12601#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 12614#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 12604#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 12605#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 12609#L545-3 assume !(lis_~i~0 < lis_~N); 12611#L545-4 lis_~i~0 := 1; 12687#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 12688#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12682#L549 assume !lis_#t~short11; 12684#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 12678#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12679#L548-3 assume !(lis_~j~0 < lis_~i~0); 12674#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 12675#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 12670#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12671#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 12755#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 12754#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12753#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12752#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 12751#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 12749#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12748#L548-3 assume !(lis_~j~0 < lis_~i~0); 12743#L547-2 [2018-11-28 11:07:06,963 INFO L796 eck$LassoCheckResult]: Loop: 12743#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 12742#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 12741#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12739#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 12740#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 12729#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12730#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12725#L549 assume !lis_#t~short11; 12723#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 12724#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12719#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12720#L549 assume !lis_#t~short11; 12760#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 12757#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12746#L548-3 assume !(lis_~j~0 < lis_~i~0); 12743#L547-2 [2018-11-28 11:07:06,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:07:06,964 INFO L82 PathProgramCache]: Analyzing trace with hash -2081846434, now seen corresponding path program 11 times [2018-11-28 11:07:06,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:07:06,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:07:06,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:07:06,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:07:06,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:07:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:07:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:07:06,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:07:06,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1361842986, now seen corresponding path program 1 times [2018-11-28 11:07:06,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:07:06,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:07:06,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:07:06,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:07:06,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:07:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:07:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:07:07,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:07:07,004 INFO L82 PathProgramCache]: Analyzing trace with hash -2087140819, now seen corresponding path program 12 times [2018-11-28 11:07:07,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:07:07,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:07:07,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:07:07,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:07:07,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:07:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:07:07,814 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 27 proven. 73 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:07:07,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:07:07,814 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:07:07,822 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 11:07:07,855 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-11-28 11:07:07,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:07:07,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:07:07,867 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:07,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-28 11:07:07,878 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:07,878 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:07,879 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 13 [2018-11-28 11:07:07,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:07:07,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:07:07,886 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-28 11:07:07,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-11-28 11:07:07,903 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-28 11:07:07,905 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 11:07:07,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:07:07,912 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-28 11:07:07,913 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 11:07:07,913 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:07:07,918 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:07:07,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:07:07,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:07:07,927 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2018-11-28 11:07:07,971 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 0 case distinctions, treesize of input 54 treesize of output 44 [2018-11-28 11:07:07,973 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:07,974 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-28 11:07:07,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:07:07,985 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-28 11:07:07,987 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:07,987 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:07,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 35 [2018-11-28 11:07:07,988 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:07:07,995 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:07:08,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:07:08,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:07:08,007 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:64, output treesize:47 [2018-11-28 11:07:08,060 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 0 case distinctions, treesize of input 72 treesize of output 60 [2018-11-28 11:07:08,063 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,063 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,064 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,065 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-28 11:07:08,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:07:08,081 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 56 [2018-11-28 11:07:08,084 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,084 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,085 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,086 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,087 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,088 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 84 [2018-11-28 11:07:08,088 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:07:08,104 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:07:08,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:07:08,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:07:08,123 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:82, output treesize:65 [2018-11-28 11:07:08,207 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 0 case distinctions, treesize of input 90 treesize of output 76 [2018-11-28 11:07:08,211 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,212 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,213 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,214 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,215 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,216 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2018-11-28 11:07:08,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:07:08,244 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 72 [2018-11-28 11:07:08,247 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,247 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,248 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,249 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,250 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,250 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,251 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,252 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,253 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,254 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,254 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,255 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 157 [2018-11-28 11:07:08,256 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:07:08,282 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:07:08,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:07:08,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:07:08,306 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:100, output treesize:83 [2018-11-28 11:07:08,594 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 110 [2018-11-28 11:07:08,599 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,600 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:07:08,601 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,602 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,602 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,603 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,604 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 110 [2018-11-28 11:07:08,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:07:08,634 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 95 [2018-11-28 11:07:08,639 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,641 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,641 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,642 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,643 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,644 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,645 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,645 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:07:08,646 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,647 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,648 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,649 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,650 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:08,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 172 [2018-11-28 11:07:08,652 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:07:08,679 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:07:08,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:07:08,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:07:08,704 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:130, output treesize:89 [2018-11-28 11:07:08,906 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 43 proven. 47 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 11:07:08,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:07:08,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 39 [2018-11-28 11:07:09,073 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 92 [2018-11-28 11:07:09,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-28 11:07:09,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-11-28 11:07:09,101 INFO L87 Difference]: Start difference. First operand 360 states and 445 transitions. cyclomatic complexity: 97 Second operand 39 states. [2018-11-28 11:07:14,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:07:14,416 INFO L93 Difference]: Finished difference Result 647 states and 799 transitions. [2018-11-28 11:07:14,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-11-28 11:07:14,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 647 states and 799 transitions. [2018-11-28 11:07:14,418 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 220 [2018-11-28 11:07:14,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 647 states to 594 states and 739 transitions. [2018-11-28 11:07:14,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 583 [2018-11-28 11:07:14,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 583 [2018-11-28 11:07:14,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 594 states and 739 transitions. [2018-11-28 11:07:14,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:07:14,422 INFO L705 BuchiCegarLoop]: Abstraction has 594 states and 739 transitions. [2018-11-28 11:07:14,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states and 739 transitions. [2018-11-28 11:07:14,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 465. [2018-11-28 11:07:14,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-11-28 11:07:14,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 579 transitions. [2018-11-28 11:07:14,431 INFO L728 BuchiCegarLoop]: Abstraction has 465 states and 579 transitions. [2018-11-28 11:07:14,431 INFO L608 BuchiCegarLoop]: Abstraction has 465 states and 579 transitions. [2018-11-28 11:07:14,431 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-28 11:07:14,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 465 states and 579 transitions. [2018-11-28 11:07:14,432 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 187 [2018-11-28 11:07:14,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:07:14,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:07:14,433 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:07:14,433 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 1, 1, 1, 1] [2018-11-28 11:07:14,433 INFO L794 eck$LassoCheckResult]: Stem: 13934#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13930#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 13917#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 13918#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 13922#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 13931#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 13942#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 13928#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 13929#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 13943#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 13932#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 13933#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 13941#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 13939#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 13938#L545-3 assume !(lis_~i~0 < lis_~N); 13940#L545-4 lis_~i~0 := 1; 14016#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 14017#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 14012#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 14013#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 14033#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14034#L548-3 assume !(lis_~j~0 < lis_~i~0); 14028#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 14029#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 14101#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 14099#L549 assume !lis_#t~short11; 14100#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 14194#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14193#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 14192#L549 assume !lis_#t~short11; 14191#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 14190#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14189#L548-3 assume !(lis_~j~0 < lis_~i~0); 14186#L547-2 [2018-11-28 11:07:14,433 INFO L796 eck$LassoCheckResult]: Loop: 14186#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 14185#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 14184#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 14182#L549 assume !lis_#t~short11; 14180#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 14181#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14163#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 14164#L549 assume !lis_#t~short11; 14203#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 14200#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14199#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 14188#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 14196#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 14195#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14187#L548-3 assume !(lis_~j~0 < lis_~i~0); 14186#L547-2 [2018-11-28 11:07:14,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:07:14,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1481227654, now seen corresponding path program 13 times [2018-11-28 11:07:14,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:07:14,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:07:14,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:07:14,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:07:14,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:07:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:07:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:07:14,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:07:14,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1619948842, now seen corresponding path program 2 times [2018-11-28 11:07:14,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:07:14,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:07:14,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:07:14,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:07:14,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:07:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:07:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:07:14,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:07:14,478 INFO L82 PathProgramCache]: Analyzing trace with hash -818032239, now seen corresponding path program 14 times [2018-11-28 11:07:14,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:07:14,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:07:14,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:07:14,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:07:14,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:07:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:07:15,177 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 1 proven. 103 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 11:07:15,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:07:15,177 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:07:15,187 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:07:15,211 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:07:15,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:07:15,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:07:15,230 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-28 11:07:15,243 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,243 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,244 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 13 [2018-11-28 11:07:15,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:07:15,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:07:15,253 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-28 11:07:15,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-11-28 11:07:15,299 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-28 11:07:15,301 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 11:07:15,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:07:15,307 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-28 11:07:15,309 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 11:07:15,309 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:07:15,313 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:07:15,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:07:15,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:07:15,321 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2018-11-28 11:07:15,371 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 0 case distinctions, treesize of input 58 treesize of output 48 [2018-11-28 11:07:15,374 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,375 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-11-28 11:07:15,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:07:15,388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-11-28 11:07:15,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 41 [2018-11-28 11:07:15,392 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:07:15,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:07:15,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:07:15,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:07:15,415 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:68, output treesize:51 [2018-11-28 11:07:15,483 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 0 case distinctions, treesize of input 76 treesize of output 64 [2018-11-28 11:07:15,486 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,486 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,487 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,488 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-11-28 11:07:15,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:07:15,506 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2018-11-28 11:07:15,508 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,509 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,510 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,510 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,512 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 94 [2018-11-28 11:07:15,513 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:07:15,527 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:07:15,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:07:15,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:07:15,546 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:86, output treesize:69 [2018-11-28 11:07:15,633 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 0 case distinctions, treesize of input 118 treesize of output 92 [2018-11-28 11:07:15,641 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,642 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,642 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,643 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,644 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,645 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,649 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 132 [2018-11-28 11:07:15,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:07:15,713 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 80 [2018-11-28 11:07:15,715 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,716 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,717 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,718 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,718 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,720 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,721 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,722 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,723 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,723 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 185 [2018-11-28 11:07:15,725 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:07:15,754 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:07:15,760 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 90 [2018-11-28 11:07:15,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,765 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,766 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,767 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,767 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,768 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,769 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,771 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:07:15,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 153 [2018-11-28 11:07:15,774 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:07:15,797 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:07:15,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:07:15,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-11-28 11:07:15,859 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:131, output treesize:189 [2018-11-28 11:07:16,601 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 13 proven. 91 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 11:07:16,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:07:16,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 37 [2018-11-28 11:07:16,761 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 92 [2018-11-28 11:07:16,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-28 11:07:16,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1201, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 11:07:16,784 INFO L87 Difference]: Start difference. First operand 465 states and 579 transitions. cyclomatic complexity: 130 Second operand 37 states. [2018-11-28 11:07:17,874 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2018-11-28 11:07:18,314 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 113 [2018-11-28 11:07:18,578 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 94 [2018-11-28 11:07:19,208 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 115 [2018-11-28 11:07:20,128 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 106 [2018-11-28 11:07:20,516 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 121 [2018-11-28 11:07:21,938 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 98 [2018-11-28 11:07:22,690 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 98 [2018-11-28 11:07:23,029 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 99 [2018-11-28 11:07:52,452 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 101 [2018-11-28 11:08:17,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:08:17,925 INFO L93 Difference]: Finished difference Result 1153 states and 1489 transitions. [2018-11-28 11:08:17,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-11-28 11:08:17,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1153 states and 1489 transitions. [2018-11-28 11:08:17,939 INFO L131 ngComponentsAnalysis]: Automaton has 47 accepting balls. 412 [2018-11-28 11:08:17,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1153 states to 1153 states and 1489 transitions. [2018-11-28 11:08:17,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1143 [2018-11-28 11:08:17,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1143 [2018-11-28 11:08:17,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1153 states and 1489 transitions. [2018-11-28 11:08:17,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:08:17,943 INFO L705 BuchiCegarLoop]: Abstraction has 1153 states and 1489 transitions. [2018-11-28 11:08:17,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states and 1489 transitions. [2018-11-28 11:08:17,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 982. [2018-11-28 11:08:17,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2018-11-28 11:08:17,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1286 transitions. [2018-11-28 11:08:17,957 INFO L728 BuchiCegarLoop]: Abstraction has 982 states and 1286 transitions. [2018-11-28 11:08:17,957 INFO L608 BuchiCegarLoop]: Abstraction has 982 states and 1286 transitions. [2018-11-28 11:08:17,957 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-28 11:08:17,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 982 states and 1286 transitions. [2018-11-28 11:08:17,960 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 339 [2018-11-28 11:08:17,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:08:17,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:08:17,960 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:08:17,960 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:08:17,961 INFO L794 eck$LassoCheckResult]: Stem: 15994#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 15991#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 15978#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 15979#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 15983#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 15992#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 15993#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 15989#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 15990#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 16004#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 16003#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 16001#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 16002#L545-3 assume !(lis_~i~0 < lis_~N); 15995#L545-4 lis_~i~0 := 1; 15996#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 16136#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 16134#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 16135#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 16152#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 16151#L548-3 assume !(lis_~j~0 < lis_~i~0); 16149#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 16150#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 16677#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 16676#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 16673#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 16671#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 16672#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 16660#L549 assume !lis_#t~short11; 16661#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 16596#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 16597#L548-3 assume !(lis_~j~0 < lis_~i~0); 15985#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 15986#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 16957#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 16935#L549 assume !lis_#t~short11; 15980#L549-2 [2018-11-28 11:08:17,961 INFO L796 eck$LassoCheckResult]: Loop: 15980#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 15981#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 15982#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 15984#L549 assume !lis_#t~short11; 15980#L549-2 [2018-11-28 11:08:17,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:08:17,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947736, now seen corresponding path program 15 times [2018-11-28 11:08:17,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:08:17,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:08:17,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:08:17,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:08:17,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:08:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:08:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:08:18,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:08:18,000 INFO L82 PathProgramCache]: Analyzing trace with hash 2464296, now seen corresponding path program 2 times [2018-11-28 11:08:18,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:08:18,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:08:18,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:08:18,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:08:18,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:08:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:08:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:08:18,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:08:18,003 INFO L82 PathProgramCache]: Analyzing trace with hash -126387441, now seen corresponding path program 16 times [2018-11-28 11:08:18,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:08:18,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:08:18,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:08:18,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:08:18,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:08:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:08:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:08:27,348 WARN L180 SmtUtils]: Spent 9.24 s on a formula simplification. DAG size of input: 377 DAG size of output: 259 [2018-11-28 11:08:29,439 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 174 [2018-11-28 11:08:29,442 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:08:29,442 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:08:29,442 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:08:29,442 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:08:29,442 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:08:29,442 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:08:29,442 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:08:29,442 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:08:29,442 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration24_Lasso [2018-11-28 11:08:29,442 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:08:29,443 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:08:29,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:08:29,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-28 11:08:29,448 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-28 11:08:29,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:08:29,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:08:29,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:08:29,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:08:29,452 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-28 11:08:29,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:08:29,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:08:29,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:08:29,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:08:31,891 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 126 [2018-11-28 11:08:31,990 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-28 11:08:31,991 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-28 11:08:31,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:08:31,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:08:31,994 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-28 11:08:31,994 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-28 11:08:32,253 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 78 [2018-11-28 11:08:32,513 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:08:32,513 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:08:32,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:08:32,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:08:32,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,515 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:08:32,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:08:32,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:08:32,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:08:32,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:08:32,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:08:32,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:08:32,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:08:32,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:08:32,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:08:32,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:08:32,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:08:32,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:08:32,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:08:32,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:08:32,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:08:32,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:08:32,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:08:32,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:08:32,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:08:32,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:08:32,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:08:32,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:08:32,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:08:32,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:08:32,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:08:32,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:08:32,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:08:32,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:08:32,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:08:32,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:08:32,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:08:32,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:08:32,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:08:32,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:08:32,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:08:32,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:08:32,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:08:32,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:08:32,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:08:32,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:08:32,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:08:32,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:08:32,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:08:32,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:08:32,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:08:32,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:08:32,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:08:32,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:08:32,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:08:32,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:08:32,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:08:32,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:08:32,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:08:32,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:08:32,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:08:32,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:08:32,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:08:32,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:08:32,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:08:32,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:08:32,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:08:32,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:08:32,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:08:32,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:08:32,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:08:32,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:08:32,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:08:32,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:08:32,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:08:32,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:08:32,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:08:32,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:08:32,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:08:32,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:08:32,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:08:32,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:08:32,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:08:32,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:08:32,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:08:32,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:08:32,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:08:32,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:08:32,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:08:32,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,538 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:08:32,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:08:32,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:08:32,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:08:32,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:08:32,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:08:32,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:08:32,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:08:32,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:08:32,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,542 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:08:32,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,543 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:08:32,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:08:32,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:08:32,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:08:32,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:08:32,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,546 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:08:32,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:08:32,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:08:32,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:08:32,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:08:32,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:08:32,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:08:32,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:08:32,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:08:32,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,550 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:08:32,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,551 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:08:32,551 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:08:32,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:08:32,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:08:32,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:08:32,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,555 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:08:32,555 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:08:32,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:08:32,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:08:32,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:08:32,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:08:32,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:08:32,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:08:32,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:08:32,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:08:32,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,560 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:08:32,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:08:32,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:08:32,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:08:32,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,562 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:08:32,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,563 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:08:32,563 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:08:32,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:08:32,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:08:32,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:08:32,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,567 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:08:32,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:08:32,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:08:32,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:08:32,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:08:32,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,570 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:08:32,570 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:08:32,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:08:32,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:08:32,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:08:32,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:08:32,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:08:32,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:08:32,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:08:32,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:08:32,592 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:08:32,611 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 11:08:32,611 INFO L444 ModelExtractionUtils]: 49 out of 58 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-28 11:08:32,612 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:08:32,612 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:08:32,613 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:08:32,613 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_~i~0) = -1*ULTIMATE.start_lis_~j~0 + 1*ULTIMATE.start_lis_~i~0 Supporting invariants [] [2018-11-28 11:08:33,140 INFO L297 tatePredicateManager]: 79 out of 79 supporting invariants were superfluous and have been removed [2018-11-28 11:08:33,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:08:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:08:33,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:08:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:08:33,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:08:33,209 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-28 11:08:33,209 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-28 11:08:33,209 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 982 states and 1286 transitions. cyclomatic complexity: 340 Second operand 5 states. [2018-11-28 11:08:33,236 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 982 states and 1286 transitions. cyclomatic complexity: 340. Second operand 5 states. Result 1262 states and 1656 transitions. Complement of second has 7 states. [2018-11-28 11:08:33,238 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-28 11:08:33,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 11:08:33,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-28 11:08:33,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 35 letters. Loop has 4 letters. [2018-11-28 11:08:33,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:08:33,239 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:08:33,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:08:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:08:33,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:08:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:08:33,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:08:33,296 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-28 11:08:33,296 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-28 11:08:33,296 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 982 states and 1286 transitions. cyclomatic complexity: 340 Second operand 5 states. [2018-11-28 11:08:33,347 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 982 states and 1286 transitions. cyclomatic complexity: 340. Second operand 5 states. Result 1275 states and 1671 transitions. Complement of second has 9 states. [2018-11-28 11:08:33,349 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-28 11:08:33,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 11:08:33,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2018-11-28 11:08:33,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 35 letters. Loop has 4 letters. [2018-11-28 11:08:33,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:08:33,350 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:08:33,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:08:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:08:33,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:08:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:08:33,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:08:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:08:33,440 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 11:08:33,440 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 982 states and 1286 transitions. cyclomatic complexity: 340 Second operand 5 states. [2018-11-28 11:08:33,506 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 982 states and 1286 transitions. cyclomatic complexity: 340. Second operand 5 states. Result 1952 states and 2630 transitions. Complement of second has 8 states. [2018-11-28 11:08:33,507 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-28 11:08:33,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 11:08:33,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2018-11-28 11:08:33,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 35 letters. Loop has 4 letters. [2018-11-28 11:08:33,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:08:33,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 39 letters. Loop has 4 letters. [2018-11-28 11:08:33,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:08:33,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 35 letters. Loop has 8 letters. [2018-11-28 11:08:33,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:08:33,508 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1952 states and 2630 transitions. [2018-11-28 11:08:33,517 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 458 [2018-11-28 11:08:33,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1952 states to 1503 states and 2058 transitions. [2018-11-28 11:08:33,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 867 [2018-11-28 11:08:33,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1021 [2018-11-28 11:08:33,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1503 states and 2058 transitions. [2018-11-28 11:08:33,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:08:33,527 INFO L705 BuchiCegarLoop]: Abstraction has 1503 states and 2058 transitions. [2018-11-28 11:08:33,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states and 2058 transitions. [2018-11-28 11:08:33,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1254. [2018-11-28 11:08:33,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1254 states. [2018-11-28 11:08:33,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1776 transitions. [2018-11-28 11:08:33,578 INFO L728 BuchiCegarLoop]: Abstraction has 1254 states and 1776 transitions. [2018-11-28 11:08:33,578 INFO L608 BuchiCegarLoop]: Abstraction has 1254 states and 1776 transitions. [2018-11-28 11:08:33,578 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-28 11:08:33,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1254 states and 1776 transitions. [2018-11-28 11:08:33,581 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 405 [2018-11-28 11:08:33,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:08:33,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:08:33,582 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:08:33,582 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:08:33,582 INFO L794 eck$LassoCheckResult]: Stem: 22185#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 22182#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 22165#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 22166#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 22174#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 22183#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 22184#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 22180#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 22181#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 22198#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 22197#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 22195#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 22196#L545-3 assume !(lis_~i~0 < lis_~N); 22186#L545-4 lis_~i~0 := 1; 22187#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 22260#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 22277#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 22276#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 22275#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 22274#L548-3 assume !(lis_~j~0 < lis_~i~0); 22272#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 22273#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 23040#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 23039#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 23037#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 23036#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 23035#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 23034#L549 assume !lis_#t~short11; 23030#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 23028#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 23027#L548-3 assume !(lis_~j~0 < lis_~i~0); 22178#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 22179#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 22175#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 22176#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 22188#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 22171#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 22172#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 23414#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 23413#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 23408#L548-2 [2018-11-28 11:08:33,582 INFO L796 eck$LassoCheckResult]: Loop: 23408#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 23412#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 23410#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 23407#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 23408#L548-2 [2018-11-28 11:08:33,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:08:33,583 INFO L82 PathProgramCache]: Analyzing trace with hash 317851267, now seen corresponding path program 17 times [2018-11-28 11:08:33,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:08:33,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:08:33,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:08:33,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:08:33,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:08:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:08:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:08:33,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:08:33,646 INFO L82 PathProgramCache]: Analyzing trace with hash 2511482, now seen corresponding path program 3 times [2018-11-28 11:08:33,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:08:33,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:08:33,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:08:33,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:08:33,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:08:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:08:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:08:33,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:08:33,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1513273348, now seen corresponding path program 18 times [2018-11-28 11:08:33,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:08:33,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:08:33,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:08:33,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:08:33,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:08:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:08:34,409 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 11:08:34,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:08:34,409 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:08:34,417 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 11:08:34,501 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-11-28 11:08:34,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:08:34,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:08:34,506 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 11 treesize of output 14 [2018-11-28 11:08:34,510 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:34,513 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:34,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:08:34,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:34,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:34,528 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-28 11:08:34,528 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-11-28 11:08:34,579 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 32 [2018-11-28 11:08:34,582 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:34,582 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:34,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 40 [2018-11-28 11:08:34,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:34,592 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-11-28 11:08:34,594 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 11:08:34,594 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:34,599 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:34,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:34,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:34,610 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:65, output treesize:42 [2018-11-28 11:08:34,689 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 0 case distinctions, treesize of input 76 treesize of output 56 [2018-11-28 11:08:34,691 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:34,692 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:34,693 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:34,694 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:34,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 71 [2018-11-28 11:08:34,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:34,712 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2018-11-28 11:08:34,714 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:34,715 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-11-28 11:08:34,715 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:34,723 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:34,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:34,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:34,741 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:89, output treesize:66 [2018-11-28 11:08:34,846 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 0 case distinctions, treesize of input 108 treesize of output 80 [2018-11-28 11:08:34,848 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:34,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:34,850 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:08:34,850 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:34,851 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:34,852 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:34,853 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:34,854 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:34,855 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:34,855 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:08:34,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 167 [2018-11-28 11:08:34,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:34,882 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 90 [2018-11-28 11:08:34,885 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:34,886 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:34,886 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:34,887 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-11-28 11:08:34,887 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:34,901 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:34,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:34,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:34,925 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:124, output treesize:105 [2018-11-28 11:08:35,008 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:35,009 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:35,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 176 [2018-11-28 11:08:35,013 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:35,015 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:35,016 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:35,017 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:35,018 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:35,019 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:35,019 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:08:35,021 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:35,022 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:35,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 262 [2018-11-28 11:08:35,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:35,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:35,074 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:35,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 124 [2018-11-28 11:08:35,080 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:35,081 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:35,097 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 99 treesize of output 122 [2018-11-28 11:08:35,098 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-28 11:08:35,157 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-28 11:08:35,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-28 11:08:35,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-28 11:08:35,260 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:179, output treesize:358 [2018-11-28 11:08:47,362 WARN L180 SmtUtils]: Spent 12.05 s on a formula simplification. DAG size of input: 88 DAG size of output: 43 [2018-11-28 11:08:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 11:08:47,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:08:47,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 33 [2018-11-28 11:08:47,615 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2018-11-28 11:08:47,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-28 11:08:47,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=992, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 11:08:47,652 INFO L87 Difference]: Start difference. First operand 1254 states and 1776 transitions. cyclomatic complexity: 570 Second operand 34 states. [2018-11-28 11:08:50,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:08:50,088 INFO L93 Difference]: Finished difference Result 1480 states and 2083 transitions. [2018-11-28 11:08:50,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-28 11:08:50,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1480 states and 2083 transitions. [2018-11-28 11:08:50,096 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 425 [2018-11-28 11:08:50,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1480 states to 1480 states and 2083 transitions. [2018-11-28 11:08:50,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1047 [2018-11-28 11:08:50,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1047 [2018-11-28 11:08:50,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1480 states and 2083 transitions. [2018-11-28 11:08:50,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:08:50,102 INFO L705 BuchiCegarLoop]: Abstraction has 1480 states and 2083 transitions. [2018-11-28 11:08:50,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states and 2083 transitions. [2018-11-28 11:08:50,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1354. [2018-11-28 11:08:50,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1354 states. [2018-11-28 11:08:50,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1905 transitions. [2018-11-28 11:08:50,124 INFO L728 BuchiCegarLoop]: Abstraction has 1354 states and 1905 transitions. [2018-11-28 11:08:50,124 INFO L608 BuchiCegarLoop]: Abstraction has 1354 states and 1905 transitions. [2018-11-28 11:08:50,124 INFO L442 BuchiCegarLoop]: ======== Iteration 26============ [2018-11-28 11:08:50,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1354 states and 1905 transitions. [2018-11-28 11:08:50,128 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 409 [2018-11-28 11:08:50,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:08:50,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:08:50,128 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 11:08:50,128 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:08:50,129 INFO L794 eck$LassoCheckResult]: Stem: 25157#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 25154#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 25135#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 25136#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 25145#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 25155#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 25156#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 25152#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 25153#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 25169#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 25168#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 25166#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 25167#L545-3 assume !(lis_~i~0 < lis_~N); 25158#L545-4 lis_~i~0 := 1; 25159#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 25229#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 25245#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 25244#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 25243#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 25242#L548-3 assume !(lis_~j~0 < lis_~i~0); 25239#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 25240#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 26468#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 26467#L549 assume !lis_#t~short11; 26465#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 26466#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 26485#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 26484#L549 assume !lis_#t~short11; 26483#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 25173#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 26482#L548-3 assume !(lis_~j~0 < lis_~i~0); 26481#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 25151#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 25146#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 25147#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 25160#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 25141#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 25142#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 26488#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 26469#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 25138#L548-2 [2018-11-28 11:08:50,129 INFO L796 eck$LassoCheckResult]: Loop: 25138#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 26487#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 26486#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 26470#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 25138#L548-2 [2018-11-28 11:08:50,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:08:50,129 INFO L82 PathProgramCache]: Analyzing trace with hash 2003402307, now seen corresponding path program 19 times [2018-11-28 11:08:50,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:08:50,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:08:50,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:08:50,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:08:50,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:08:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:08:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:08:50,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:08:50,186 INFO L82 PathProgramCache]: Analyzing trace with hash 2511482, now seen corresponding path program 4 times [2018-11-28 11:08:50,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:08:50,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:08:50,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:08:50,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:08:50,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:08:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:08:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:08:50,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:08:50,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1908219972, now seen corresponding path program 20 times [2018-11-28 11:08:50,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:08:50,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:08:50,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:08:50,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:08:50,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:08:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:08:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 11:08:51,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:08:51,826 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:08:51,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:08:51,866 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:08:51,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:08:51,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:08:51,871 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 11 treesize of output 14 [2018-11-28 11:08:51,877 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:51,878 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:51,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:08:51,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:51,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:51,892 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-28 11:08:51,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:11 [2018-11-28 11:08:51,939 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-28 11:08:51,941 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 11:08:51,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:51,949 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-28 11:08:51,951 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 11:08:51,951 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:51,957 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:51,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:51,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:51,967 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2018-11-28 11:08:52,024 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 0 case distinctions, treesize of input 58 treesize of output 48 [2018-11-28 11:08:52,027 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,027 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-11-28 11:08:52,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:52,040 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-11-28 11:08:52,042 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,043 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 41 [2018-11-28 11:08:52,044 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:52,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:52,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:52,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:52,067 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:68, output treesize:51 [2018-11-28 11:08:52,138 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 0 case distinctions, treesize of input 76 treesize of output 64 [2018-11-28 11:08:52,141 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,150 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,152 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,152 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-11-28 11:08:52,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:52,182 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2018-11-28 11:08:52,186 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,189 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,190 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,192 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,192 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,193 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 94 [2018-11-28 11:08:52,196 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:52,212 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:52,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:52,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:52,231 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:86, output treesize:69 [2018-11-28 11:08:52,528 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 101 [2018-11-28 11:08:52,534 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,534 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,535 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,537 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,537 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,538 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,543 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 107 [2018-11-28 11:08:52,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:52,571 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 84 [2018-11-28 11:08:52,575 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,576 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,576 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,577 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,578 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,579 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,580 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,580 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 108 [2018-11-28 11:08:52,581 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:52,601 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:52,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:52,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:52,623 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:123, output treesize:78 [2018-11-28 11:08:52,745 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 0 case distinctions, treesize of input 127 treesize of output 97 [2018-11-28 11:08:52,749 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,750 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,751 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,751 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:08:52,755 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,758 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,760 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,768 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,772 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,773 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,773 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:08:52,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 51 treesize of output 169 [2018-11-28 11:08:52,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2018-11-28 11:08:52,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 117 [2018-11-28 11:08:52,906 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,907 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,907 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,908 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,909 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:08:52,910 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,910 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 103 [2018-11-28 11:08:52,912 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:52,933 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:52,937 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 117 [2018-11-28 11:08:52,943 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,944 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,944 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:08:52,946 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,947 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 93 [2018-11-28 11:08:52,949 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:52,970 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:52,977 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 107 [2018-11-28 11:08:52,980 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,982 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,983 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,984 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,987 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,988 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,989 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,990 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:52,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 122 [2018-11-28 11:08:52,991 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:53,017 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:53,023 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 93 [2018-11-28 11:08:53,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:53,026 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:53,026 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:53,027 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:53,028 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:53,028 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:53,029 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:53,030 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:53,030 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:53,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 141 [2018-11-28 11:08:53,031 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:53,055 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:53,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-28 11:08:53,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-28 11:08:53,171 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 1 variables, input treesize:140, output treesize:453 [2018-11-28 11:08:53,413 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2018-11-28 11:08:53,862 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2018-11-28 11:08:53,876 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:53,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 217 [2018-11-28 11:08:53,888 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:53,889 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:53,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:53,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:53,896 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:53,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:53,900 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:53,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:53,904 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:53,906 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:53,907 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:53,910 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:53,912 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:53,915 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:53,917 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:53,921 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:53,924 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:53,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 133 treesize of output 398 [2018-11-28 11:08:53,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 6 xjuncts. [2018-11-28 11:08:54,152 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 147 [2018-11-28 11:08:54,156 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:08:54,157 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,160 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,161 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,162 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,164 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,165 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 154 [2018-11-28 11:08:54,166 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:54,194 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:54,201 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 166 [2018-11-28 11:08:54,205 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:08:54,206 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,206 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,207 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,208 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,209 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,210 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,211 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,212 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 154 [2018-11-28 11:08:54,213 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:54,242 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:54,250 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 182 [2018-11-28 11:08:54,254 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,255 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,256 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,257 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,258 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,258 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,259 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,260 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,261 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,262 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,263 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:54,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 195 [2018-11-28 11:08:54,264 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:54,302 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:54,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:08:55,477 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:55,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 195 [2018-11-28 11:08:55,483 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:55,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:55,486 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:55,487 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:55,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:55,491 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:55,493 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:55,495 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:55,497 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:55,500 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:55,502 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:55,503 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:55,505 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:55,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 126 treesize of output 332 [2018-11-28 11:08:55,519 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 3 xjuncts. [2018-11-28 11:08:55,627 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:55,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 150 [2018-11-28 11:08:55,632 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:55,633 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:55,634 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:55,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:55,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:55,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 124 [2018-11-28 11:08:55,636 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:55,656 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:55,659 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:55,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 160 [2018-11-28 11:08:55,665 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:55,666 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:55,666 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:55,667 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:55,668 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:55,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 124 [2018-11-28 11:08:55,669 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:55,691 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:55,727 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:08:56,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:56,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 176 [2018-11-28 11:08:56,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:56,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:56,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:56,441 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:56,443 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:56,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:56,446 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:56,447 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:56,448 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:56,450 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:56,454 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:56,455 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:56,456 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:56,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 239 [2018-11-28 11:08:56,459 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:56,513 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:56,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 146 [2018-11-28 11:08:56,527 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:56,528 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:56,529 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:56,530 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:56,531 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:56,532 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:56,533 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:56,534 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:56,535 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:56,536 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:56,537 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:56,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 173 [2018-11-28 11:08:56,538 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:56,577 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:56,597 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:56,996 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:56,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 195 [2018-11-28 11:08:57,003 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:57,004 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:57,006 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:57,008 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:57,011 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:57,013 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:57,014 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:57,018 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:57,020 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:57,023 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:57,024 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:57,027 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:57,029 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:57,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 126 treesize of output 332 [2018-11-28 11:08:57,043 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 3 xjuncts. [2018-11-28 11:08:57,144 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:57,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 160 [2018-11-28 11:08:57,150 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:57,151 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:57,152 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:57,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:57,154 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:57,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 130 [2018-11-28 11:08:57,155 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:57,177 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:57,180 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:57,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 150 [2018-11-28 11:08:57,186 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:57,186 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:57,187 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:57,188 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:57,189 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:08:57,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 130 [2018-11-28 11:08:57,190 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-28 11:08:57,212 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:08:57,250 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:08:57,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 16 dim-0 vars, and 8 xjuncts. [2018-11-28 11:08:57,445 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 12 variables, input treesize:872, output treesize:891 [2018-11-28 11:08:57,796 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2018-11-28 11:08:58,195 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 222 [2018-11-28 11:08:58,574 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-28 11:08:58,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:08:58,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 42 [2018-11-28 11:08:58,721 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2018-11-28 11:08:58,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-28 11:08:58,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1691, Unknown=0, NotChecked=0, Total=1806 [2018-11-28 11:08:58,758 INFO L87 Difference]: Start difference. First operand 1354 states and 1905 transitions. cyclomatic complexity: 602 Second operand 43 states. [2018-11-28 11:09:00,773 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 75 [2018-11-28 11:09:14,790 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2018-11-28 11:09:15,522 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2018-11-28 11:09:16,105 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2018-11-28 11:09:16,416 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2018-11-28 11:09:29,761 WARN L180 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 219 [2018-11-28 11:09:30,460 WARN L180 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 251 DAG size of output: 250 [2018-11-28 11:09:45,122 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 106 [2018-11-28 11:09:45,964 WARN L180 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 127 [2018-11-28 11:10:00,464 WARN L180 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 270 DAG size of output: 250 [2018-11-28 11:10:01,890 WARN L180 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 280 [2018-11-28 11:10:04,159 WARN L180 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 284 DAG size of output: 275 [2018-11-28 11:10:04,859 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2018-11-28 11:10:05,292 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 69 [2018-11-28 11:10:06,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:10:06,512 INFO L93 Difference]: Finished difference Result 1624 states and 2282 transitions. [2018-11-28 11:10:06,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-11-28 11:10:06,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1624 states and 2282 transitions. [2018-11-28 11:10:06,516 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 445 [2018-11-28 11:10:06,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1624 states to 1624 states and 2282 transitions. [2018-11-28 11:10:06,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1151 [2018-11-28 11:10:06,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1151 [2018-11-28 11:10:06,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1624 states and 2282 transitions. [2018-11-28 11:10:06,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:10:06,521 INFO L705 BuchiCegarLoop]: Abstraction has 1624 states and 2282 transitions. [2018-11-28 11:10:06,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states and 2282 transitions. [2018-11-28 11:10:06,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1381. [2018-11-28 11:10:06,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1381 states. [2018-11-28 11:10:06,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1935 transitions. [2018-11-28 11:10:06,542 INFO L728 BuchiCegarLoop]: Abstraction has 1381 states and 1935 transitions. [2018-11-28 11:10:06,543 INFO L608 BuchiCegarLoop]: Abstraction has 1381 states and 1935 transitions. [2018-11-28 11:10:06,543 INFO L442 BuchiCegarLoop]: ======== Iteration 27============ [2018-11-28 11:10:06,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1381 states and 1935 transitions. [2018-11-28 11:10:06,546 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 413 [2018-11-28 11:10:06,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:10:06,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:10:06,547 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 11:10:06,547 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:10:06,547 INFO L794 eck$LassoCheckResult]: Stem: 28510#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 28506#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 28488#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 28489#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 28497#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 28507#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 28520#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 28504#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 28505#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 28521#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 28508#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 28509#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 28519#L545-3 assume !(lis_~i~0 < lis_~N); 28511#L545-4 lis_~i~0 := 1; 28512#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 28580#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 28597#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 28596#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 28595#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 28594#L548-3 assume !(lis_~j~0 < lis_~i~0); 28591#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 28592#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 29832#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 29831#L549 assume !lis_#t~short11; 29829#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 29830#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 29868#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 29820#L549 assume !lis_#t~short11; 28527#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 28524#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 28522#L548-3 assume !(lis_~j~0 < lis_~i~0); 28523#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 28503#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 28498#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 28499#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 28513#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 28494#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 28495#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 29867#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 29865#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 28491#L548-2 [2018-11-28 11:10:06,548 INFO L796 eck$LassoCheckResult]: Loop: 28491#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 29862#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 29860#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 28490#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 28491#L548-2 [2018-11-28 11:10:06,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:10:06,548 INFO L82 PathProgramCache]: Analyzing trace with hash 2003402307, now seen corresponding path program 21 times [2018-11-28 11:10:06,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:10:06,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:10:06,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:06,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:10:06,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:06,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:10:06,606 INFO L82 PathProgramCache]: Analyzing trace with hash 2511484, now seen corresponding path program 1 times [2018-11-28 11:10:06,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:10:06,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:10:06,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:06,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:10:06,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:06,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:10:06,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1908219970, now seen corresponding path program 22 times [2018-11-28 11:10:06,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:10:06,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:10:06,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:06,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:10:06,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:06,785 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2018-11-28 11:10:45,814 WARN L180 SmtUtils]: Spent 38.99 s on a formula simplification. DAG size of input: 420 DAG size of output: 285 [2018-11-28 11:10:54,116 WARN L180 SmtUtils]: Spent 8.29 s on a formula simplification that was a NOOP. DAG size: 181 [2018-11-28 11:10:54,119 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:10:54,119 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:10:54,119 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:10:54,119 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:10:54,119 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:10:54,120 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:10:54,120 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:10:54,120 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:10:54,120 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration27_Lasso [2018-11-28 11:10:54,120 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:10:54,120 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:10:54,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:10:54,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-28 11:10:54,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-28 11:10:54,142 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-28 11:10:54,146 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-28 11:10:54,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:10:54,151 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-28 11:11:26,011 WARN L180 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 116 [2018-11-28 11:11:26,254 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 78 [2018-11-28 11:11:26,254 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-28 11:11:26,257 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-28 11:11:26,258 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-28 11:11:26,259 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-28 11:11:26,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:11:26,262 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-28 11:11:26,263 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-28 11:11:26,265 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-28 11:11:26,266 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-28 11:11:26,267 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-28 11:11:26,269 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-28 11:11:26,271 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-28 11:11:26,272 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-28 11:11:26,273 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-28 11:11:26,275 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-28 11:11:26,276 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-28 11:11:26,463 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2018-11-28 11:11:26,835 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:11:26,835 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:11:26,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:11:26,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:11:26,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:11:26,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:11:26,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:11:26,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:11:26,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:11:26,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:11:26,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:11:26,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:11:26,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:11:26,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:11:26,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:11:26,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:11:26,838 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:11:26,838 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:11:26,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:11:26,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:11:26,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:11:26,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:11:26,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:11:26,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:11:26,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:11:26,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:11:26,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:11:26,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:11:26,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-28 11:11:26,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:11:26,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:11:26,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:11:26,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:11:26,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:11:26,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:11:26,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:11:26,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:11:26,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:11:26,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:11:26,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:11:26,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:11:26,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:11:26,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:11:26,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:11:26,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:11:26,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:11:26,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:11:26,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:11:26,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:11:26,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:11:26,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:11:26,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:11:26,842 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:11:26,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:11:26,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:11:26,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:11:26,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:11:26,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:11:26,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:11:26,844 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:11:26,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:11:26,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:11:26,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:11:26,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:11:26,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:11:26,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:11:26,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:11:26,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:11:26,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:11:26,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:11:26,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:11:26,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:11:26,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:11:26,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:11:26,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:11:26,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:11:26,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:11:26,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:11:26,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:11:26,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:11:26,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:11:26,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:11:26,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:11:26,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:11:26,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:11:26,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:11:26,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:11:26,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:11:26,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:11:26,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:11:26,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:11:26,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:11:26,855 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:11:26,855 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:11:26,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:11:26,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:11:26,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:11:26,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:11:26,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:11:26,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:11:26,860 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:11:26,860 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:11:26,890 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:11:26,922 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 11:11:26,922 INFO L444 ModelExtractionUtils]: 45 out of 52 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 11:11:26,922 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:11:26,923 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:11:26,924 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:11:26,924 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_~i~0) = -1*ULTIMATE.start_lis_~j~0 + 1*ULTIMATE.start_lis_~i~0 Supporting invariants [] [2018-11-28 11:11:30,843 INFO L297 tatePredicateManager]: 110 out of 110 supporting invariants were superfluous and have been removed [2018-11-28 11:11:30,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:11:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:11:30,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:11:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:11:30,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:11:30,894 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-28 11:11:30,894 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-28 11:11:30,895 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1381 states and 1935 transitions. cyclomatic complexity: 606 Second operand 4 states. [2018-11-28 11:11:30,923 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1381 states and 1935 transitions. cyclomatic complexity: 606. Second operand 4 states. Result 1611 states and 2289 transitions. Complement of second has 7 states. [2018-11-28 11:11:30,929 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-28 11:11:30,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:11:30,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-28 11:11:30,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 40 letters. Loop has 4 letters. [2018-11-28 11:11:30,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:11:30,930 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:11:30,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:11:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:11:30,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:11:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:11:30,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:11:31,014 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-28 11:11:31,014 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-28 11:11:31,014 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1381 states and 1935 transitions. cyclomatic complexity: 606 Second operand 4 states. [2018-11-28 11:11:31,056 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1381 states and 1935 transitions. cyclomatic complexity: 606. Second operand 4 states. Result 1626 states and 2269 transitions. Complement of second has 9 states. [2018-11-28 11:11:31,058 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-28 11:11:31,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:11:31,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-28 11:11:31,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 40 letters. Loop has 4 letters. [2018-11-28 11:11:31,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:11:31,059 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:11:31,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:11:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:11:31,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:11:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:11:31,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:11:31,183 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-28 11:11:31,183 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 11:11:31,183 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1381 states and 1935 transitions. cyclomatic complexity: 606 Second operand 4 states. [2018-11-28 11:11:31,216 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1381 states and 1935 transitions. cyclomatic complexity: 606. Second operand 4 states. Result 2191 states and 3146 transitions. Complement of second has 8 states. [2018-11-28 11:11:31,217 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-28 11:11:31,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:11:31,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2018-11-28 11:11:31,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 40 letters. Loop has 4 letters. [2018-11-28 11:11:31,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:11:31,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 44 letters. Loop has 4 letters. [2018-11-28 11:11:31,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:11:31,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 40 letters. Loop has 8 letters. [2018-11-28 11:11:31,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:11:31,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2191 states and 3146 transitions. [2018-11-28 11:11:31,225 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 590 [2018-11-28 11:11:31,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2191 states to 1718 states and 2430 transitions. [2018-11-28 11:11:31,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 872 [2018-11-28 11:11:31,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 982 [2018-11-28 11:11:31,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1718 states and 2430 transitions. [2018-11-28 11:11:31,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:11:31,233 INFO L705 BuchiCegarLoop]: Abstraction has 1718 states and 2430 transitions. [2018-11-28 11:11:31,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states and 2430 transitions. [2018-11-28 11:11:31,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1258. [2018-11-28 11:11:31,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1258 states. [2018-11-28 11:11:31,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1794 transitions. [2018-11-28 11:11:31,251 INFO L728 BuchiCegarLoop]: Abstraction has 1258 states and 1794 transitions. [2018-11-28 11:11:31,251 INFO L608 BuchiCegarLoop]: Abstraction has 1258 states and 1794 transitions. [2018-11-28 11:11:31,251 INFO L442 BuchiCegarLoop]: ======== Iteration 28============ [2018-11-28 11:11:31,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1258 states and 1794 transitions. [2018-11-28 11:11:31,253 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 383 [2018-11-28 11:11:31,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:11:31,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:11:31,254 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 11:11:31,254 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 1, 1, 1] [2018-11-28 11:11:31,254 INFO L794 eck$LassoCheckResult]: Stem: 36203#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36200#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 36182#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 36183#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 36189#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 36201#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 36202#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 36198#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 36199#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 36217#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 36215#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 36216#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 36211#L545-3 assume !(lis_~i~0 < lis_~N); 36213#L545-4 lis_~i~0 := 1; 36481#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 36480#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 36479#L549 assume !lis_#t~short11; 36478#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 36477#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36476#L548-3 assume !(lis_~j~0 < lis_~i~0); 36475#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 36474#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 36473#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 36471#L549 assume !lis_#t~short11; 36465#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 36462#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36460#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 36458#L549 assume !lis_#t~short11; 36457#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 36456#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36455#L548-3 assume !(lis_~j~0 < lis_~i~0); 36454#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 36453#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 36452#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 36450#L549 assume !lis_#t~short11; 36447#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 36445#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36443#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 36440#L549 assume !lis_#t~short11; 36429#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 36436#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36432#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 36426#L549 assume !lis_#t~short11; 36410#L549-2 [2018-11-28 11:11:31,254 INFO L796 eck$LassoCheckResult]: Loop: 36410#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 36411#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36406#L548-3 assume !(lis_~j~0 < lis_~i~0); 36407#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 36403#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 36404#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 36398#L549 assume !lis_#t~short11; 36400#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 36470#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36469#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 36468#L549 assume !lis_#t~short11; 36466#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 36463#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36433#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 36434#L549 assume !lis_#t~short11; 36410#L549-2 [2018-11-28 11:11:31,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:11:31,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1944447434, now seen corresponding path program 3 times [2018-11-28 11:11:31,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:11:31,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:11:31,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:11:31,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:11:31,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:11:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:11:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:11:31,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:11:31,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2142895964, now seen corresponding path program 2 times [2018-11-28 11:11:31,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:11:31,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:11:31,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:11:31,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:11:31,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:11:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:11:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:11:31,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:11:31,281 INFO L82 PathProgramCache]: Analyzing trace with hash 950278279, now seen corresponding path program 4 times [2018-11-28 11:11:31,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:11:31,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:11:31,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:11:31,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:11:31,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:11:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:11:31,534 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 73 proven. 74 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-28 11:11:31,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:11:31,534 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:11:31,548 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 11:11:31,570 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 11:11:31,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:11:31,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:11:31,700 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 137 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 11:11:31,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:11:31,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-11-28 11:11:31,838 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2018-11-28 11:11:31,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-28 11:11:31,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2018-11-28 11:11:31,859 INFO L87 Difference]: Start difference. First operand 1258 states and 1794 transitions. cyclomatic complexity: 578 Second operand 23 states. [2018-11-28 11:11:32,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:11:32,203 INFO L93 Difference]: Finished difference Result 1234 states and 1751 transitions. [2018-11-28 11:11:32,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-28 11:11:32,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1234 states and 1751 transitions. [2018-11-28 11:11:32,207 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 275 [2018-11-28 11:11:32,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1234 states to 1084 states and 1561 transitions. [2018-11-28 11:11:32,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 695 [2018-11-28 11:11:32,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 695 [2018-11-28 11:11:32,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1084 states and 1561 transitions. [2018-11-28 11:11:32,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:11:32,210 INFO L705 BuchiCegarLoop]: Abstraction has 1084 states and 1561 transitions. [2018-11-28 11:11:32,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states and 1561 transitions. [2018-11-28 11:11:32,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 768. [2018-11-28 11:11:32,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2018-11-28 11:11:32,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1101 transitions. [2018-11-28 11:11:32,219 INFO L728 BuchiCegarLoop]: Abstraction has 768 states and 1101 transitions. [2018-11-28 11:11:32,219 INFO L608 BuchiCegarLoop]: Abstraction has 768 states and 1101 transitions. [2018-11-28 11:11:32,219 INFO L442 BuchiCegarLoop]: ======== Iteration 29============ [2018-11-28 11:11:32,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 768 states and 1101 transitions. [2018-11-28 11:11:32,221 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 255 [2018-11-28 11:11:32,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:11:32,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:11:32,222 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:11:32,222 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:11:32,222 INFO L794 eck$LassoCheckResult]: Stem: 38917#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38914#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 38895#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 38896#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 38905#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 38915#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 38916#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 38912#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 38913#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 38929#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 38928#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 38927#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 38926#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 38925#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 38924#L545-3 assume !(lis_~i~0 < lis_~N); 38918#L545-4 lis_~i~0 := 1; 38919#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 38946#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 38959#L549 assume !lis_#t~short11; 38960#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 38970#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 38969#L548-3 assume !(lis_~j~0 < lis_~i~0); 38968#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 38967#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 38966#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 38963#L549 assume !lis_#t~short11; 38965#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 39445#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 39444#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 39443#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 39034#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 39035#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 38981#L548-3 assume !(lis_~j~0 < lis_~i~0); 38909#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 38910#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 38911#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 39508#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 39507#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 39506#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 39505#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 39503#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 39502#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 39382#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 39541#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 39536#L549 [2018-11-28 11:11:32,222 INFO L796 eck$LassoCheckResult]: Loop: 39536#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 39383#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 39384#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 39540#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 39536#L549 [2018-11-28 11:11:32,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:11:32,223 INFO L82 PathProgramCache]: Analyzing trace with hash 246233564, now seen corresponding path program 23 times [2018-11-28 11:11:32,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:11:32,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:11:32,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:11:32,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:11:32,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:11:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:11:33,183 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 74 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:11:33,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:11:33,184 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:11:33,194 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 11:11:33,366 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-28 11:11:33,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:11:33,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:11:33,371 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 11 treesize of output 14 [2018-11-28 11:11:33,376 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,377 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:11:33,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:11:33,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:11:33,385 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-28 11:11:33,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-11-28 11:11:33,405 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-28 11:11:33,407 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 11:11:33,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:11:33,413 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2018-11-28 11:11:33,416 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-11-28 11:11:33,416 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:11:33,421 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:11:33,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:11:33,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:11:33,430 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:53, output treesize:32 [2018-11-28 11:11:33,476 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,477 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,478 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 63 [2018-11-28 11:11:33,484 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,493 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 58 [2018-11-28 11:11:33,494 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:11:33,510 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,512 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 59 [2018-11-28 11:11:33,518 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,521 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,528 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 66 [2018-11-28 11:11:33,529 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:11:33,543 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:11:33,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:11:33,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:11:33,555 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:63, output treesize:46 [2018-11-28 11:11:33,610 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,611 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 79 [2018-11-28 11:11:33,616 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,619 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,619 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,620 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,631 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 89 [2018-11-28 11:11:33,632 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:11:33,655 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,656 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,657 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 75 [2018-11-28 11:11:33,661 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,661 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,662 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,664 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,666 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,667 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,669 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,677 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 121 [2018-11-28 11:11:33,678 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:11:33,709 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:11:33,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:11:33,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:11:33,727 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:81, output treesize:64 [2018-11-28 11:11:33,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,794 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 95 [2018-11-28 11:11:33,800 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,801 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,802 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,803 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,806 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,807 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,810 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,823 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 122 [2018-11-28 11:11:33,824 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:11:33,861 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,863 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 91 [2018-11-28 11:11:33,868 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,869 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,870 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,871 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,873 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,874 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,877 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,878 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,880 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,883 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,887 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:33,896 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 194 [2018-11-28 11:11:33,897 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:11:33,941 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:11:33,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:11:33,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:11:33,961 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:99, output treesize:82 [2018-11-28 11:11:34,045 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,046 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,048 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 111 [2018-11-28 11:11:34,055 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,062 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,063 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,064 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,065 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,068 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,073 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,075 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,076 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,077 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,079 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,092 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 163 [2018-11-28 11:11:34,093 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:11:34,146 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,149 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 107 [2018-11-28 11:11:34,154 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,157 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,157 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,158 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,160 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,160 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,161 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,162 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,164 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,169 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,170 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,171 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,174 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,175 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,176 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,177 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,188 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 22 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 291 [2018-11-28 11:11:34,190 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:11:34,278 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:11:34,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:11:34,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:11:34,305 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:100 [2018-11-28 11:11:34,479 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,480 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 137 [2018-11-28 11:11:34,494 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,496 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,498 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,499 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,501 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,512 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,521 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,523 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,525 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,526 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,528 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,531 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,533 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,534 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,534 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:11:34,557 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,606 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 13 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 83 treesize of output 273 [2018-11-28 11:11:34,609 INFO L267 ElimStorePlain]: Start of recursive call 3: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 9 xjuncts. [2018-11-28 11:11:34,735 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,736 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,737 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:11:34,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 113 [2018-11-28 11:11:34,741 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,743 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:11:34,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,747 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,748 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,749 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,750 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,752 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,755 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,757 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,762 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,762 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,766 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 23 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 229 [2018-11-28 11:11:34,767 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:11:34,818 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:11:34,821 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,822 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,823 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,824 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 124 [2018-11-28 11:11:34,835 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,838 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,839 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,839 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:11:34,840 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,841 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,842 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,853 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,854 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,855 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,856 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,858 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,859 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,861 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,863 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,865 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:34,879 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 23 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 63 treesize of output 248 [2018-11-28 11:11:34,881 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-28 11:11:35,031 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-28 11:11:35,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-28 11:11:35,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 11 dim-0 vars, and 4 xjuncts. [2018-11-28 11:11:35,181 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:149, output treesize:465 [2018-11-28 11:11:35,604 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,606 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 91 [2018-11-28 11:11:35,609 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,624 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,626 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,627 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,628 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,631 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,634 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,636 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,637 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,640 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,672 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 44 treesize of output 149 [2018-11-28 11:11:35,672 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-28 11:11:35,676 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2018-11-28 11:11:35,732 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,733 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,733 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,734 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,735 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,736 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,737 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,737 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,738 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,740 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,741 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,741 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,742 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 89 [2018-11-28 11:11:35,745 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:11:35,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:11:35,869 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,870 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 100 [2018-11-28 11:11:35,876 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,878 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,879 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,880 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,883 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,886 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,893 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,900 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:35,930 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 56 treesize of output 180 [2018-11-28 11:11:35,930 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-28 11:11:35,976 INFO L267 ElimStorePlain]: Start of recursive call 6: 77 dim-0 vars, End of recursive call: 77 dim-0 vars, and 51 xjuncts. [2018-11-28 11:11:39,702 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,703 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,705 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,706 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,707 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,708 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,709 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,710 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,721 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 86 treesize of output 206 [2018-11-28 11:11:39,755 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-28 11:11:39,761 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 32 xjuncts. [2018-11-28 11:11:39,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,765 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,765 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,767 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,770 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,771 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,772 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,772 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,782 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 158 [2018-11-28 11:11:39,804 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 11:11:39,805 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 8 xjuncts. [2018-11-28 11:11:39,809 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,810 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,811 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,812 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,816 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,822 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,823 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,824 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,830 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 90 treesize of output 206 [2018-11-28 11:11:39,871 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-28 11:11:39,877 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 32 xjuncts. [2018-11-28 11:11:39,880 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,880 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,882 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,886 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,887 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,889 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 136 [2018-11-28 11:11:39,911 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 6 xjuncts. [2018-11-28 11:11:39,914 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,915 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,916 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,917 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,919 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,921 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,922 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,924 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 136 [2018-11-28 11:11:39,945 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 7 xjuncts. [2018-11-28 11:11:39,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,950 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,951 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,951 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,953 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,954 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,955 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,956 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 120 [2018-11-28 11:11:39,971 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 3 xjuncts. [2018-11-28 11:11:39,976 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,977 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,979 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,980 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,982 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,983 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,984 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:39,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,001 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 88 treesize of output 206 [2018-11-28 11:11:40,032 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-28 11:11:40,038 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 32 xjuncts. [2018-11-28 11:11:40,041 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,042 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,043 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,044 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,045 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,046 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,048 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,049 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 136 [2018-11-28 11:11:40,071 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 7 xjuncts. [2018-11-28 11:11:40,073 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,074 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,075 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,077 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,083 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,084 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,085 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,085 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,102 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 86 treesize of output 210 [2018-11-28 11:11:40,147 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-28 11:11:40,159 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 64 xjuncts. [2018-11-28 11:11:40,165 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,170 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,171 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,174 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,175 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 88 treesize of output 206 [2018-11-28 11:11:40,222 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-28 11:11:40,228 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 32 xjuncts. [2018-11-28 11:11:40,232 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,234 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,236 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,240 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,241 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,241 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,242 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,263 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 82 treesize of output 210 [2018-11-28 11:11:40,301 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-28 11:11:40,314 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 64 xjuncts. [2018-11-28 11:11:40,317 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,318 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,320 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,322 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,325 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,326 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,327 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,328 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,341 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 88 treesize of output 206 [2018-11-28 11:11:40,376 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-28 11:11:40,382 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 32 xjuncts. [2018-11-28 11:11:40,385 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,386 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,387 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,390 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,393 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,393 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,394 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,410 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 90 treesize of output 206 [2018-11-28 11:11:40,447 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-28 11:11:40,455 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 32 xjuncts. [2018-11-28 11:11:40,459 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,463 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,464 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,464 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,465 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,468 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,469 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 120 [2018-11-28 11:11:40,484 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 3 xjuncts. [2018-11-28 11:11:40,487 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,489 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,492 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,495 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,496 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,497 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,498 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,515 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 88 treesize of output 206 [2018-11-28 11:11:40,564 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-28 11:11:40,570 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 32 xjuncts. [2018-11-28 11:11:40,574 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,575 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,577 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,579 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,581 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,582 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,584 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,586 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 136 [2018-11-28 11:11:40,605 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 6 xjuncts. [2018-11-28 11:11:40,609 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,610 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,611 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,612 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,623 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,634 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 86 treesize of output 206 [2018-11-28 11:11:40,679 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-28 11:11:40,685 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 24 xjuncts. [2018-11-28 11:11:40,689 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,691 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,692 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,694 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,695 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,696 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,698 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,702 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 136 [2018-11-28 11:11:40,723 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 6 xjuncts. [2018-11-28 11:11:40,727 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,728 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,732 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,734 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,741 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,742 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,760 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 86 treesize of output 206 [2018-11-28 11:11:40,797 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-28 11:11:40,807 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 24 xjuncts. [2018-11-28 11:11:40,810 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,811 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,814 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,817 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,828 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,830 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,833 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,850 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 90 treesize of output 206 [2018-11-28 11:11:40,885 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-28 11:11:40,891 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 32 xjuncts. [2018-11-28 11:11:40,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,896 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,898 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,903 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,915 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 90 treesize of output 206 [2018-11-28 11:11:40,951 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-28 11:11:40,958 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 32 xjuncts. [2018-11-28 11:11:40,961 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,961 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,962 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,963 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,965 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,966 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,967 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,970 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 136 [2018-11-28 11:11:40,988 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 6 xjuncts. [2018-11-28 11:11:40,991 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,992 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,998 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:40,999 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,000 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,001 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,016 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 90 treesize of output 206 [2018-11-28 11:11:41,052 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-28 11:11:41,058 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 32 xjuncts. [2018-11-28 11:11:41,061 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,062 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,063 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,064 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,067 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,068 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,069 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 136 [2018-11-28 11:11:41,091 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 6 xjuncts. [2018-11-28 11:11:41,094 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,095 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,095 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,096 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,098 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,100 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,101 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,103 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 136 [2018-11-28 11:11:41,125 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 6 xjuncts. [2018-11-28 11:11:41,129 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,130 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,131 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,132 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,133 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,135 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,135 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,138 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 136 [2018-11-28 11:11:41,160 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 6 xjuncts. [2018-11-28 11:11:41,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,164 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,166 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,167 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,168 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,169 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,170 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,170 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,176 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 132 [2018-11-28 11:11:41,193 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-11-28 11:11:41,196 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,197 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,198 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,199 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,200 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,203 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,203 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,206 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 136 [2018-11-28 11:11:41,224 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 6 xjuncts. [2018-11-28 11:11:41,227 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,228 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,229 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,230 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,230 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,232 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,233 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 120 [2018-11-28 11:11:41,246 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 3 xjuncts. [2018-11-28 11:11:41,249 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,250 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,250 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,253 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,254 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,255 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,257 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,259 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 136 [2018-11-28 11:11:41,281 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 6 xjuncts. [2018-11-28 11:11:41,285 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,286 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,289 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,295 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,296 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,299 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,300 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,302 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,328 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 180 [2018-11-28 11:11:41,392 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 11:11:41,394 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 6 xjuncts. [2018-11-28 11:11:41,398 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,400 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,404 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,408 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,410 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,412 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,428 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 86 treesize of output 206 [2018-11-28 11:11:41,465 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-28 11:11:41,470 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 22 xjuncts. [2018-11-28 11:11:41,475 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,476 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,477 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,478 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,480 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,481 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,482 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,484 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 136 [2018-11-28 11:11:41,507 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 6 xjuncts. [2018-11-28 11:11:41,510 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,513 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,514 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,518 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,519 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,519 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,520 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,535 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 90 treesize of output 206 [2018-11-28 11:11:41,570 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-28 11:11:41,575 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 32 xjuncts. [2018-11-28 11:11:41,579 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,580 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,582 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,583 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,586 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,587 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,588 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,589 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,607 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 88 treesize of output 206 [2018-11-28 11:11:41,645 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-28 11:11:41,652 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 32 xjuncts. [2018-11-28 11:11:41,655 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,656 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,657 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,659 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,665 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,666 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,667 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,668 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 86 treesize of output 210 [2018-11-28 11:11:41,717 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-28 11:11:41,730 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 64 xjuncts. [2018-11-28 11:11:41,734 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,735 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,736 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,736 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,738 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,740 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,742 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 136 [2018-11-28 11:11:41,760 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 6 xjuncts. [2018-11-28 11:11:41,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,766 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,767 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,772 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,773 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,774 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,775 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,789 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 90 treesize of output 206 [2018-11-28 11:11:41,825 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-28 11:11:41,831 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 32 xjuncts. [2018-11-28 11:11:41,834 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,835 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,835 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,837 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,841 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,842 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,843 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,844 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,854 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 158 [2018-11-28 11:11:41,881 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 11:11:41,883 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 8 xjuncts. [2018-11-28 11:11:41,888 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,889 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,896 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,896 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,912 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 84 treesize of output 206 [2018-11-28 11:11:41,949 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-28 11:11:41,954 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 24 xjuncts. [2018-11-28 11:11:41,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,958 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,960 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,962 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,965 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,966 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,966 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,967 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:41,980 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 88 treesize of output 206 [2018-11-28 11:11:42,016 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-28 11:11:42,022 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 32 xjuncts. [2018-11-28 11:11:42,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,028 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,034 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,035 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,036 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,037 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,038 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,039 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,049 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 180 [2018-11-28 11:11:42,086 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 11:11:42,089 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 8 xjuncts. [2018-11-28 11:11:42,092 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,097 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,099 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,101 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,107 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,108 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,110 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,111 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,130 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 90 treesize of output 206 [2018-11-28 11:11:42,174 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-28 11:11:42,181 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 32 xjuncts. [2018-11-28 11:11:42,185 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,186 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,188 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,189 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,190 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,192 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,193 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,195 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 136 [2018-11-28 11:11:42,222 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 6 xjuncts. [2018-11-28 11:11:42,226 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,228 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,229 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,230 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,236 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,237 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,239 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 136 [2018-11-28 11:11:42,268 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 7 xjuncts. [2018-11-28 11:11:42,281 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,284 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,285 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,286 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,287 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,288 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,289 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,290 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,300 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 180 [2018-11-28 11:11:42,342 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 11:11:42,344 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 8 xjuncts. [2018-11-28 11:11:42,347 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,348 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,349 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,352 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,353 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,354 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,357 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 76 treesize of output 140 [2018-11-28 11:11:42,386 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 11 xjuncts. [2018-11-28 11:11:42,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,390 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,392 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,393 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,396 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,396 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,397 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,407 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 158 [2018-11-28 11:11:42,435 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 11:11:42,438 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 8 xjuncts. [2018-11-28 11:11:42,441 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,442 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,443 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,447 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,449 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,450 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,453 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 76 treesize of output 140 [2018-11-28 11:11:42,479 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 11 xjuncts. [2018-11-28 11:11:42,484 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,484 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,489 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,490 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,492 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,494 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 140 [2018-11-28 11:11:42,523 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 11 xjuncts. [2018-11-28 11:11:42,527 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,528 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,530 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,531 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,531 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,532 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,533 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,534 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,546 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:11:42,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 180 [2018-11-28 11:11:42,573 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 11:11:42,575 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 8 xjuncts. [2018-11-28 11:12:15,273 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-28 11:12:15,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:12:15,301 INFO L202 ElimStorePlain]: Needed 57 recursive calls to eliminate 20 variables, input treesize:487, output treesize:8 [2018-11-28 11:12:15,347 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 26 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 11:12:15,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:12:15,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 38 [2018-11-28 11:12:15,364 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:12:15,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:12:15,364 INFO L82 PathProgramCache]: Analyzing trace with hash 2224444, now seen corresponding path program 2 times [2018-11-28 11:12:15,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:12:15,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:12:15,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:12:15,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:12:15,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:12:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:12:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:12:15,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-28 11:12:15,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2018-11-28 11:12:15,518 INFO L87 Difference]: Start difference. First operand 768 states and 1101 transitions. cyclomatic complexity: 358 Second operand 38 states. [2018-11-28 11:12:17,314 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 99 [2018-11-28 11:12:17,519 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 100 [2018-11-28 11:12:18,017 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 97 [2018-11-28 11:12:18,536 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 105 [2018-11-28 11:12:18,860 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 104 [2018-11-28 11:12:19,298 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 107 [2018-11-28 11:12:19,528 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 108 [2018-11-28 11:12:20,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:12:20,145 INFO L93 Difference]: Finished difference Result 904 states and 1295 transitions. [2018-11-28 11:12:20,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-28 11:12:20,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 904 states and 1295 transitions. [2018-11-28 11:12:20,149 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 289 [2018-11-28 11:12:20,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 904 states to 904 states and 1295 transitions. [2018-11-28 11:12:20,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 578 [2018-11-28 11:12:20,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 578 [2018-11-28 11:12:20,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 904 states and 1295 transitions. [2018-11-28 11:12:20,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:12:20,152 INFO L705 BuchiCegarLoop]: Abstraction has 904 states and 1295 transitions. [2018-11-28 11:12:20,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states and 1295 transitions. [2018-11-28 11:12:20,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 764. [2018-11-28 11:12:20,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2018-11-28 11:12:20,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1094 transitions. [2018-11-28 11:12:20,163 INFO L728 BuchiCegarLoop]: Abstraction has 764 states and 1094 transitions. [2018-11-28 11:12:20,163 INFO L608 BuchiCegarLoop]: Abstraction has 764 states and 1094 transitions. [2018-11-28 11:12:20,163 INFO L442 BuchiCegarLoop]: ======== Iteration 30============ [2018-11-28 11:12:20,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 764 states and 1094 transitions. [2018-11-28 11:12:20,165 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 255 [2018-11-28 11:12:20,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:12:20,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:12:20,166 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:12:20,166 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 1, 1, 1, 1] [2018-11-28 11:12:20,167 INFO L794 eck$LassoCheckResult]: Stem: 40825#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 40822#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 40803#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 40804#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 40813#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 40823#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 40824#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 40820#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 40821#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 40837#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 40836#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 40835#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 40834#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 40833#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 40832#L545-3 assume !(lis_~i~0 < lis_~N); 40826#L545-4 lis_~i~0 := 1; 40827#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 40894#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40892#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 40891#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 40890#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 40889#L548-3 assume !(lis_~j~0 < lis_~i~0); 40887#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 40886#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 40885#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40883#L549 assume !lis_#t~short11; 40882#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 40881#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 40880#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40879#L549 assume !lis_#t~short11; 40878#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 40877#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 40876#L548-3 assume !(lis_~j~0 < lis_~i~0); 40875#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 40874#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 40873#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40871#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 40869#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 40868#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 40867#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40865#L549 assume !lis_#t~short11; 40866#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 40932#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 40931#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40928#L549 assume !lis_#t~short11; 40929#L549-2 [2018-11-28 11:12:20,167 INFO L796 eck$LassoCheckResult]: Loop: 40929#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 40927#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 41087#L548-3 assume !(lis_~j~0 < lis_~i~0); 41085#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 40973#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 40974#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40968#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 40969#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 40964#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 40963#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40961#L549 assume !lis_#t~short11; 40962#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 40980#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 40981#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 41099#L549 assume !lis_#t~short11; 40929#L549-2 [2018-11-28 11:12:20,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:12:20,167 INFO L82 PathProgramCache]: Analyzing trace with hash -946079406, now seen corresponding path program 24 times [2018-11-28 11:12:20,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:12:20,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:12:20,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:12:20,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:12:20,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:12:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:12:20,694 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 2 proven. 86 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 11:12:20,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:12:20,695 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:12:20,704 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 11:12:20,749 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-28 11:12:20,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:12:20,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:12:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 2 proven. 61 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-28 11:12:21,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:12:21,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14] total 34 [2018-11-28 11:12:21,169 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:12:21,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:12:21,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1462837594, now seen corresponding path program 3 times [2018-11-28 11:12:21,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:12:21,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:12:21,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:12:21,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:12:21,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:12:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:12:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:12:21,419 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 95 [2018-11-28 11:12:21,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-28 11:12:21,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2018-11-28 11:12:21,461 INFO L87 Difference]: Start difference. First operand 764 states and 1094 transitions. cyclomatic complexity: 355 Second operand 35 states. [2018-11-28 11:12:24,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:12:24,327 INFO L93 Difference]: Finished difference Result 1373 states and 1942 transitions. [2018-11-28 11:12:24,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-28 11:12:24,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1373 states and 1942 transitions. [2018-11-28 11:12:24,331 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 479 [2018-11-28 11:12:24,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1373 states to 1373 states and 1942 transitions. [2018-11-28 11:12:24,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 826 [2018-11-28 11:12:24,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 826 [2018-11-28 11:12:24,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1373 states and 1942 transitions. [2018-11-28 11:12:24,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:12:24,334 INFO L705 BuchiCegarLoop]: Abstraction has 1373 states and 1942 transitions. [2018-11-28 11:12:24,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states and 1942 transitions. [2018-11-28 11:12:24,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1253. [2018-11-28 11:12:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1253 states. [2018-11-28 11:12:24,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1792 transitions. [2018-11-28 11:12:24,348 INFO L728 BuchiCegarLoop]: Abstraction has 1253 states and 1792 transitions. [2018-11-28 11:12:24,348 INFO L608 BuchiCegarLoop]: Abstraction has 1253 states and 1792 transitions. [2018-11-28 11:12:24,348 INFO L442 BuchiCegarLoop]: ======== Iteration 31============ [2018-11-28 11:12:24,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1253 states and 1792 transitions. [2018-11-28 11:12:24,351 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 445 [2018-11-28 11:12:24,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:12:24,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:12:24,352 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:12:24,352 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 1, 1, 1] [2018-11-28 11:12:24,352 INFO L794 eck$LassoCheckResult]: Stem: 43221#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 43218#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 43198#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 43199#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 43208#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 43219#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 43220#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 43216#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 43217#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 43234#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 43233#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 43232#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 43231#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 43230#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 43229#L545-3 assume !(lis_~i~0 < lis_~N); 43222#L545-4 lis_~i~0 := 1; 43223#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 43250#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 43264#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 43263#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 43262#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 43261#L548-3 assume !(lis_~j~0 < lis_~i~0); 43259#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 43260#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 43390#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 43388#L549 assume !lis_#t~short11; 43389#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 43661#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 43660#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 43659#L549 assume !lis_#t~short11; 43658#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 43657#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 43656#L548-3 assume !(lis_~j~0 < lis_~i~0); 43655#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 43654#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 43653#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 43651#L549 assume !lis_#t~short11; 43650#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 43649#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 43648#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 43647#L549 assume !lis_#t~short11; 43646#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 43645#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 43644#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 43641#L549 assume !lis_#t~short11; 43642#L549-2 [2018-11-28 11:12:24,353 INFO L796 eck$LassoCheckResult]: Loop: 43642#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 44367#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 44351#L548-3 assume !(lis_~j~0 < lis_~i~0); 44348#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 44347#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 44346#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 44344#L549 assume !lis_#t~short11; 44343#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 44341#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 44342#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 44379#L549 assume !lis_#t~short11; 44378#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 44377#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 44376#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 44375#L549 assume !lis_#t~short11; 43642#L549-2 [2018-11-28 11:12:24,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:12:24,353 INFO L82 PathProgramCache]: Analyzing trace with hash -266021036, now seen corresponding path program 25 times [2018-11-28 11:12:24,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:12:24,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:12:24,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:12:24,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:12:24,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:12:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:12:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:12:24,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:12:24,402 INFO L82 PathProgramCache]: Analyzing trace with hash 2142895964, now seen corresponding path program 3 times [2018-11-28 11:12:24,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:12:24,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:12:24,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:12:24,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:12:24,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:12:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:12:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:12:24,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:12:24,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1723283369, now seen corresponding path program 26 times [2018-11-28 11:12:24,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:12:24,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:12:24,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:12:24,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:12:24,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:12:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:12:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:12:24,665 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2018-11-28 11:12:36,174 WARN L180 SmtUtils]: Spent 11.47 s on a formula simplification. DAG size of input: 398 DAG size of output: 272 [2018-11-28 11:12:38,836 WARN L180 SmtUtils]: Spent 2.65 s on a formula simplification that was a NOOP. DAG size: 165 [2018-11-28 11:12:38,838 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:12:38,838 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:12:38,838 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:12:38,839 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:12:38,839 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:12:38,839 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:12:38,839 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:12:38,839 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:12:38,839 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration31_Lasso [2018-11-28 11:12:38,839 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:12:38,839 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:12:38,840 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-28 11:12:38,841 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-28 11:12:38,843 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-28 11:12:38,843 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-28 11:12:38,844 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-28 11:12:38,845 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-28 11:12:38,847 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-28 11:12:38,848 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-28 11:12:38,849 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-28 11:12:38,850 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-28 11:12:38,853 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-28 11:12:38,854 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-28 11:12:38,855 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-28 11:12:38,856 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-28 11:12:41,904 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 124 [2018-11-28 11:12:42,074 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 76 [2018-11-28 11:12:42,074 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-28 11:12:42,075 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-28 11:12:42,076 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-28 11:12:42,077 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-28 11:12:42,078 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-28 11:12:42,505 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:12:42,505 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:12:42,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:12:42,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:12:42,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:12:42,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:12:42,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:12:42,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:12:42,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:12:42,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:12:42,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:12:42,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:12:42,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:12:42,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:12:42,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:12:42,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:12:42,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:12:42,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:12:42,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:12:42,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:12:42,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:12:42,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:12:42,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:12:42,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:12:42,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:12:42,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:12:42,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:12:42,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:12:42,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:12:42,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:12:42,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:12:42,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:12:42,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:12:42,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:12:42,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:12:42,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:12:42,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:12:42,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:12:42,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:12:42,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:12:42,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:12:42,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:12:42,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:12:42,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:12:42,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:12:42,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:12:42,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:12:42,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:12:42,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:12:42,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:12:42,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:12:42,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:12:42,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:12:42,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:12:42,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:12:42,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:12:42,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:12:42,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:12:42,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:12:42,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:12:42,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:12:42,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:12:42,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:12:42,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:12:42,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:12:42,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:12:42,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:12:42,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:12:42,516 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:12:42,516 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:12:42,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:12:42,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:12:42,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:12:42,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:12:42,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:12:42,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:12:42,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:12:42,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:12:42,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:12:42,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:12:42,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:12:42,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:12:42,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:12:42,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:12:42,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:12:42,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:12:42,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:12:42,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:12:42,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:12:42,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:12:42,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:12:42,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:12:42,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:12:42,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:12:42,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:12:42,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:12:42,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:12:42,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:12:42,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:12:42,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:12:42,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:12:42,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:12:42,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:12:42,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:12:42,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:12:42,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:12:42,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:12:42,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:12:42,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:12:42,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:12:42,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:12:42,523 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:12:42,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:12:42,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:12:42,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:12:42,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:12:42,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:12:42,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:12:42,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:12:42,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:12:42,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:12:42,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:12:42,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:12:42,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:12:42,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:12:42,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:12:42,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:12:42,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:12:42,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:12:42,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:12:42,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:12:42,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:12:42,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:12:42,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:12:42,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:12:42,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:12:42,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:12:42,547 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:12:42,564 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-28 11:12:42,565 INFO L444 ModelExtractionUtils]: 40 out of 49 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-28 11:12:42,565 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:12:42,565 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:12:42,566 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:12:42,566 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0) = -2*ULTIMATE.start_lis_~i~0 + 7 Supporting invariants [] [2018-11-28 11:12:43,263 INFO L297 tatePredicateManager]: 111 out of 112 supporting invariants were superfluous and have been removed [2018-11-28 11:12:43,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:12:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:12:43,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:12:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:12:43,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:12:43,410 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:12:43,410 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 7 loop predicates [2018-11-28 11:12:43,410 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1253 states and 1792 transitions. cyclomatic complexity: 580 Second operand 12 states. [2018-11-28 11:12:43,523 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1253 states and 1792 transitions. cyclomatic complexity: 580. Second operand 12 states. Result 1492 states and 2124 transitions. Complement of second has 13 states. [2018-11-28 11:12:43,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 4 stem states 3 non-accepting loop states 2 accepting loop states [2018-11-28 11:12:43,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 11:12:43,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 52 transitions. [2018-11-28 11:12:43,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 52 transitions. Stem has 45 letters. Loop has 15 letters. [2018-11-28 11:12:43,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:12:43,526 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:12:43,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:12:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:12:43,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:12:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:12:43,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:12:43,658 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:12:43,658 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 7 loop predicates [2018-11-28 11:12:43,658 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1253 states and 1792 transitions. cyclomatic complexity: 580 Second operand 12 states. [2018-11-28 11:12:43,874 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1253 states and 1792 transitions. cyclomatic complexity: 580. Second operand 12 states. Result 1647 states and 2362 transitions. Complement of second has 25 states. [2018-11-28 11:12:43,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 4 stem states 9 non-accepting loop states 2 accepting loop states [2018-11-28 11:12:43,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 11:12:43,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 87 transitions. [2018-11-28 11:12:43,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 87 transitions. Stem has 45 letters. Loop has 15 letters. [2018-11-28 11:12:43,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:12:43,875 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:12:43,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:12:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:12:43,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:12:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:12:43,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:12:44,003 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:12:44,004 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 7 loop predicates [2018-11-28 11:12:44,004 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1253 states and 1792 transitions. cyclomatic complexity: 580 Second operand 12 states. [2018-11-28 11:12:44,101 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1253 states and 1792 transitions. cyclomatic complexity: 580. Second operand 12 states. Result 2854 states and 3959 transitions. Complement of second has 20 states. [2018-11-28 11:12:44,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 4 stem states 3 non-accepting loop states 2 accepting loop states [2018-11-28 11:12:44,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 11:12:44,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2018-11-28 11:12:44,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 56 transitions. Stem has 45 letters. Loop has 15 letters. [2018-11-28 11:12:44,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:12:44,102 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:12:44,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:12:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:12:44,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:12:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:12:44,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:12:44,264 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:12:44,265 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.4 stem predicates 7 loop predicates [2018-11-28 11:12:44,265 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1253 states and 1792 transitions. cyclomatic complexity: 580 Second operand 12 states. [2018-11-28 11:12:44,547 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1253 states and 1792 transitions. cyclomatic complexity: 580. Second operand 12 states. Result 4486 states and 6387 transitions. Complement of second has 28 states. [2018-11-28 11:12:44,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 4 stem states 9 non-accepting loop states 2 accepting loop states [2018-11-28 11:12:44,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 11:12:44,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 91 transitions. [2018-11-28 11:12:44,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 91 transitions. Stem has 45 letters. Loop has 15 letters. [2018-11-28 11:12:44,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:12:44,548 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:12:44,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:12:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:12:44,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:12:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:12:44,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:12:44,692 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:12:44,693 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.4 stem predicates 7 loop predicates [2018-11-28 11:12:44,694 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 1253 states and 1792 transitions. cyclomatic complexity: 580 Second operand 12 states. [2018-11-28 11:12:45,537 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 1253 states and 1792 transitions. cyclomatic complexity: 580 Second operand 12 states. Result 17383 states and 31060 transitions. Complement of second has 91 states 15 powerset states76 rank states. The highest rank that occured is 5 [2018-11-28 11:12:45,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 4 stem states 10 non-accepting loop states 2 accepting loop states [2018-11-28 11:12:45,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 11:12:45,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 184 transitions. [2018-11-28 11:12:45,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 184 transitions. Stem has 45 letters. Loop has 15 letters. [2018-11-28 11:12:45,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:12:45,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 184 transitions. Stem has 60 letters. Loop has 15 letters. [2018-11-28 11:12:45,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:12:45,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 184 transitions. Stem has 45 letters. Loop has 30 letters. [2018-11-28 11:12:45,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:12:45,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17383 states and 31060 transitions. [2018-11-28 11:12:45,616 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 2447 [2018-11-28 11:12:45,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17383 states to 11892 states and 22197 transitions. [2018-11-28 11:12:45,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1991 [2018-11-28 11:12:45,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3766 [2018-11-28 11:12:45,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11892 states and 22197 transitions. [2018-11-28 11:12:45,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:12:45,674 INFO L705 BuchiCegarLoop]: Abstraction has 11892 states and 22197 transitions. [2018-11-28 11:12:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11892 states and 22197 transitions. [2018-11-28 11:12:45,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11892 to 6056. [2018-11-28 11:12:45,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6056 states. [2018-11-28 11:12:45,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 12487 transitions. [2018-11-28 11:12:45,779 INFO L728 BuchiCegarLoop]: Abstraction has 6056 states and 12487 transitions. [2018-11-28 11:12:45,779 INFO L608 BuchiCegarLoop]: Abstraction has 6056 states and 12487 transitions. [2018-11-28 11:12:45,779 INFO L442 BuchiCegarLoop]: ======== Iteration 32============ [2018-11-28 11:12:45,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6056 states and 12487 transitions. [2018-11-28 11:12:45,796 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1516 [2018-11-28 11:12:45,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:12:45,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:12:45,797 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 11:12:45,797 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 2, 2, 1, 1, 1] [2018-11-28 11:12:45,797 INFO L794 eck$LassoCheckResult]: Stem: 74008#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 74006#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 73982#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 73983#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 73991#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 74004#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 74005#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 74007#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 74021#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 74020#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 74019#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 74018#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 74017#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 74016#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 74015#L545-3 assume !(lis_~i~0 < lis_~N); 74009#L545-4 lis_~i~0 := 1; 74010#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 74063#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 74062#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 74060#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 74058#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 74056#L548-3 assume !(lis_~j~0 < lis_~i~0); 74053#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 74051#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 74049#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 74046#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 74043#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 74041#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 74042#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 74038#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 74034#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 74035#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 74030#L548-3 assume !(lis_~j~0 < lis_~i~0); 74027#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 74029#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 79102#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 79097#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 79098#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 77719#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 75792#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 79322#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 74402#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 78782#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 79321#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 79017#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 74012#L549-2 [2018-11-28 11:12:45,797 INFO L796 eck$LassoCheckResult]: Loop: 74012#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 79674#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 77882#L548-3 assume !(lis_~j~0 < lis_~i~0); 79352#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 79782#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 79783#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 79774#L549 assume !lis_#t~short11; 79704#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 73989#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 73990#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 79819#L549 assume !lis_#t~short11; 79696#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 79739#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 79808#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 79809#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 79682#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 79683#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 79680#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 79681#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 74012#L549-2 [2018-11-28 11:12:45,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:12:45,797 INFO L82 PathProgramCache]: Analyzing trace with hash 373917522, now seen corresponding path program 3 times [2018-11-28 11:12:45,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:12:45,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:12:45,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:12:45,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:12:45,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:12:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:12:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:12:45,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:12:45,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1851300031, now seen corresponding path program 5 times [2018-11-28 11:12:45,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:12:45,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:12:45,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:12:45,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:12:45,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:12:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:12:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:12:45,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:12:45,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1538295246, now seen corresponding path program 27 times [2018-11-28 11:12:45,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:12:45,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:12:45,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:12:45,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:12:45,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:12:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:12:46,971 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 1 proven. 217 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 11:12:46,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:12:46,971 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:12:46,985 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 11:12:47,694 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-28 11:12:47,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:12:47,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:12:47,721 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:12:47,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-28 11:12:47,733 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:12:47,733 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:12:47,734 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 13 [2018-11-28 11:12:47,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:12:47,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:12:47,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:12:47,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:25 [2018-11-28 11:12:47,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 61 [2018-11-28 11:12:47,992 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:12:47,993 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:12:47,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 56 [2018-11-28 11:12:47,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:12:48,013 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 0 case distinctions, treesize of input 58 treesize of output 67 [2018-11-28 11:12:48,015 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 11:12:48,015 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:12:48,024 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:12:48,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:12:48,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:12:48,043 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:105, output treesize:78 [2018-11-28 11:12:48,167 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 115 [2018-11-28 11:12:48,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:12:48,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:12:48,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:12:48,186 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:12:48,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 140 [2018-11-28 11:12:48,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-28 11:12:48,242 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:12:48,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 111 [2018-11-28 11:12:48,248 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 62 [2018-11-28 11:12:48,248 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:12:48,262 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:12:48,270 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:12:48,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 94 [2018-11-28 11:12:48,275 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 40 [2018-11-28 11:12:48,275 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:12:48,284 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:12:48,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:12:48,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:12:48,324 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:155, output treesize:171 [2018-11-28 11:12:48,618 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 101 [2018-11-28 11:12:48,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:12:48,623 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:12:48,624 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:12:48,626 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:12:48,634 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:12:48,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 109 [2018-11-28 11:12:48,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:12:48,658 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:12:48,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 89 [2018-11-28 11:12:48,663 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2018-11-28 11:12:48,663 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:12:48,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:12:48,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:12:48,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:12:48,696 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:144, output treesize:82 [2018-11-28 11:12:49,356 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 137 [2018-11-28 11:12:49,359 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:12:49,361 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:12:49,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:12:49,367 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:12:49,372 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:12:49,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 132 [2018-11-28 11:12:49,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:12:49,433 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 0 case distinctions, treesize of input 130 treesize of output 131 [2018-11-28 11:12:49,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:12:49,439 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 104 [2018-11-28 11:12:49,439 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:12:49,456 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:12:49,466 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 0 case distinctions, treesize of input 120 treesize of output 121 [2018-11-28 11:12:49,469 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:12:49,470 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:12:49,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 116 [2018-11-28 11:12:49,471 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:12:49,490 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:12:49,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:12:49,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-28 11:12:49,561 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:170, output treesize:285 [2018-11-28 11:12:49,892 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 50 proven. 151 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-28 11:12:49,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:12:49,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27] total 48 [2018-11-28 11:12:51,028 WARN L180 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 205 DAG size of output: 156 [2018-11-28 11:12:51,802 WARN L180 SmtUtils]: Spent 768.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-11-28 11:12:51,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-28 11:12:51,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2101, Unknown=0, NotChecked=0, Total=2352 [2018-11-28 11:12:51,803 INFO L87 Difference]: Start difference. First operand 6056 states and 12487 transitions. cyclomatic complexity: 6548 Second operand 49 states. [2018-11-28 11:12:55,625 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 92 [2018-11-28 11:12:58,700 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 79 [2018-11-28 11:12:59,251 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 96 [2018-11-28 11:12:59,495 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 90 [2018-11-28 11:12:59,941 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2018-11-28 11:13:00,167 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 94 [2018-11-28 11:13:00,496 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2018-11-28 11:13:00,652 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-11-28 11:13:01,283 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2018-11-28 11:13:01,536 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2018-11-28 11:13:01,873 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2018-11-28 11:13:02,049 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2018-11-28 11:13:02,773 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 90 [2018-11-28 11:13:03,299 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 85 [2018-11-28 11:13:03,925 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 97 [2018-11-28 11:13:04,124 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2018-11-28 11:13:04,336 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 72 [2018-11-28 11:13:04,519 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2018-11-28 11:13:05,263 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 93 [2018-11-28 11:13:05,508 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 95 [2018-11-28 11:13:05,879 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-11-28 11:13:06,098 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2018-11-28 11:13:06,462 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 100 [2018-11-28 11:13:07,324 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 95 [2018-11-28 11:13:07,725 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 91 [2018-11-28 11:13:07,937 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2018-11-28 11:13:09,686 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 93 [2018-11-28 11:13:10,393 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 100 [2018-11-28 11:13:10,833 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2018-11-28 11:13:11,279 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 94 [2018-11-28 11:13:11,485 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 98 [2018-11-28 11:13:12,867 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 93 [2018-11-28 11:13:13,639 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2018-11-28 11:13:14,544 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 86 [2018-11-28 11:13:16,199 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 93 [2018-11-28 11:13:16,847 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2018-11-28 11:13:17,894 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2018-11-28 11:13:20,484 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2018-11-28 11:13:20,972 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2018-11-28 11:13:21,176 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2018-11-28 11:13:21,442 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 98 [2018-11-28 11:13:21,673 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2018-11-28 11:13:22,154 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 77 [2018-11-28 11:13:22,433 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 83 [2018-11-28 11:13:24,010 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2018-11-28 11:13:24,276 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2018-11-28 11:13:24,767 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 80 [2018-11-28 11:13:24,988 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 103 [2018-11-28 11:13:25,226 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 85 [2018-11-28 11:13:26,262 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 97 [2018-11-28 11:13:26,478 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2018-11-28 11:13:26,969 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 78 [2018-11-28 11:13:27,183 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2018-11-28 11:13:27,485 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 87 [2018-11-28 11:13:28,533 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 91 [2018-11-28 11:13:28,842 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 117 [2018-11-28 11:13:29,197 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 122 [2018-11-28 11:13:29,675 WARN L180 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 85 [2018-11-28 11:13:29,958 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 80 [2018-11-28 11:13:30,174 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 72 [2018-11-28 11:13:30,542 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 95 [2018-11-28 11:13:30,847 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 102 [2018-11-28 11:13:31,039 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 61 [2018-11-28 11:13:31,374 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2018-11-28 11:13:31,651 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2018-11-28 11:13:32,029 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 94 [2018-11-28 11:13:32,287 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 92 [2018-11-28 11:13:33,316 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 100 [2018-11-28 11:13:33,819 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2018-11-28 11:13:34,416 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 90 [2018-11-28 11:13:34,761 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 76 [2018-11-28 11:13:38,433 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2018-11-28 11:13:39,298 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 92 [2018-11-28 11:13:39,752 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 76 [2018-11-28 11:13:39,932 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 94 [2018-11-28 11:13:40,197 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 80 [2018-11-28 11:13:40,375 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 106 [2018-11-28 11:13:40,627 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 111 [2018-11-28 11:13:40,842 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2018-11-28 11:13:41,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:13:41,631 INFO L93 Difference]: Finished difference Result 34724 states and 67110 transitions. [2018-11-28 11:13:41,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 373 states. [2018-11-28 11:13:41,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34724 states and 67110 transitions. [2018-11-28 11:13:41,727 INFO L131 ngComponentsAnalysis]: Automaton has 116 accepting balls. 7611 [2018-11-28 11:13:41,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34724 states to 34724 states and 67110 transitions. [2018-11-28 11:13:41,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9644 [2018-11-28 11:13:41,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9644 [2018-11-28 11:13:41,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34724 states and 67110 transitions. [2018-11-28 11:13:41,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:13:41,818 INFO L705 BuchiCegarLoop]: Abstraction has 34724 states and 67110 transitions. [2018-11-28 11:13:41,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34724 states and 67110 transitions. [2018-11-28 11:13:42,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34724 to 19607. [2018-11-28 11:13:42,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19607 states. [2018-11-28 11:13:42,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19607 states to 19607 states and 40470 transitions. [2018-11-28 11:13:42,143 INFO L728 BuchiCegarLoop]: Abstraction has 19607 states and 40470 transitions. [2018-11-28 11:13:42,143 INFO L608 BuchiCegarLoop]: Abstraction has 19607 states and 40470 transitions. [2018-11-28 11:13:42,143 INFO L442 BuchiCegarLoop]: ======== Iteration 33============ [2018-11-28 11:13:42,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19607 states and 40470 transitions. [2018-11-28 11:13:42,183 INFO L131 ngComponentsAnalysis]: Automaton has 78 accepting balls. 4679 [2018-11-28 11:13:42,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:13:42,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:13:42,184 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:13:42,184 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 2, 2, 1, 1, 1, 1] [2018-11-28 11:13:42,184 INFO L794 eck$LassoCheckResult]: Stem: 115750#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 115748#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 115723#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 115724#L558-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 115733#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 115746#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 115747#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 115749#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 115766#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 115765#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 115764#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 115763#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 115761#L545-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 115762#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 115757#L545-3 assume !(lis_~i~0 < lis_~N); 115759#L545-4 lis_~i~0 := 1; 115823#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 115824#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 115818#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 115819#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 115810#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 115811#L548-3 assume !(lis_~j~0 < lis_~i~0); 115802#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 115798#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 115799#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 115789#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 115790#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 115836#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 115837#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 115779#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 115780#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 118495#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 115770#L548-3 assume !(lis_~j~0 < lis_~i~0); 115771#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 128991#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 127651#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 127652#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 128792#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 128787#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 121556#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 129592#L549 assume !lis_#t~short11; 119716#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 129817#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 129815#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 129813#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 128196#L549-2 [2018-11-28 11:13:42,184 INFO L796 eck$LassoCheckResult]: Loop: 128196#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 133668#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 115859#L548-3 assume !(lis_~j~0 < lis_~i~0); 115860#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 133798#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 134317#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 134157#L549 assume !lis_#t~short11; 133830#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 134341#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 134336#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 134337#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 134330#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 134284#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 134328#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 134227#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 134215#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~short11; 134224#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 134278#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 134273#L549 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 128196#L549-2 [2018-11-28 11:13:42,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:13:42,184 INFO L82 PathProgramCache]: Analyzing trace with hash 375824146, now seen corresponding path program 28 times [2018-11-28 11:13:42,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:13:42,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:13:42,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:13:42,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:13:42,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:13:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:13:43,107 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 3 proven. 85 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 11:13:43,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:13:43,107 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd739781-7a55-4881-9516-3e310124fba4/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:13:43,114 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 11:13:43,139 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 11:13:43,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:13:43,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:13:43,151 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:43,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-28 11:13:43,169 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:43,170 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:43,170 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 13 [2018-11-28 11:13:43,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:13:43,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:13:43,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:13:43,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-11-28 11:13:43,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2018-11-28 11:13:43,216 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:43,223 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 2 case distinctions, treesize of input 20 treesize of output 43 [2018-11-28 11:13:43,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:13:43,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-28 11:13:43,236 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 11:13:43,236 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:13:43,240 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:13:43,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-11-28 11:13:43,248 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 11:13:43,249 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:13:43,255 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:13:43,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:13:43,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:13:43,281 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:75, output treesize:77 [2018-11-28 11:13:43,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 81 [2018-11-28 11:13:43,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:43,415 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:43,417 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:43,420 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:43,423 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:43,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:43,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 172 [2018-11-28 11:13:43,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:13:43,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2018-11-28 11:13:43,492 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:43,493 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:43,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 58 [2018-11-28 11:13:43,494 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:13:43,503 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:13:43,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 67 [2018-11-28 11:13:43,513 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:43,515 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 56 [2018-11-28 11:13:43,515 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:13:43,524 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:13:43,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:13:43,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 72 [2018-11-28 11:13:43,630 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:43,631 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:43,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 56 [2018-11-28 11:13:43,631 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:13:43,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2018-11-28 11:13:43,655 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:43,656 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:43,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 56 [2018-11-28 11:13:43,657 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 11:13:43,666 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:13:43,677 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:13:43,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:13:43,723 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:206, output treesize:223 [2018-11-28 11:13:44,140 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 126 [2018-11-28 11:13:44,143 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,145 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,146 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,149 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 158 [2018-11-28 11:13:44,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:13:44,185 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 107 [2018-11-28 11:13:44,191 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,192 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,193 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,194 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 83 [2018-11-28 11:13:44,195 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:13:44,209 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:13:44,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:13:44,356 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 126 [2018-11-28 11:13:44,359 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,360 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,362 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,363 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,370 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 158 [2018-11-28 11:13:44,371 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:13:44,399 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 107 [2018-11-28 11:13:44,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,403 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,403 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:13:44,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 82 [2018-11-28 11:13:44,404 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:13:44,466 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:13:44,475 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:13:44,563 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 136 [2018-11-28 11:13:44,567 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,567 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:13:44,568 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,569 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,570 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,580 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,581 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,583 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,590 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 312 [2018-11-28 11:13:44,604 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 3 xjuncts. [2018-11-28 11:13:44,685 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 148 [2018-11-28 11:13:44,690 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,691 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,692 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,693 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 102 [2018-11-28 11:13:44,694 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 11:13:44,709 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:13:44,715 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 135 [2018-11-28 11:13:44,720 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,722 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,723 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:44,724 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 87 [2018-11-28 11:13:44,724 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 11:13:44,744 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:13:44,775 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:13:44,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:13:44,818 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 3 variables, input treesize:492, output treesize:216 [2018-11-28 11:13:45,046 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 115 [2018-11-28 11:13:45,050 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,052 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,055 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,062 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,067 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,075 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,080 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,084 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 55 treesize of output 220 [2018-11-28 11:13:45,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 32 xjuncts. [2018-11-28 11:13:45,399 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 0 case distinctions, treesize of input 121 treesize of output 122 [2018-11-28 11:13:45,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,403 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,404 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,405 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 143 [2018-11-28 11:13:45,406 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:13:45,429 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:13:45,441 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 0 case distinctions, treesize of input 113 treesize of output 116 [2018-11-28 11:13:45,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,447 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,448 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,460 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 4 case distinctions, treesize of input 66 treesize of output 104 [2018-11-28 11:13:45,461 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-28 11:13:45,503 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:13:45,518 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 0 case distinctions, treesize of input 126 treesize of output 131 [2018-11-28 11:13:45,521 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,522 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,525 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,526 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 97 [2018-11-28 11:13:45,534 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:13:45,564 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:13:45,575 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 0 case distinctions, treesize of input 129 treesize of output 130 [2018-11-28 11:13:45,578 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,579 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,580 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,581 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 118 [2018-11-28 11:13:45,582 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 11:13:45,609 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:13:45,619 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 0 case distinctions, treesize of input 106 treesize of output 111 [2018-11-28 11:13:45,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,623 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,624 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 82 [2018-11-28 11:13:45,626 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 11:13:45,652 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:13:45,660 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 126 [2018-11-28 11:13:45,665 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:13:45,666 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,667 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 67 treesize of output 84 [2018-11-28 11:13:45,670 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 11:13:45,689 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:13:45,698 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 0 case distinctions, treesize of input 113 treesize of output 116 [2018-11-28 11:13:45,700 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,701 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:13:45,702 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,703 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 57 treesize of output 79 [2018-11-28 11:13:45,703 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:13:45,722 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:13:45,729 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 131 [2018-11-28 11:13:45,735 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:13:45,736 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,737 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:45,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 68 [2018-11-28 11:13:45,739 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-28 11:13:45,757 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:13:45,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 6 xjuncts. [2018-11-28 11:13:46,564 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 101 [2018-11-28 11:13:46,568 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:46,570 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:46,572 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:46,578 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:46,579 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:46,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 118 [2018-11-28 11:13:46,604 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 8 xjuncts. [2018-11-28 11:13:46,682 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 0 case distinctions, treesize of input 91 treesize of output 96 [2018-11-28 11:13:46,685 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:46,688 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:46,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 62 [2018-11-28 11:13:46,699 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 4 xjuncts. [2018-11-28 11:13:46,742 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:13:46,751 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 0 case distinctions, treesize of input 81 treesize of output 86 [2018-11-28 11:13:46,754 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:46,755 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:46,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:46,757 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:46,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 70 [2018-11-28 11:13:46,757 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-28 11:13:46,778 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:13:46,786 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:46,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 98 [2018-11-28 11:13:46,792 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:46,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:46,793 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:13:46,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 54 [2018-11-28 11:13:46,794 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-28 11:13:46,812 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:13:46,820 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:46,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 98 [2018-11-28 11:13:46,825 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:46,826 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:13:46,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 42 [2018-11-28 11:13:46,826 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-28 11:13:46,842 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:13:46,902 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-28 11:13:47,426 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 105 [2018-11-28 11:13:47,430 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:47,431 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:47,434 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:47,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:47,445 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:47,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 118 [2018-11-28 11:13:47,470 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 8 xjuncts. [2018-11-28 11:13:47,543 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 0 case distinctions, treesize of input 91 treesize of output 96 [2018-11-28 11:13:47,546 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:47,549 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:47,550 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:47,551 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:47,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 66 [2018-11-28 11:13:47,564 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 4 xjuncts. [2018-11-28 11:13:47,611 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:13:47,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:47,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 98 [2018-11-28 11:13:47,630 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:47,634 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:47,634 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:13:47,636 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:47,637 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:47,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 39 treesize of output 74 [2018-11-28 11:13:47,638 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-28 11:13:47,657 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:13:47,667 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 0 case distinctions, treesize of input 81 treesize of output 86 [2018-11-28 11:13:47,670 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:47,671 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:47,672 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:47,674 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:47,675 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:47,676 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:47,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 96 [2018-11-28 11:13:47,677 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-28 11:13:47,699 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:13:47,706 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:47,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 98 [2018-11-28 11:13:47,712 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:47,712 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:13:47,713 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:47,714 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:13:47,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 39 treesize of output 62 [2018-11-28 11:13:47,715 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-28 11:13:47,731 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:13:47,792 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-28 11:13:48,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 3 dim-2 vars, End of recursive call: 57 dim-0 vars, and 14 xjuncts. [2018-11-28 11:13:48,144 INFO L202 ElimStorePlain]: Needed 39 recursive calls to eliminate 15 variables, input treesize:402, output treesize:1429 [2018-11-28 11:13:49,423 WARN L180 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 489 DAG size of output: 424 [2018-11-28 11:13:50,168 WARN L180 SmtUtils]: Spent 509.00 ms on a formula simplification that was a NOOP. DAG size: 437 [2018-11-28 11:14:05,695 WARN L180 SmtUtils]: Spent 14.33 s on a formula simplification. DAG size of input: 456 DAG size of output: 451 [2018-11-28 11:14:06,386 WARN L180 SmtUtils]: Spent 430.00 ms on a formula simplification that was a NOOP. DAG size: 347 [2018-11-28 11:14:07,066 WARN L180 SmtUtils]: Spent 445.00 ms on a formula simplification that was a NOOP. DAG size: 348 [2018-11-28 11:14:07,202 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 2 proven. 65 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-28 11:14:07,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:14:07,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 38 [2018-11-28 11:14:07,217 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:14:07,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:07,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1980647869, now seen corresponding path program 6 times [2018-11-28 11:14:07,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:07,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:07,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:07,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:14:07,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:14:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:14:08,733 WARN L180 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 222 DAG size of output: 165 [2018-11-28 11:14:09,554 WARN L180 SmtUtils]: Spent 813.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-11-28 11:14:09,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-28 11:14:09,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1357, Unknown=0, NotChecked=0, Total=1482 [2018-11-28 11:14:09,555 INFO L87 Difference]: Start difference. First operand 19607 states and 40470 transitions. cyclomatic complexity: 21190 Second operand 39 states. [2018-11-28 11:14:11,526 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2018-11-28 11:14:12,119 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2018-11-28 11:14:12,273 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2018-11-28 11:14:12,705 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 58 [2018-11-28 11:14:15,936 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2018-11-28 11:14:15,936 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkValidity(IncrementalHoareTripleChecker.java:665) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:65) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:980) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:549) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 38 more [2018-11-28 11:14:15,939 INFO L168 Benchmark]: Toolchain (without parser) took 572424.27 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 328.2 MB). Free memory was 949.9 MB in the beginning and 832.2 MB in the end (delta: 117.7 MB). Peak memory consumption was 445.9 MB. Max. memory is 11.5 GB. [2018-11-28 11:14:15,939 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 979.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:14:15,939 INFO L168 Benchmark]: CACSL2BoogieTranslator took 393.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -163.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:14:15,940 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.17 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-28 11:14:15,940 INFO L168 Benchmark]: Boogie Preprocessor took 23.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:14:15,940 INFO L168 Benchmark]: RCFGBuilder took 264.76 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: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2018-11-28 11:14:15,940 INFO L168 Benchmark]: BuchiAutomizer took 571701.23 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 203.9 MB). Free memory was 1.1 GB in the beginning and 832.2 MB in the end (delta: 255.0 MB). Peak memory consumption was 459.0 MB. Max. memory is 11.5 GB. [2018-11-28 11:14:15,941 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 979.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 393.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -163.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.17 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 23.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 264.76 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: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 571701.23 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 203.9 MB). Free memory was 1.1 GB in the beginning and 832.2 MB in the end (delta: 255.0 MB). Peak memory consumption was 459.0 MB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...