./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/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 111460b358d4c09612932eb239746dbb8202adb9 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/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: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:29:01,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:29:01,532 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:29:01,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:29:01,551 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:29:01,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:29:01,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:29:01,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:29:01,571 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:29:01,574 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:29:01,575 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:29:01,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:29:01,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:29:01,578 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:29:01,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:29:01,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:29:01,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:29:01,581 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:29:01,583 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:29:01,585 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:29:01,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:29:01,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:29:01,589 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:29:01,590 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:29:01,592 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:29:01,592 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:29:01,592 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:29:01,593 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:29:01,594 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:29:01,595 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:29:01,595 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:29:01,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:29:01,596 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:29:01,597 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:29:01,598 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:29:01,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:29:01,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:29:01,599 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:29:01,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:29:01,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:29:01,601 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:29:01,602 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-16 00:29:01,620 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:29:01,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:29:01,622 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:29:01,622 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:29:01,623 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:29:01,623 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:29:01,623 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:29:01,623 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:29:01,624 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:29:01,624 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:29:01,624 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:29:01,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:29:01,625 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:29:01,625 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:29:01,625 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:29:01,625 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:29:01,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:29:01,626 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:29:01,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:29:01,626 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:29:01,627 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:29:01,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:29:01,627 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:29:01,627 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:29:01,628 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:29:01,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:29:01,628 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:29:01,628 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:29:01,629 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:29:01,629 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:29:01,629 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:29:01,630 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:29:01,631 INFO L138 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/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/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 -> 111460b358d4c09612932eb239746dbb8202adb9 [2019-11-16 00:29:01,660 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:29:01,671 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:29:01,677 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:29:01,680 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:29:01,680 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:29:01,681 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2019-11-16 00:29:01,749 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/uautomizer/data/ed9b1b00e/8a7f2031174d43e398c261cac7ae2794/FLAGcc8394098 [2019-11-16 00:29:02,347 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:29:02,350 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2019-11-16 00:29:02,374 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/uautomizer/data/ed9b1b00e/8a7f2031174d43e398c261cac7ae2794/FLAGcc8394098 [2019-11-16 00:29:02,630 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/uautomizer/data/ed9b1b00e/8a7f2031174d43e398c261cac7ae2794 [2019-11-16 00:29:02,632 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:29:02,634 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:29:02,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:29:02,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:29:02,640 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:29:02,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:29:02" (1/1) ... [2019-11-16 00:29:02,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a99c76a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:02, skipping insertion in model container [2019-11-16 00:29:02,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:29:02" (1/1) ... [2019-11-16 00:29:02,654 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:29:02,709 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:29:03,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:29:03,194 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:29:03,260 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:29:03,323 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:29:03,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:03 WrapperNode [2019-11-16 00:29:03,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:29:03,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:29:03,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:29:03,326 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:29:03,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:03" (1/1) ... [2019-11-16 00:29:03,357 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:03" (1/1) ... [2019-11-16 00:29:03,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:29:03,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:29:03,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:29:03,385 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:29:03,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:03" (1/1) ... [2019-11-16 00:29:03,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:03" (1/1) ... [2019-11-16 00:29:03,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:03" (1/1) ... [2019-11-16 00:29:03,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:03" (1/1) ... [2019-11-16 00:29:03,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:03" (1/1) ... [2019-11-16 00:29:03,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:03" (1/1) ... [2019-11-16 00:29:03,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:03" (1/1) ... [2019-11-16 00:29:03,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:29:03,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:29:03,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:29:03,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:29:03,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/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 [2019-11-16 00:29:03,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:29:03,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:29:03,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:29:03,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:29:03,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:29:03,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:29:03,908 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:29:03,909 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-16 00:29:03,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:29:03 BoogieIcfgContainer [2019-11-16 00:29:03,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:29:03,911 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:29:03,911 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:29:03,916 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:29:03,916 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:29:03,917 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:29:02" (1/3) ... [2019-11-16 00:29:03,918 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a5e62ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:29:03, skipping insertion in model container [2019-11-16 00:29:03,918 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:29:03,918 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:03" (2/3) ... [2019-11-16 00:29:03,919 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a5e62ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:29:03, skipping insertion in model container [2019-11-16 00:29:03,919 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:29:03,919 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:29:03" (3/3) ... [2019-11-16 00:29:03,921 INFO L371 chiAutomizerObserver]: Analyzing ICFG lis-alloca-1.i [2019-11-16 00:29:03,981 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:29:03,981 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:29:03,982 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:29:03,982 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:29:03,982 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:29:03,982 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:29:03,982 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:29:03,983 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:29:03,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-16 00:29:04,018 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2019-11-16 00:29:04,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:29:04,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:29:04,024 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:29:04,024 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:29:04,024 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:29:04,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-16 00:29:04,027 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2019-11-16 00:29:04,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:29:04,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:29:04,028 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:29:04,028 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:29:04,034 INFO L791 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 15#L530true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 20#L530-2true call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 23#L535-3true [2019-11-16 00:29:04,035 INFO L793 eck$LassoCheckResult]: Loop: 23#L535-3true assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 10#L535-2true main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 23#L535-3true [2019-11-16 00:29:04,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:04,040 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-16 00:29:04,046 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:04,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729075071] [2019-11-16 00:29:04,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:04,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:04,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:04,205 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:04,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:04,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-11-16 00:29:04,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:04,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907840167] [2019-11-16 00:29:04,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:04,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:04,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:04,229 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:04,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:04,231 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-11-16 00:29:04,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:04,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642972967] [2019-11-16 00:29:04,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:04,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:04,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:04,276 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:04,511 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:29:04,512 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:29:04,512 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:29:04,513 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:29:04,513 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:29:04,513 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:29:04,513 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:29:04,514 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:29:04,514 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration1_Lasso [2019-11-16 00:29:04,514 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:29:04,514 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:29:04,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:04,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:04,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:04,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:04,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:04,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:04,717 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-11-16 00:29:04,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:04,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:04,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:04,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:05,199 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:29:05,208 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:29:05,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:05,213 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:05,213 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:05,214 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:05,214 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:05,214 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:05,217 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:05,218 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:05,224 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:05,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:05,230 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:05,230 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:05,230 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:05,231 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:05,232 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:05,233 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:05,233 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:05,236 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:05,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:05,238 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:05,239 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:05,239 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:05,240 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:05,252 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:05,252 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:05,261 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:05,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:05,268 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:05,269 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:05,270 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:05,270 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:05,274 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:05,274 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:05,287 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:05,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:05,293 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:05,294 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:05,294 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:05,294 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:05,294 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:05,295 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:05,296 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:05,297 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:05,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:05,300 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:05,301 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:05,301 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:05,302 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:05,302 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:05,303 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:05,304 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:05,305 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:05,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:05,310 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:05,312 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:05,313 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:05,313 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:05,319 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:05,323 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:05,475 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:29:05,547 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-16 00:29:05,548 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-16 00:29:05,550 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:29:05,552 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-16 00:29:05,553 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:29:05,554 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1, ULTIMATE.start_main_~i~1) = 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 - 4*ULTIMATE.start_main_~i~1 Supporting invariants [1*ULTIMATE.start_main_~numbers~0.offset >= 0] [2019-11-16 00:29:05,568 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-11-16 00:29:05,579 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:29:05,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:05,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:29:05,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:05,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:29:05,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:05,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:29:05,732 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 [2019-11-16 00:29:05,734 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 3 states. [2019-11-16 00:29:05,862 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 3 states. Result 47 states and 74 transitions. Complement of second has 8 states. [2019-11-16 00:29:05,863 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 [2019-11-16 00:29:05,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:29:05,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2019-11-16 00:29:05,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-16 00:29:05,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:29:05,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-16 00:29:05,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:29:05,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-16 00:29:05,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:29:05,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 74 transitions. [2019-11-16 00:29:05,892 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-16 00:29:05,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 21 states and 33 transitions. [2019-11-16 00:29:05,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-16 00:29:05,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-16 00:29:05,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 33 transitions. [2019-11-16 00:29:05,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:29:05,903 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2019-11-16 00:29:05,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 33 transitions. [2019-11-16 00:29:05,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-16 00:29:05,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-16 00:29:05,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2019-11-16 00:29:05,940 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2019-11-16 00:29:05,940 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2019-11-16 00:29:05,941 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:29:05,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 33 transitions. [2019-11-16 00:29:05,944 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-16 00:29:05,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:29:05,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:29:05,945 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:29:05,946 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:29:05,946 INFO L791 eck$LassoCheckResult]: Stem: 156#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 152#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 153#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 157#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 150#L535-3 assume !(main_~i~1 < main_~array_size~0); 151#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 143#L517-3 [2019-11-16 00:29:05,947 INFO L793 eck$LassoCheckResult]: Loop: 143#L517-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); 142#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 143#L517-3 [2019-11-16 00:29:05,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:05,947 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-11-16 00:29:05,949 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:05,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114948307] [2019-11-16 00:29:05,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:05,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:05,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:06,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:29:06,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114948307] [2019-11-16 00:29:06,065 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:29:06,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:29:06,066 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492182817] [2019-11-16 00:29:06,068 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:29:06,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:06,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2019-11-16 00:29:06,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:06,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25899166] [2019-11-16 00:29:06,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:06,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:06,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:06,111 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:06,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:29:06,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:29:06,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:29:06,213 INFO L87 Difference]: Start difference. First operand 21 states and 33 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-11-16 00:29:06,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:29:06,252 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2019-11-16 00:29:06,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:29:06,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2019-11-16 00:29:06,255 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-16 00:29:06,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2019-11-16 00:29:06,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-16 00:29:06,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-16 00:29:06,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2019-11-16 00:29:06,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:29:06,257 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-11-16 00:29:06,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2019-11-16 00:29:06,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-11-16 00:29:06,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-16 00:29:06,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2019-11-16 00:29:06,261 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-11-16 00:29:06,261 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-11-16 00:29:06,262 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:29:06,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2019-11-16 00:29:06,263 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-16 00:29:06,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:29:06,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:29:06,264 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:06,264 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:29:06,265 INFO L791 eck$LassoCheckResult]: Stem: 206#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 200#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 201#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 207#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 202#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 198#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 199#L535-3 assume !(main_~i~1 < main_~array_size~0); 203#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 193#L517-3 [2019-11-16 00:29:06,265 INFO L793 eck$LassoCheckResult]: Loop: 193#L517-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); 192#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 193#L517-3 [2019-11-16 00:29:06,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:06,265 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-11-16 00:29:06,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:06,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801313520] [2019-11-16 00:29:06,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:06,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:06,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:06,316 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:06,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:06,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2019-11-16 00:29:06,318 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:06,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506290530] [2019-11-16 00:29:06,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:06,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:06,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:06,332 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:06,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:06,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1899811567, now seen corresponding path program 1 times [2019-11-16 00:29:06,334 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:06,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105655413] [2019-11-16 00:29:06,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:06,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:06,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:06,429 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:07,063 WARN L191 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 102 [2019-11-16 00:29:07,243 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-16 00:29:07,246 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:29:07,246 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:29:07,247 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:29:07,247 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:29:07,247 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:29:07,247 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:29:07,247 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:29:07,247 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:29:07,247 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration3_Lasso [2019-11-16 00:29:07,248 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:29:07,248 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:29:07,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:07,787 WARN L191 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 88 [2019-11-16 00:29:07,907 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-11-16 00:29:07,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:07,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:07,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:07,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:07,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:07,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:07,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:07,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:07,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:07,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:07,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:07,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:07,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:07,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:07,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:07,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:07,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:07,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:07,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:07,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:07,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:07,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:07,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:07,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:07,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:08,285 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-16 00:29:09,054 WARN L191 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-11-16 00:29:09,182 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-16 00:29:09,312 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:29:09,313 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:29:09,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:09,314 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:09,314 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:09,314 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:09,314 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:09,315 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:09,315 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:09,315 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:09,316 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:09,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:09,317 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:09,318 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:09,318 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:09,318 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:09,328 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:09,328 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:09,332 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:09,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:09,340 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:09,340 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:09,340 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:09,340 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:09,343 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:09,344 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:09,346 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:09,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:09,351 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:09,352 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-16 00:29:09,352 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:09,352 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:09,362 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-16 00:29:09,364 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:09,420 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:09,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:09,421 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:09,422 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:09,422 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:09,422 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:09,424 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:09,424 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:09,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:09,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:09,431 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:09,432 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:09,432 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:09,432 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:09,438 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:09,438 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:09,561 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:29:09,670 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-11-16 00:29:09,671 INFO L444 ModelExtractionUtils]: 46 out of 58 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-11-16 00:29:09,671 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:29:09,673 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-16 00:29:09,673 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:29:09,674 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~prev~0.offset) = -4*ULTIMATE.start_lis_~i~0 - 1*ULTIMATE.start_lis_~prev~0.offset + 2 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_lis_~prev~0.base)_1 + 4 >= 0] [2019-11-16 00:29:09,755 INFO L297 tatePredicateManager]: 18 out of 19 supporting invariants were superfluous and have been removed [2019-11-16 00:29:09,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:09,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:29:09,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:09,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:29:09,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:09,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:29:09,958 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2019-11-16 00:29:09,958 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12 Second operand 6 states. [2019-11-16 00:29:10,201 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12. Second operand 6 states. Result 38 states and 53 transitions. Complement of second has 13 states. [2019-11-16 00:29:10,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2019-11-16 00:29:10,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-16 00:29:10,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2019-11-16 00:29:10,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-16 00:29:10,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:29:10,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-16 00:29:10,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:29:10,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 8 letters. Loop has 4 letters. [2019-11-16 00:29:10,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:29:10,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2019-11-16 00:29:10,207 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-16 00:29:10,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 36 states and 49 transitions. [2019-11-16 00:29:10,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-16 00:29:10,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-16 00:29:10,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 49 transitions. [2019-11-16 00:29:10,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:29:10,211 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 49 transitions. [2019-11-16 00:29:10,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 49 transitions. [2019-11-16 00:29:10,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2019-11-16 00:29:10,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-16 00:29:10,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2019-11-16 00:29:10,222 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2019-11-16 00:29:10,222 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2019-11-16 00:29:10,222 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:29:10,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 43 transitions. [2019-11-16 00:29:10,226 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-16 00:29:10,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:29:10,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:29:10,228 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:10,228 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:29:10,229 INFO L791 eck$LassoCheckResult]: Stem: 425#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 416#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 417#L530 assume main_~array_size~0 < 1 || main_~array_size~0 >= 536870911;main_~array_size~0 := 1; 426#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 433#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 414#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 415#L535-3 assume !(main_~i~1 < main_~array_size~0); 431#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 430#L517-3 assume !(lis_~i~0 < lis_~N); 411#L517-4 lis_~i~0 := 1; 403#L519-3 [2019-11-16 00:29:10,230 INFO L793 eck$LassoCheckResult]: Loop: 403#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 405#L520-3 assume !(lis_~j~0 < lis_~i~0); 429#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 403#L519-3 [2019-11-16 00:29:10,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:10,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1090464999, now seen corresponding path program 1 times [2019-11-16 00:29:10,230 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:10,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427720209] [2019-11-16 00:29:10,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:10,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:10,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:10,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:29:10,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427720209] [2019-11-16 00:29:10,289 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:29:10,289 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:29:10,289 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087978669] [2019-11-16 00:29:10,289 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:29:10,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:10,290 INFO L82 PathProgramCache]: Analyzing trace with hash 74687, now seen corresponding path program 1 times [2019-11-16 00:29:10,290 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:10,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135397307] [2019-11-16 00:29:10,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:10,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:10,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:10,299 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:10,326 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:29:10,326 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:29:10,326 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:29:10,327 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:29:10,327 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:29:10,327 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:29:10,327 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:29:10,327 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:29:10,327 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2019-11-16 00:29:10,327 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:29:10,328 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:29:10,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:10,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:10,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:10,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:10,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:10,479 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:29:10,480 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/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 [2019-11-16 00:29:10,498 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:29:10,499 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:29:10,506 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:29:10,507 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_3=1} Honda state: {v_rep~unnamed0~0~P_PID_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:29:10,525 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:29:10,525 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:29:10,534 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:29:10,535 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_3=2} Honda state: {v_rep~unnamed0~0~P_PGID_3=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:29:10,604 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:29:10,604 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:29:10,632 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:29:10,632 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:29:10,803 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:29:10,805 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:29:10,805 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:29:10,805 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:29:10,805 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:29:10,805 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:29:10,805 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:29:10,805 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:29:10,805 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:29:10,805 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2019-11-16 00:29:10,805 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:29:10,806 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:29:10,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:10,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:10,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:10,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:10,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:10,918 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:29:10,919 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:29:10,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:10,920 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:10,920 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:10,920 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:10,920 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:10,921 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:10,921 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:10,923 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:10,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:10,924 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:10,925 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:10,925 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:10,925 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:10,926 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:10,926 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:10,932 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:10,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:10,933 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:10,934 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:10,934 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:10,934 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:10,934 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:10,935 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:10,935 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:10,937 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:29:10,944 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:29:10,945 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:29:10,945 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:29:10,945 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:29:10,946 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:29:10,946 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0) = -2*ULTIMATE.start_lis_~i~0 + 1 Supporting invariants [] [2019-11-16 00:29:10,946 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:29:10,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:11,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:29:11,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:11,007 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:29:11,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:11,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:29:11,038 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 [2019-11-16 00:29:11,038 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 43 transitions. cyclomatic complexity: 18 Second operand 4 states. [2019-11-16 00:29:11,127 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 43 transitions. cyclomatic complexity: 18. Second operand 4 states. Result 52 states and 79 transitions. Complement of second has 9 states. [2019-11-16 00:29:11,128 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 [2019-11-16 00:29:11,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:29:11,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2019-11-16 00:29:11,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-16 00:29:11,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:29:11,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 13 letters. Loop has 3 letters. [2019-11-16 00:29:11,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:29:11,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-16 00:29:11,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:29:11,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 79 transitions. [2019-11-16 00:29:11,133 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-16 00:29:11,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 50 states and 74 transitions. [2019-11-16 00:29:11,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-16 00:29:11,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-16 00:29:11,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 74 transitions. [2019-11-16 00:29:11,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:29:11,135 INFO L688 BuchiCegarLoop]: Abstraction has 50 states and 74 transitions. [2019-11-16 00:29:11,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 74 transitions. [2019-11-16 00:29:11,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2019-11-16 00:29:11,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-16 00:29:11,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2019-11-16 00:29:11,140 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 62 transitions. [2019-11-16 00:29:11,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:29:11,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:29:11,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:29:11,141 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand 4 states. [2019-11-16 00:29:11,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:29:11,205 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2019-11-16 00:29:11,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:29:11,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 64 transitions. [2019-11-16 00:29:11,207 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-16 00:29:11,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 64 transitions. [2019-11-16 00:29:11,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-16 00:29:11,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-16 00:29:11,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 64 transitions. [2019-11-16 00:29:11,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:29:11,208 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 64 transitions. [2019-11-16 00:29:11,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 64 transitions. [2019-11-16 00:29:11,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-11-16 00:29:11,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-16 00:29:11,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 62 transitions. [2019-11-16 00:29:11,212 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 62 transitions. [2019-11-16 00:29:11,213 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 62 transitions. [2019-11-16 00:29:11,213 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:29:11,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 62 transitions. [2019-11-16 00:29:11,214 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-16 00:29:11,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:29:11,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:29:11,215 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:11,215 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:29:11,215 INFO L791 eck$LassoCheckResult]: Stem: 668#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 660#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 661#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 671#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 685#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 684#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 683#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 682#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 681#L535-3 assume !(main_~i~1 < main_~array_size~0); 669#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 653#L517-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); 648#L517-2 [2019-11-16 00:29:11,215 INFO L793 eck$LassoCheckResult]: Loop: 648#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 649#L517-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); 648#L517-2 [2019-11-16 00:29:11,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:11,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2019-11-16 00:29:11,216 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:11,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758171405] [2019-11-16 00:29:11,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:11,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:11,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:11,277 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:11,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:11,279 INFO L82 PathProgramCache]: Analyzing trace with hash 2015, now seen corresponding path program 3 times [2019-11-16 00:29:11,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:11,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205407958] [2019-11-16 00:29:11,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:11,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:11,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:11,290 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:11,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:11,291 INFO L82 PathProgramCache]: Analyzing trace with hash -856885748, now seen corresponding path program 2 times [2019-11-16 00:29:11,291 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:11,291 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191698733] [2019-11-16 00:29:11,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:11,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:11,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:11,362 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:12,324 WARN L191 SmtUtils]: Spent 881.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 129 [2019-11-16 00:29:12,528 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-11-16 00:29:12,530 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:29:12,530 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:29:12,530 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:29:12,530 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:29:12,530 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:29:12,531 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:29:12,531 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:29:12,531 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:29:12,531 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration5_Lasso [2019-11-16 00:29:12,531 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:29:12,531 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:29:12,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:12,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:12,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:12,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:12,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:12,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:12,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:12,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:12,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:12,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:12,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:12,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:12,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:12,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:12,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:12,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:12,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:12,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:12,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:13,076 WARN L191 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2019-11-16 00:29:13,256 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-11-16 00:29:13,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:13,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:13,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:13,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:13,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:13,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:13,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:13,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:13,670 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-11-16 00:29:14,393 WARN L191 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-11-16 00:29:14,558 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-16 00:29:14,623 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:29:14,624 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:29:14,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:14,625 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:14,625 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:14,625 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:14,626 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:14,626 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:14,626 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:14,626 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:14,627 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:14,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:14,628 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:14,629 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:14,629 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:14,629 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:14,630 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:14,630 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:14,632 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:14,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:14,633 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:14,633 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:14,633 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:14,633 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:14,633 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:14,634 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:14,634 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:14,634 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:14,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:14,635 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:14,636 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:14,636 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:14,636 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:14,636 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:14,637 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:14,637 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:14,638 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:14,638 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:14,639 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:14,639 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:14,639 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:14,639 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:14,640 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:14,640 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:14,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:14,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:14,644 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:14,645 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:14,645 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:14,645 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:14,645 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:14,646 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:14,646 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:14,646 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:14,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:14,647 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:14,647 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:14,648 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:14,648 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:14,648 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:14,648 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:14,649 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:14,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:14,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:14,650 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:14,650 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:14,651 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:14,651 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:14,651 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:14,651 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:14,652 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:14,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:14,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:14,653 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:14,653 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:14,654 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:14,654 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:14,655 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:14,655 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:14,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:14,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:14,657 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:14,658 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:14,658 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:14,658 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:14,658 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:14,658 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:14,659 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:14,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:14,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:14,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:14,661 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:14,661 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:14,661 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:14,661 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:14,662 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:14,662 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:14,662 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:14,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:14,663 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:14,664 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:14,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:14,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:14,665 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:14,665 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:14,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:14,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:14,667 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:14,668 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:14,668 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:14,668 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:14,668 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:14,669 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:14,669 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:14,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:14,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:14,670 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:14,671 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:14,671 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:14,671 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:14,672 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:14,672 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:14,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:14,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:14,674 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:14,674 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:14,675 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:14,675 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:14,675 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:14,675 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:14,676 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:14,676 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:14,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:14,677 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:14,677 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:14,678 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:14,678 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:14,678 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:14,679 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:14,679 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:14,679 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:14,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:14,680 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:14,681 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:14,681 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:14,681 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:14,681 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:14,682 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:14,682 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:14,682 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:14,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:14,683 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:14,684 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:14,684 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:14,684 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:14,684 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:14,684 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:14,685 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:14,685 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:14,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:14,686 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:14,687 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:14,687 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:14,687 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:14,688 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:14,688 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:14,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:14,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:14,690 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:14,691 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-16 00:29:14,691 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:14,691 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:14,696 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-16 00:29:14,696 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:14,721 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:14,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:14,723 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:14,723 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:14,723 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:14,723 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:14,724 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:14,724 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:14,730 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:14,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:14,731 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:14,731 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:14,731 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:14,731 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:14,732 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:14,732 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:14,734 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:14,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:14,735 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:14,735 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:14,735 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:14,737 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:14,738 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:14,738 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:14,740 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:14,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:14,742 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:14,743 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:14,743 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:14,743 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:14,744 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:14,744 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:14,748 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:14,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:14,749 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:14,750 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:14,750 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:14,750 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:14,751 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:14,751 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:14,755 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:14,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:14,756 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:14,757 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:14,757 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:14,757 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:14,761 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:14,762 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:14,836 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:29:14,885 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:29:14,886 INFO L444 ModelExtractionUtils]: 56 out of 61 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:29:14,886 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:29:14,888 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:29:14,888 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:29:14,888 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_~i~0, v_rep(select #length ULTIMATE.start_lis_~best~0.base)_2) = -1*ULTIMATE.start_lis_~best~0.offset - 4*ULTIMATE.start_lis_~i~0 + 1*v_rep(select #length ULTIMATE.start_lis_~best~0.base)_2 Supporting invariants [] [2019-11-16 00:29:15,000 INFO L297 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2019-11-16 00:29:15,002 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:29:15,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:15,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:29:15,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:15,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:29:15,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:29:15,061 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 [2019-11-16 00:29:15,062 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 62 transitions. cyclomatic complexity: 26 Second operand 3 states. [2019-11-16 00:29:15,092 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 62 transitions. cyclomatic complexity: 26. Second operand 3 states. Result 48 states and 68 transitions. Complement of second has 5 states. [2019-11-16 00:29:15,094 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 [2019-11-16 00:29:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:29:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2019-11-16 00:29:15,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 2 letters. [2019-11-16 00:29:15,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:29:15,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 13 letters. Loop has 2 letters. [2019-11-16 00:29:15,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:29:15,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-16 00:29:15,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:29:15,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 68 transitions. [2019-11-16 00:29:15,097 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-16 00:29:15,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 46 states and 66 transitions. [2019-11-16 00:29:15,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-16 00:29:15,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-16 00:29:15,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 66 transitions. [2019-11-16 00:29:15,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:29:15,099 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 66 transitions. [2019-11-16 00:29:15,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 66 transitions. [2019-11-16 00:29:15,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-11-16 00:29:15,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-16 00:29:15,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 62 transitions. [2019-11-16 00:29:15,102 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 62 transitions. [2019-11-16 00:29:15,102 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 62 transitions. [2019-11-16 00:29:15,102 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:29:15,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 62 transitions. [2019-11-16 00:29:15,103 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-16 00:29:15,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:29:15,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:29:15,104 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:15,104 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:15,105 INFO L791 eck$LassoCheckResult]: Stem: 923#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 915#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 916#L530 assume main_~array_size~0 < 1 || main_~array_size~0 >= 536870911;main_~array_size~0 := 1; 924#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 917#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 913#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 914#L535-3 assume !(main_~i~1 < main_~array_size~0); 918#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 908#L517-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); 906#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 905#L517-3 assume !(lis_~i~0 < lis_~N); 911#L517-4 lis_~i~0 := 1; 912#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 900#L520-3 [2019-11-16 00:29:15,105 INFO L793 eck$LassoCheckResult]: Loop: 900#L520-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; 919#L521 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; 920#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9; 926#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 928#L520-3 assume !(lis_~j~0 < lis_~i~0); 931#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 898#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 900#L520-3 [2019-11-16 00:29:15,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:15,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1091598674, now seen corresponding path program 1 times [2019-11-16 00:29:15,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:15,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943475361] [2019-11-16 00:29:15,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:15,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:15,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:15,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:29:15,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943475361] [2019-11-16 00:29:15,163 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:29:15,163 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:29:15,163 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805799673] [2019-11-16 00:29:15,164 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:29:15,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:15,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 1 times [2019-11-16 00:29:15,164 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:15,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610993036] [2019-11-16 00:29:15,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:15,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:15,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:15,176 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:15,385 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-11-16 00:29:15,443 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:29:15,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:29:15,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:29:15,444 INFO L87 Difference]: Start difference. First operand 43 states and 62 transitions. cyclomatic complexity: 25 Second operand 5 states. [2019-11-16 00:29:15,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:29:15,498 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2019-11-16 00:29:15,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:29:15,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 75 transitions. [2019-11-16 00:29:15,500 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-16 00:29:15,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 75 transitions. [2019-11-16 00:29:15,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-11-16 00:29:15,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2019-11-16 00:29:15,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 75 transitions. [2019-11-16 00:29:15,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:29:15,502 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 75 transitions. [2019-11-16 00:29:15,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 75 transitions. [2019-11-16 00:29:15,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2019-11-16 00:29:15,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-16 00:29:15,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2019-11-16 00:29:15,506 INFO L711 BuchiCegarLoop]: Abstraction has 50 states and 70 transitions. [2019-11-16 00:29:15,507 INFO L591 BuchiCegarLoop]: Abstraction has 50 states and 70 transitions. [2019-11-16 00:29:15,507 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:29:15,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 70 transitions. [2019-11-16 00:29:15,508 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-16 00:29:15,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:29:15,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:29:15,509 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:15,509 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:15,509 INFO L791 eck$LassoCheckResult]: Stem: 1033#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1025#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1026#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1035#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1052#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1051#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1049#L535-3 assume !(main_~i~1 < main_~array_size~0); 1050#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1056#L517-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); 1055#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1013#L517-3 assume !(lis_~i~0 < lis_~N); 1021#L517-4 lis_~i~0 := 1; 1022#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1040#L520-3 [2019-11-16 00:29:15,510 INFO L793 eck$LassoCheckResult]: Loop: 1040#L520-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; 1029#L521 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; 1030#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9; 1036#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1038#L520-3 assume !(lis_~j~0 < lis_~i~0); 1042#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1043#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1040#L520-3 [2019-11-16 00:29:15,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:15,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1792663252, now seen corresponding path program 1 times [2019-11-16 00:29:15,510 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:15,510 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135734405] [2019-11-16 00:29:15,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:15,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:15,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:15,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:29:15,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135734405] [2019-11-16 00:29:15,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543229086] [2019-11-16 00:29:15,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:29:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:15,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:29:15,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:15,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:29:15,702 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:29:15,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-16 00:29:15,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76273321] [2019-11-16 00:29:15,703 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:29:15,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:15,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 2 times [2019-11-16 00:29:15,703 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:15,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969858631] [2019-11-16 00:29:15,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:15,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:15,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:15,726 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:15,939 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-11-16 00:29:15,993 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:29:15,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:29:15,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:29:15,994 INFO L87 Difference]: Start difference. First operand 50 states and 70 transitions. cyclomatic complexity: 27 Second operand 9 states. [2019-11-16 00:29:16,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:29:16,175 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2019-11-16 00:29:16,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:29:16,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 83 transitions. [2019-11-16 00:29:16,177 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-16 00:29:16,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 83 transitions. [2019-11-16 00:29:16,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-11-16 00:29:16,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-11-16 00:29:16,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 83 transitions. [2019-11-16 00:29:16,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:29:16,179 INFO L688 BuchiCegarLoop]: Abstraction has 61 states and 83 transitions. [2019-11-16 00:29:16,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 83 transitions. [2019-11-16 00:29:16,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 48. [2019-11-16 00:29:16,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-16 00:29:16,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2019-11-16 00:29:16,183 INFO L711 BuchiCegarLoop]: Abstraction has 48 states and 68 transitions. [2019-11-16 00:29:16,183 INFO L591 BuchiCegarLoop]: Abstraction has 48 states and 68 transitions. [2019-11-16 00:29:16,184 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-16 00:29:16,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 68 transitions. [2019-11-16 00:29:16,184 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-16 00:29:16,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:29:16,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:29:16,186 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:16,186 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:29:16,186 INFO L791 eck$LassoCheckResult]: Stem: 1200#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1192#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1193#L530 assume main_~array_size~0 < 1 || main_~array_size~0 >= 536870911;main_~array_size~0 := 1; 1202#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1194#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1190#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1191#L535-3 assume !(main_~i~1 < main_~array_size~0); 1195#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1201#L517-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); 1184#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1186#L517-3 assume !(lis_~i~0 < lis_~N); 1187#L517-4 lis_~i~0 := 1; 1176#L519-3 assume !(lis_~i~0 < lis_~N); 1177#L519-4 lis_~i~0 := 0; 1180#L523-3 [2019-11-16 00:29:16,186 INFO L793 eck$LassoCheckResult]: Loop: 1180#L523-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); 1188#L524 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; 1189#L523-2 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 1180#L523-3 [2019-11-16 00:29:16,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:16,187 INFO L82 PathProgramCache]: Analyzing trace with hash -520179462, now seen corresponding path program 1 times [2019-11-16 00:29:16,187 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:16,187 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315824105] [2019-11-16 00:29:16,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:16,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:16,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:16,211 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:16,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:16,211 INFO L82 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 1 times [2019-11-16 00:29:16,212 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:16,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396504670] [2019-11-16 00:29:16,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:16,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:16,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:16,219 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:16,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:16,220 INFO L82 PathProgramCache]: Analyzing trace with hash -424266948, now seen corresponding path program 1 times [2019-11-16 00:29:16,220 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:16,220 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731255648] [2019-11-16 00:29:16,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:16,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:16,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:16,247 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:17,075 WARN L191 SmtUtils]: Spent 782.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 133 [2019-11-16 00:29:17,266 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-16 00:29:17,269 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:29:17,269 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:29:17,269 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:29:17,269 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:29:17,269 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:29:17,269 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:29:17,269 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:29:17,269 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:29:17,269 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration8_Lasso [2019-11-16 00:29:17,269 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:29:17,270 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:29:17,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:17,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:17,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:17,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:17,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:17,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:17,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:17,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:17,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:17,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:17,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:17,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:17,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:17,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:17,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:17,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:17,757 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-11-16 00:29:17,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:17,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:17,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:17,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:17,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:17,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:17,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:17,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:17,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:17,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:17,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:18,076 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-11-16 00:29:18,935 WARN L191 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-11-16 00:29:18,962 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:29:18,962 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:29:18,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:18,963 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:18,963 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:18,963 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:18,963 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:18,963 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:18,964 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:18,964 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:18,964 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:18,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:18,965 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:18,965 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:18,965 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:18,965 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:18,968 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:18,968 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:18,969 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:18,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:18,970 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:18,970 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:18,971 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:18,971 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:18,971 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:18,971 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:18,972 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:18,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:18,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:18,973 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:18,973 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:18,973 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:18,974 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:18,974 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:18,974 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:18,974 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:18,975 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:18,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:18,976 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:18,976 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:18,976 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:18,976 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:18,977 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:18,977 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:18,977 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:18,978 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:18,978 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:18,978 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:18,979 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:18,979 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:18,979 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:18,980 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:18,980 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:18,981 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:18,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:18,982 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:18,983 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:18,983 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:18,983 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:18,984 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:18,984 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:18,985 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:18,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:18,986 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:18,986 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:18,986 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:18,987 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:18,987 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:18,987 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:18,989 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:18,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:18,990 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:18,990 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:18,990 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:18,990 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:18,990 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:18,991 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:18,991 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:18,991 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:18,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:18,992 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:18,993 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:18,993 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:18,993 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:18,993 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:18,993 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:18,994 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:18,994 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:18,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:18,995 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:18,995 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:18,996 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:18,996 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:18,996 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:18,996 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:18,997 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:18,997 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:18,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:18,998 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:18,998 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:18,998 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:18,999 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:18,999 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:18,999 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:18,999 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:19,000 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:19,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:19,001 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:19,001 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:19,001 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:19,001 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:19,002 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:19,002 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:19,002 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:19,003 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:19,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:19,004 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:19,004 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:19,004 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:19,004 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:19,004 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:19,005 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:19,005 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:19,005 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:19,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:19,006 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:19,007 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:19,007 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:19,007 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:19,008 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:19,008 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:19,009 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:19,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:19,010 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:19,010 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:19,010 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:19,010 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:19,011 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:19,012 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:19,015 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:19,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:19,016 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:19,016 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:19,017 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:19,017 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:19,017 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:19,018 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:19,019 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:19,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:19,020 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:19,020 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:19,021 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:19,021 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:19,024 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:19,024 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:19,057 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:29:19,078 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-16 00:29:19,079 INFO L444 ModelExtractionUtils]: 40 out of 49 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-11-16 00:29:19,079 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:29:19,080 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:29:19,081 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:29:19,081 INFO L512 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 [] [2019-11-16 00:29:19,156 INFO L297 tatePredicateManager]: 19 out of 19 supporting invariants were superfluous and have been removed [2019-11-16 00:29:19,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:19,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:29:19,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:19,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:29:19,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:19,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:29:19,221 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 [2019-11-16 00:29:19,221 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 68 transitions. cyclomatic complexity: 27 Second operand 3 states. [2019-11-16 00:29:19,240 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 68 transitions. cyclomatic complexity: 27. Second operand 3 states. Result 51 states and 73 transitions. Complement of second has 4 states. [2019-11-16 00:29:19,240 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 [2019-11-16 00:29:19,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:29:19,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2019-11-16 00:29:19,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-16 00:29:19,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:29:19,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 17 letters. Loop has 3 letters. [2019-11-16 00:29:19,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:29:19,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-16 00:29:19,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:29:19,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 73 transitions. [2019-11-16 00:29:19,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:29:19,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 33 states and 45 transitions. [2019-11-16 00:29:19,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-16 00:29:19,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-16 00:29:19,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 45 transitions. [2019-11-16 00:29:19,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:29:19,244 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2019-11-16 00:29:19,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 45 transitions. [2019-11-16 00:29:19,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-16 00:29:19,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-16 00:29:19,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2019-11-16 00:29:19,246 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2019-11-16 00:29:19,246 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2019-11-16 00:29:19,247 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-16 00:29:19,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 45 transitions. [2019-11-16 00:29:19,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:29:19,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:29:19,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:29:19,252 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:19,252 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:19,252 INFO L791 eck$LassoCheckResult]: Stem: 1442#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1434#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1435#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1445#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1436#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1432#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1433#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1437#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1452#L535-3 assume !(main_~i~1 < main_~array_size~0); 1443#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1444#L517-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); 1426#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1428#L517-3 assume !(lis_~i~0 < lis_~N); 1430#L517-4 lis_~i~0 := 1; 1431#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1423#L520-3 [2019-11-16 00:29:19,252 INFO L793 eck$LassoCheckResult]: Loop: 1423#L520-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; 1438#L521 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; 1439#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9; 1446#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1448#L520-3 assume !(lis_~j~0 < lis_~i~0); 1450#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1422#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1423#L520-3 [2019-11-16 00:29:19,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:19,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1166516274, now seen corresponding path program 2 times [2019-11-16 00:29:19,253 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:19,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890417092] [2019-11-16 00:29:19,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:19,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:19,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:19,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:29:19,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890417092] [2019-11-16 00:29:19,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050623119] [2019-11-16 00:29:19,355 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:29:19,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:29:19,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:29:19,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:29:19,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:29:19,537 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:29:19,537 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2019-11-16 00:29:19,537 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326335001] [2019-11-16 00:29:19,537 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:29:19,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:19,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 3 times [2019-11-16 00:29:19,538 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:19,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842577358] [2019-11-16 00:29:19,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:19,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:19,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:19,550 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:19,749 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-11-16 00:29:19,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:29:19,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:29:19,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:29:19,800 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. cyclomatic complexity: 16 Second operand 12 states. [2019-11-16 00:29:20,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:29:20,088 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2019-11-16 00:29:20,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:29:20,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 68 transitions. [2019-11-16 00:29:20,090 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-11-16 00:29:20,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 48 states and 67 transitions. [2019-11-16 00:29:20,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-16 00:29:20,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-16 00:29:20,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 67 transitions. [2019-11-16 00:29:20,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:29:20,091 INFO L688 BuchiCegarLoop]: Abstraction has 48 states and 67 transitions. [2019-11-16 00:29:20,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 67 transitions. [2019-11-16 00:29:20,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 33. [2019-11-16 00:29:20,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-16 00:29:20,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2019-11-16 00:29:20,094 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-11-16 00:29:20,094 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-11-16 00:29:20,094 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-16 00:29:20,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 44 transitions. [2019-11-16 00:29:20,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:29:20,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:29:20,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:29:20,096 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:20,096 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:20,096 INFO L791 eck$LassoCheckResult]: Stem: 1592#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1584#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1585#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1595#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1586#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1582#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1583#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1587#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1603#L535-3 assume !(main_~i~1 < main_~array_size~0); 1593#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1594#L517-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); 1576#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1577#L517-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); 1578#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1579#L517-3 assume !(lis_~i~0 < lis_~N); 1580#L517-4 lis_~i~0 := 1; 1581#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1573#L520-3 [2019-11-16 00:29:20,096 INFO L793 eck$LassoCheckResult]: Loop: 1573#L520-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; 1588#L521 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; 1589#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9; 1596#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1598#L520-3 assume !(lis_~j~0 < lis_~i~0); 1601#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1572#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1573#L520-3 [2019-11-16 00:29:20,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:20,096 INFO L82 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 3 times [2019-11-16 00:29:20,097 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:20,097 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089829461] [2019-11-16 00:29:20,097 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:20,097 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:20,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:20,126 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:20,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:20,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 4 times [2019-11-16 00:29:20,126 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:20,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578098877] [2019-11-16 00:29:20,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:20,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:20,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:20,137 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:20,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:20,138 INFO L82 PathProgramCache]: Analyzing trace with hash 502604869, now seen corresponding path program 1 times [2019-11-16 00:29:20,138 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:20,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650026116] [2019-11-16 00:29:20,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:20,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:20,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:20,223 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:29:20,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650026116] [2019-11-16 00:29:20,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057347372] [2019-11-16 00:29:20,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:29:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:20,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:29:20,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:20,482 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-16 00:29:20,482 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:29:20,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-16 00:29:20,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42771074] [2019-11-16 00:29:20,649 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-11-16 00:29:20,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:29:20,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:29:20,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:29:20,687 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. cyclomatic complexity: 15 Second operand 16 states. [2019-11-16 00:29:20,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:29:20,919 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2019-11-16 00:29:20,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:29:20,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 78 transitions. [2019-11-16 00:29:20,920 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-11-16 00:29:20,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 49 states and 64 transitions. [2019-11-16 00:29:20,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-16 00:29:20,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-16 00:29:20,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 64 transitions. [2019-11-16 00:29:20,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:29:20,922 INFO L688 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2019-11-16 00:29:20,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 64 transitions. [2019-11-16 00:29:20,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-11-16 00:29:20,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-16 00:29:20,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-11-16 00:29:20,926 INFO L711 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-11-16 00:29:20,926 INFO L591 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-11-16 00:29:20,926 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-16 00:29:20,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 62 transitions. [2019-11-16 00:29:20,927 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-11-16 00:29:20,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:29:20,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:29:20,928 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:20,928 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:29:20,929 INFO L791 eck$LassoCheckResult]: Stem: 1786#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1778#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1779#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1789#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1780#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1776#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1777#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1781#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1810#L535-3 assume !(main_~i~1 < main_~array_size~0); 1787#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1788#L517-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); 1806#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1805#L517-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); 1804#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1803#L517-3 assume !(lis_~i~0 < lis_~N); 1802#L517-4 lis_~i~0 := 1; 1801#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1793#L520-3 [2019-11-16 00:29:20,929 INFO L793 eck$LassoCheckResult]: Loop: 1793#L520-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; 1800#L521 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; 1790#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9; 1791#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1793#L520-3 [2019-11-16 00:29:20,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:20,929 INFO L82 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 4 times [2019-11-16 00:29:20,930 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:20,930 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16219297] [2019-11-16 00:29:20,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:20,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:20,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:20,964 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:20,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:20,967 INFO L82 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 1 times [2019-11-16 00:29:20,967 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:20,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615086380] [2019-11-16 00:29:20,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:20,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:20,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:20,984 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:20,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:20,985 INFO L82 PathProgramCache]: Analyzing trace with hash 2057178037, now seen corresponding path program 1 times [2019-11-16 00:29:20,986 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:20,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708956145] [2019-11-16 00:29:20,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:20,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:20,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:21,705 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:29:21,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708956145] [2019-11-16 00:29:21,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688271674] [2019-11-16 00:29:21,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:29:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:21,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-16 00:29:21,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:21,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-16 00:29:21,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:21,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:21,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:29:21,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-11-16 00:29:21,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 39 treesize of output 23 [2019-11-16 00:29:21,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:21,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:21,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:29:21,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2019-11-16 00:29:22,025 INFO L341 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2019-11-16 00:29:22,025 INFO L375 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 2 case distinctions, treesize of input 48 treesize of output 39 [2019-11-16 00:29:22,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:22,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:22,039 INFO L496 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. [2019-11-16 00:29:22,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:37 [2019-11-16 00:29:22,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:29:22,254 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:29:22,254 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 21 [2019-11-16 00:29:22,254 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960266021] [2019-11-16 00:29:22,408 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-11-16 00:29:22,447 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:29:22,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-16 00:29:22,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:29:22,448 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. cyclomatic complexity: 21 Second operand 21 states. [2019-11-16 00:29:23,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:29:23,708 INFO L93 Difference]: Finished difference Result 112 states and 154 transitions. [2019-11-16 00:29:23,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-16 00:29:23,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 154 transitions. [2019-11-16 00:29:23,711 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 26 [2019-11-16 00:29:23,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 112 states and 154 transitions. [2019-11-16 00:29:23,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2019-11-16 00:29:23,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2019-11-16 00:29:23,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 154 transitions. [2019-11-16 00:29:23,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:29:23,713 INFO L688 BuchiCegarLoop]: Abstraction has 112 states and 154 transitions. [2019-11-16 00:29:23,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 154 transitions. [2019-11-16 00:29:23,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 74. [2019-11-16 00:29:23,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-16 00:29:23,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2019-11-16 00:29:23,718 INFO L711 BuchiCegarLoop]: Abstraction has 74 states and 100 transitions. [2019-11-16 00:29:23,719 INFO L591 BuchiCegarLoop]: Abstraction has 74 states and 100 transitions. [2019-11-16 00:29:23,719 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-16 00:29:23,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 100 transitions. [2019-11-16 00:29:23,719 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 19 [2019-11-16 00:29:23,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:29:23,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:29:23,720 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:23,720 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:29:23,721 INFO L791 eck$LassoCheckResult]: Stem: 2055#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2045#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 2046#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2058#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 2047#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 2048#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2049#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 2050#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2087#L535-3 assume !(main_~i~1 < main_~array_size~0); 2086#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 2085#L517-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); 2034#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2035#L517-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); 2036#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2037#L517-3 assume !(lis_~i~0 < lis_~N); 2042#L517-4 lis_~i~0 := 1; 2030#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2031#L520-3 [2019-11-16 00:29:23,721 INFO L793 eck$LassoCheckResult]: Loop: 2031#L520-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; 2097#L521 assume !lis_#t~short11; 2092#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9; 2063#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2031#L520-3 [2019-11-16 00:29:23,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:23,721 INFO L82 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 5 times [2019-11-16 00:29:23,721 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:23,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090000522] [2019-11-16 00:29:23,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:23,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:23,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:23,758 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:23,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:23,759 INFO L82 PathProgramCache]: Analyzing trace with hash 2560232, now seen corresponding path program 1 times [2019-11-16 00:29:23,759 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:23,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055142883] [2019-11-16 00:29:23,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:23,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:23,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:23,766 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:23,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:23,767 INFO L82 PathProgramCache]: Analyzing trace with hash 2057179959, now seen corresponding path program 1 times [2019-11-16 00:29:23,767 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:23,767 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22435154] [2019-11-16 00:29:23,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:23,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:23,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:23,814 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:25,092 WARN L191 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 193 DAG size of output: 151 [2019-11-16 00:29:25,445 WARN L191 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-11-16 00:29:25,448 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:29:25,448 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:29:25,448 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:29:25,448 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:29:25,448 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:29:25,448 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:29:25,448 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:29:25,448 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:29:25,449 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration12_Lasso [2019-11-16 00:29:25,449 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:29:25,449 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:29:25,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:25,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:25,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:25,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:25,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:25,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:25,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:25,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:25,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:25,940 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2019-11-16 00:29:25,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:25,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:25,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:25,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:25,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:25,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:25,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:25,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:25,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:25,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:25,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:25,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:25,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:25,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:25,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:26,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:26,339 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-11-16 00:29:26,998 WARN L191 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-11-16 00:29:27,167 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:29:27,167 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:29:27,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:27,168 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:27,168 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:27,168 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:27,168 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:27,169 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:27,169 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:27,170 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:27,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:27,171 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:27,171 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:27,171 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:27,171 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:27,172 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:27,172 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:27,172 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:27,172 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:27,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:27,173 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:27,173 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:27,173 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:27,173 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:27,173 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:27,174 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:27,174 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:27,174 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:27,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:27,175 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:27,175 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:27,175 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:27,175 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:27,175 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:27,175 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:27,175 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:27,176 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:27,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:27,176 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:27,177 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:27,177 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:27,177 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:27,177 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:27,177 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:27,179 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:27,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:27,181 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:27,181 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:27,182 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:27,182 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:27,182 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:27,182 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:27,182 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:27,183 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:27,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:27,184 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:27,184 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:27,184 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:27,184 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:27,185 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:27,185 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:27,185 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:27,185 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:27,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:27,186 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:27,187 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:27,187 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:27,187 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:27,187 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:27,188 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:27,188 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:27,188 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:27,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:27,189 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:27,189 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:27,189 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:27,190 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:27,190 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:27,190 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:27,192 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:27,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:27,193 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:27,193 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:29:27,193 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:27,193 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:27,194 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:27,194 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:29:27,194 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:29:27,195 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:27,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:27,196 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:27,196 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:27,196 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:27,196 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:27,197 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:27,197 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:27,198 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:27,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:27,199 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:27,199 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:27,199 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:27,199 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:27,200 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:27,200 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:27,201 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:27,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:27,202 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:27,203 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-16 00:29:27,203 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:27,203 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:27,206 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-16 00:29:27,207 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:27,226 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:27,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:27,227 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:27,227 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:27,227 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:27,227 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:27,228 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:27,228 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:27,230 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:27,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:27,231 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:27,231 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:27,231 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:27,231 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:27,232 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:27,232 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:27,233 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:27,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:27,234 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:27,235 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:27,235 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:27,235 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:27,236 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:27,236 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:27,239 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:27,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:27,240 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:27,240 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:27,240 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:27,241 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:27,241 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:27,241 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:27,243 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:29:27,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:29:27,244 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:29:27,244 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:29:27,244 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:29:27,245 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:29:27,247 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:29:27,247 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:29:27,267 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:29:27,312 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:29:27,313 INFO L444 ModelExtractionUtils]: 44 out of 49 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:29:27,313 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:29:27,314 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:29:27,314 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:29:27,314 INFO L512 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 [] [2019-11-16 00:29:27,375 INFO L297 tatePredicateManager]: 19 out of 19 supporting invariants were superfluous and have been removed [2019-11-16 00:29:27,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:27,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:29:27,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:27,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:29:27,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:27,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:29:27,432 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 [2019-11-16 00:29:27,432 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 100 transitions. cyclomatic complexity: 35 Second operand 3 states. [2019-11-16 00:29:27,462 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 100 transitions. cyclomatic complexity: 35. Second operand 3 states. Result 113 states and 166 transitions. Complement of second has 7 states. [2019-11-16 00:29:27,464 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 [2019-11-16 00:29:27,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:29:27,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-11-16 00:29:27,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 17 letters. Loop has 4 letters. [2019-11-16 00:29:27,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:29:27,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 21 letters. Loop has 4 letters. [2019-11-16 00:29:27,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:29:27,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 17 letters. Loop has 8 letters. [2019-11-16 00:29:27,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:29:27,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 166 transitions. [2019-11-16 00:29:27,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:29:27,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 65 states and 91 transitions. [2019-11-16 00:29:27,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-16 00:29:27,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-16 00:29:27,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 91 transitions. [2019-11-16 00:29:27,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:29:27,469 INFO L688 BuchiCegarLoop]: Abstraction has 65 states and 91 transitions. [2019-11-16 00:29:27,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 91 transitions. [2019-11-16 00:29:27,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2019-11-16 00:29:27,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-16 00:29:27,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2019-11-16 00:29:27,482 INFO L711 BuchiCegarLoop]: Abstraction has 57 states and 79 transitions. [2019-11-16 00:29:27,482 INFO L591 BuchiCegarLoop]: Abstraction has 57 states and 79 transitions. [2019-11-16 00:29:27,482 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-16 00:29:27,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 79 transitions. [2019-11-16 00:29:27,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:29:27,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:29:27,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:29:27,484 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:27,486 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:27,486 INFO L791 eck$LassoCheckResult]: Stem: 2402#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2394#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 2395#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2405#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 2396#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 2392#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2393#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 2397#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2420#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 2419#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2418#L535-3 assume !(main_~i~1 < main_~array_size~0); 2403#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 2404#L517-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); 2384#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2385#L517-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); 2386#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2387#L517-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); 2432#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2431#L517-3 assume !(lis_~i~0 < lis_~N); 2390#L517-4 lis_~i~0 := 1; 2391#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2383#L520-3 assume !(lis_~j~0 < lis_~i~0); 2416#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2417#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2381#L520-3 [2019-11-16 00:29:27,487 INFO L793 eck$LassoCheckResult]: Loop: 2381#L520-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; 2398#L521 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; 2399#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9; 2406#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2409#L520-3 assume !(lis_~j~0 < lis_~i~0); 2415#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2380#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2381#L520-3 [2019-11-16 00:29:27,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:27,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1572106802, now seen corresponding path program 1 times [2019-11-16 00:29:27,488 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:27,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540472297] [2019-11-16 00:29:27,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:27,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:27,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:27,541 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-16 00:29:27,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540472297] [2019-11-16 00:29:27,542 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:29:27,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:29:27,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860381066] [2019-11-16 00:29:27,542 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:29:27,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:27,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 5 times [2019-11-16 00:29:27,543 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:27,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358236641] [2019-11-16 00:29:27,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:27,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:27,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:27,562 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:27,752 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-11-16 00:29:27,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:29:27,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:29:27,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:29:27,816 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. cyclomatic complexity: 29 Second operand 4 states. [2019-11-16 00:29:27,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:29:27,863 INFO L93 Difference]: Finished difference Result 78 states and 111 transitions. [2019-11-16 00:29:27,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:29:27,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 111 transitions. [2019-11-16 00:29:27,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:29:27,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 78 states and 111 transitions. [2019-11-16 00:29:27,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-16 00:29:27,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-16 00:29:27,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 111 transitions. [2019-11-16 00:29:27,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:29:27,866 INFO L688 BuchiCegarLoop]: Abstraction has 78 states and 111 transitions. [2019-11-16 00:29:27,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 111 transitions. [2019-11-16 00:29:27,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 58. [2019-11-16 00:29:27,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-16 00:29:27,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 80 transitions. [2019-11-16 00:29:27,869 INFO L711 BuchiCegarLoop]: Abstraction has 58 states and 80 transitions. [2019-11-16 00:29:27,869 INFO L591 BuchiCegarLoop]: Abstraction has 58 states and 80 transitions. [2019-11-16 00:29:27,869 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-16 00:29:27,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 80 transitions. [2019-11-16 00:29:27,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:29:27,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:29:27,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:29:27,871 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:27,871 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:27,877 INFO L791 eck$LassoCheckResult]: Stem: 2546#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2538#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 2539#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2549#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 2540#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 2536#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2537#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 2541#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2562#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 2561#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2560#L535-3 assume !(main_~i~1 < main_~array_size~0); 2547#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 2548#L517-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); 2526#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2527#L517-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); 2533#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2531#L517-3 assume !(lis_~i~0 < lis_~N); 2532#L517-4 lis_~i~0 := 1; 2565#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2566#L520-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; 2573#L521 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; 2572#L521-2 assume lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;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); 2564#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2563#L520-3 assume !(lis_~j~0 < lis_~i~0); 2558#L519-2 [2019-11-16 00:29:27,882 INFO L793 eck$LassoCheckResult]: Loop: 2558#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2522#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2523#L520-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; 2542#L521 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; 2543#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9; 2550#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2553#L520-3 assume !(lis_~j~0 < lis_~i~0); 2558#L519-2 [2019-11-16 00:29:27,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:27,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1034531842, now seen corresponding path program 1 times [2019-11-16 00:29:27,883 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:27,883 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937559200] [2019-11-16 00:29:27,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:27,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:27,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:29:27,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937559200] [2019-11-16 00:29:27,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505006150] [2019-11-16 00:29:27,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:29:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:28,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:29:28,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:28,273 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:29:28,274 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:29:28,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-11-16 00:29:28,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95149609] [2019-11-16 00:29:28,274 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:29:28,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:28,275 INFO L82 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 6 times [2019-11-16 00:29:28,275 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:28,275 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281335143] [2019-11-16 00:29:28,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:28,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:28,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:28,285 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:28,543 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2019-11-16 00:29:28,587 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:29:28,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-16 00:29:28,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:29:28,588 INFO L87 Difference]: Start difference. First operand 58 states and 80 transitions. cyclomatic complexity: 29 Second operand 17 states. [2019-11-16 00:29:28,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:29:28,887 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2019-11-16 00:29:28,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:29:28,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 61 transitions. [2019-11-16 00:29:28,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:29:28,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 60 transitions. [2019-11-16 00:29:28,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-16 00:29:28,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-16 00:29:28,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 60 transitions. [2019-11-16 00:29:28,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:29:28,889 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-11-16 00:29:28,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 60 transitions. [2019-11-16 00:29:28,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-11-16 00:29:28,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-16 00:29:28,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2019-11-16 00:29:28,892 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2019-11-16 00:29:28,892 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2019-11-16 00:29:28,892 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-16 00:29:28,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 57 transitions. [2019-11-16 00:29:28,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:29:28,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:29:28,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:29:28,893 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:28,893 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:28,894 INFO L791 eck$LassoCheckResult]: Stem: 2755#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2745#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 2746#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2756#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 2747#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 2743#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2744#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 2748#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2771#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 2770#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2769#L535-3 assume !(main_~i~1 < main_~array_size~0); 2753#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 2754#L517-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); 2735#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2736#L517-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); 2737#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2738#L517-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); 2741#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2739#L517-3 assume !(lis_~i~0 < lis_~N); 2740#L517-4 lis_~i~0 := 1; 2742#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2761#L520-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; 2762#L521 assume !lis_#t~short11; 2768#L521-2 assume lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;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); 2767#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2766#L520-3 assume !(lis_~j~0 < lis_~i~0); 2764#L519-2 [2019-11-16 00:29:28,894 INFO L793 eck$LassoCheckResult]: Loop: 2764#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2731#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2732#L520-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; 2749#L521 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; 2750#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9; 2757#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2759#L520-3 assume !(lis_~j~0 < lis_~i~0); 2764#L519-2 [2019-11-16 00:29:28,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:28,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1035359454, now seen corresponding path program 1 times [2019-11-16 00:29:28,894 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:28,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323941724] [2019-11-16 00:29:28,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:28,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:28,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:28,925 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-16 00:29:28,925 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323941724] [2019-11-16 00:29:28,925 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:29:28,925 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:29:28,925 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669649950] [2019-11-16 00:29:28,926 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:29:28,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:28,926 INFO L82 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 7 times [2019-11-16 00:29:28,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:28,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520121192] [2019-11-16 00:29:28,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:28,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:28,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:28,935 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:29,112 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2019-11-16 00:29:29,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:29:29,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:29:29,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:29:29,146 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. cyclomatic complexity: 19 Second operand 3 states. [2019-11-16 00:29:29,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:29:29,158 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2019-11-16 00:29:29,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:29:29,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 60 transitions. [2019-11-16 00:29:29,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-16 00:29:29,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 60 transitions. [2019-11-16 00:29:29,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-16 00:29:29,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-16 00:29:29,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 60 transitions. [2019-11-16 00:29:29,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:29:29,160 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 60 transitions. [2019-11-16 00:29:29,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 60 transitions. [2019-11-16 00:29:29,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-11-16 00:29:29,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-16 00:29:29,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2019-11-16 00:29:29,162 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 60 transitions. [2019-11-16 00:29:29,162 INFO L591 BuchiCegarLoop]: Abstraction has 46 states and 60 transitions. [2019-11-16 00:29:29,162 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-11-16 00:29:29,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 60 transitions. [2019-11-16 00:29:29,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-16 00:29:29,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:29:29,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:29:29,163 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:29,163 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:29,164 INFO L791 eck$LassoCheckResult]: Stem: 2849#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2839#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 2840#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2852#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 2841#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 2837#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2838#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 2842#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2870#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 2869#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2868#L535-3 assume !(main_~i~1 < main_~array_size~0); 2850#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 2851#L517-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); 2831#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2832#L517-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); 2833#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2834#L517-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); 2862#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2835#L517-3 assume !(lis_~i~0 < lis_~N); 2836#L517-4 lis_~i~0 := 1; 2826#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2827#L520-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; 2857#L521 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; 2867#L521-2 assume lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;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); 2865#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2864#L520-3 assume !(lis_~j~0 < lis_~i~0); 2858#L519-2 [2019-11-16 00:29:29,164 INFO L793 eck$LassoCheckResult]: Loop: 2858#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2859#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2863#L520-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; 2843#L521 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; 2844#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9; 2853#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2855#L520-3 assume !(lis_~j~0 < lis_~i~0); 2858#L519-2 [2019-11-16 00:29:29,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:29,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1035299872, now seen corresponding path program 2 times [2019-11-16 00:29:29,165 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:29,165 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966316880] [2019-11-16 00:29:29,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:29,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:29,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:29,218 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:29,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:29,218 INFO L82 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 8 times [2019-11-16 00:29:29,219 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:29,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553393053] [2019-11-16 00:29:29,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:29,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:29,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:29,228 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:29,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:29,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1635630457, now seen corresponding path program 1 times [2019-11-16 00:29:29,229 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:29,229 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803279238] [2019-11-16 00:29:29,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:29,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:29,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:29,330 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-16 00:29:29,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803279238] [2019-11-16 00:29:29,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732962471] [2019-11-16 00:29:29,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:29:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:29,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:29:29,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:29,619 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-16 00:29:29,620 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:29:29,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2019-11-16 00:29:29,620 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58345365] [2019-11-16 00:29:29,810 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2019-11-16 00:29:29,866 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:29:29,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-16 00:29:29,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:29:29,867 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. cyclomatic complexity: 19 Second operand 13 states. [2019-11-16 00:29:30,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:29:30,166 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2019-11-16 00:29:30,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:29:30,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 92 transitions. [2019-11-16 00:29:30,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-11-16 00:29:30,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 45 states and 57 transitions. [2019-11-16 00:29:30,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-16 00:29:30,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-16 00:29:30,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 57 transitions. [2019-11-16 00:29:30,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:29:30,169 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 57 transitions. [2019-11-16 00:29:30,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 57 transitions. [2019-11-16 00:29:30,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2019-11-16 00:29:30,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-16 00:29:30,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2019-11-16 00:29:30,170 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-11-16 00:29:30,170 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-11-16 00:29:30,171 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2019-11-16 00:29:30,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 50 transitions. [2019-11-16 00:29:30,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-16 00:29:30,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:29:30,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:29:30,172 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:30,172 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2019-11-16 00:29:30,172 INFO L791 eck$LassoCheckResult]: Stem: 3090#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3080#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 3081#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 3093#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 3082#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 3078#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 3079#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 3083#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 3104#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 3103#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 3102#L535-3 assume !(main_~i~1 < main_~array_size~0); 3091#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 3092#L517-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); 3071#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3072#L517-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); 3073#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3074#L517-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); 3100#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3075#L517-3 assume !(lis_~i~0 < lis_~N); 3076#L517-4 lis_~i~0 := 1; 3077#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3101#L520-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; 3087#L521 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; 3088#L521-2 assume lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;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); 3096#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3098#L520-3 assume !(lis_~j~0 < lis_~i~0); 3099#L519-2 [2019-11-16 00:29:30,172 INFO L793 eck$LassoCheckResult]: Loop: 3099#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3069#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3070#L520-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; 3108#L521 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; 3107#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9; 3095#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3097#L520-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; 3084#L521 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; 3085#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9; 3106#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3105#L520-3 assume !(lis_~j~0 < lis_~i~0); 3099#L519-2 [2019-11-16 00:29:30,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:30,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1035299872, now seen corresponding path program 3 times [2019-11-16 00:29:30,173 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:30,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539583287] [2019-11-16 00:29:30,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:30,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:30,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:30,237 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:30,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:30,238 INFO L82 PathProgramCache]: Analyzing trace with hash -943445823, now seen corresponding path program 9 times [2019-11-16 00:29:30,238 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:30,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317793906] [2019-11-16 00:29:30,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:30,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:30,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:30,251 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:30,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:30,251 INFO L82 PathProgramCache]: Analyzing trace with hash 926303042, now seen corresponding path program 2 times [2019-11-16 00:29:30,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:30,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335902808] [2019-11-16 00:29:30,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:30,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:30,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:31,661 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:29:31,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335902808] [2019-11-16 00:29:31,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14911322] [2019-11-16 00:29:31,662 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:29:31,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:29:31,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:29:31,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-16 00:29:31,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:31,919 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-16 00:29:31,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:31,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:31,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:29:31,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-16 00:29:32,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 39 treesize of output 23 [2019-11-16 00:29:32,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:32,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:32,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:29:32,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2019-11-16 00:29:32,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:29:32,137 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:29:32,137 INFO L375 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 1 case distinctions, treesize of input 54 treesize of output 45 [2019-11-16 00:29:32,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:32,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:32,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:29:32,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:44 [2019-11-16 00:29:32,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:32,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:29:32,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:29:32,376 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:29:32,482 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-11-16 00:29:32,483 INFO L341 Elim1Store]: treesize reduction 12, result has 92.9 percent of original size [2019-11-16 00:29:32,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 115 treesize of output 206 [2019-11-16 00:29:32,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:32,553 INFO L567 ElimStorePlain]: treesize reduction 131, result has 45.6 percent of original size [2019-11-16 00:29:32,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:32,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:32,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:32,557 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:29:32,557 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:125, output treesize:123 [2019-11-16 00:29:32,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:32,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:32,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:32,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:32,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:32,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:32,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:32,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:32,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:32,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:32,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:32,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:33,087 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-11-16 00:29:33,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:29:33,478 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:29:33,478 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16] total 39 [2019-11-16 00:29:33,478 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583893573] [2019-11-16 00:29:33,759 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 91 [2019-11-16 00:29:33,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:29:33,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-16 00:29:33,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1352, Unknown=0, NotChecked=0, Total=1482 [2019-11-16 00:29:33,826 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. cyclomatic complexity: 14 Second operand 39 states. [2019-11-16 00:29:36,467 WARN L191 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-11-16 00:29:37,543 WARN L191 SmtUtils]: Spent 874.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-11-16 00:29:38,579 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 80 [2019-11-16 00:29:39,091 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 81 [2019-11-16 00:29:39,666 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2019-11-16 00:29:39,945 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 68 [2019-11-16 00:29:40,497 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2019-11-16 00:29:41,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:29:41,070 INFO L93 Difference]: Finished difference Result 138 states and 183 transitions. [2019-11-16 00:29:41,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-11-16 00:29:41,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 183 transitions. [2019-11-16 00:29:41,073 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 69 [2019-11-16 00:29:41,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 138 states and 183 transitions. [2019-11-16 00:29:41,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2019-11-16 00:29:41,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2019-11-16 00:29:41,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 183 transitions. [2019-11-16 00:29:41,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:29:41,076 INFO L688 BuchiCegarLoop]: Abstraction has 138 states and 183 transitions. [2019-11-16 00:29:41,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 183 transitions. [2019-11-16 00:29:41,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2019-11-16 00:29:41,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-16 00:29:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 166 transitions. [2019-11-16 00:29:41,079 INFO L711 BuchiCegarLoop]: Abstraction has 122 states and 166 transitions. [2019-11-16 00:29:41,080 INFO L591 BuchiCegarLoop]: Abstraction has 122 states and 166 transitions. [2019-11-16 00:29:41,080 INFO L424 BuchiCegarLoop]: ======== Iteration 18============ [2019-11-16 00:29:41,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 166 transitions. [2019-11-16 00:29:41,080 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 67 [2019-11-16 00:29:41,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:29:41,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:29:41,081 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:41,081 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2019-11-16 00:29:41,082 INFO L791 eck$LassoCheckResult]: Stem: 3504#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3494#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 3495#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 3507#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 3496#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 3492#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 3493#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 3497#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 3518#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 3517#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 3516#L535-3 assume !(main_~i~1 < main_~array_size~0); 3505#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 3506#L517-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); 3484#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3485#L517-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); 3486#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3487#L517-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); 3490#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3488#L517-3 assume !(lis_~i~0 < lis_~N); 3489#L517-4 lis_~i~0 := 1; 3491#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3519#L520-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; 3514#L521 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; 3566#L521-2 assume lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;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); 3563#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3561#L520-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; 3562#L521 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; 3565#L521-2 assume lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;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); 3520#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3569#L520-3 assume !(lis_~j~0 < lis_~i~0); 3522#L519-2 [2019-11-16 00:29:41,082 INFO L793 eck$LassoCheckResult]: Loop: 3522#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3547#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3546#L520-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; 3544#L521 assume !lis_#t~short11; 3543#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9; 3542#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3541#L520-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; 3529#L521 assume !lis_#t~short11; 3531#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9; 3585#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3588#L520-3 assume !(lis_~j~0 < lis_~i~0); 3522#L519-2 [2019-11-16 00:29:41,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:41,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1327034585, now seen corresponding path program 4 times [2019-11-16 00:29:41,082 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:41,082 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650428561] [2019-11-16 00:29:41,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:41,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:41,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:41,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:41,166 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-16 00:29:41,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650428561] [2019-11-16 00:29:41,167 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:29:41,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:29:41,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075709622] [2019-11-16 00:29:41,167 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:29:41,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:41,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1752732867, now seen corresponding path program 1 times [2019-11-16 00:29:41,168 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:41,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548633576] [2019-11-16 00:29:41,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:41,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:41,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:41,176 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:41,379 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2019-11-16 00:29:41,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:29:41,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:29:41,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:29:41,453 INFO L87 Difference]: Start difference. First operand 122 states and 166 transitions. cyclomatic complexity: 55 Second operand 7 states. [2019-11-16 00:29:41,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:29:41,560 INFO L93 Difference]: Finished difference Result 114 states and 151 transitions. [2019-11-16 00:29:41,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:29:41,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 151 transitions. [2019-11-16 00:29:41,562 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 67 [2019-11-16 00:29:41,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 114 states and 151 transitions. [2019-11-16 00:29:41,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2019-11-16 00:29:41,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2019-11-16 00:29:41,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 151 transitions. [2019-11-16 00:29:41,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:29:41,564 INFO L688 BuchiCegarLoop]: Abstraction has 114 states and 151 transitions. [2019-11-16 00:29:41,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 151 transitions. [2019-11-16 00:29:41,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-11-16 00:29:41,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-16 00:29:41,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 151 transitions. [2019-11-16 00:29:41,568 INFO L711 BuchiCegarLoop]: Abstraction has 114 states and 151 transitions. [2019-11-16 00:29:41,568 INFO L591 BuchiCegarLoop]: Abstraction has 114 states and 151 transitions. [2019-11-16 00:29:41,568 INFO L424 BuchiCegarLoop]: ======== Iteration 19============ [2019-11-16 00:29:41,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 151 transitions. [2019-11-16 00:29:41,569 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 67 [2019-11-16 00:29:41,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:29:41,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:29:41,570 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:41,570 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:29:41,570 INFO L791 eck$LassoCheckResult]: Stem: 3755#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3747#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 3748#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 3758#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 3749#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 3750#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 3751#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 3745#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 3746#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 3766#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 3765#L535-3 assume !(main_~i~1 < main_~array_size~0); 3756#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 3757#L517-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); 3738#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3739#L517-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); 3740#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3741#L517-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); 3764#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3742#L517-3 assume !(lis_~i~0 < lis_~N); 3743#L517-4 lis_~i~0 := 1; 3744#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3825#L520-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#L521 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; 3821#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9; 3820#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3818#L520-3 assume !(lis_~j~0 < lis_~i~0); 3816#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3815#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3814#L520-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; 3813#L521 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; 3812#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9; 3801#L520-2 [2019-11-16 00:29:41,570 INFO L793 eck$LassoCheckResult]: Loop: 3801#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3800#L520-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; 3782#L521 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; 3799#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9; 3801#L520-2 [2019-11-16 00:29:41,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:41,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1629172116, now seen corresponding path program 2 times [2019-11-16 00:29:41,571 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:41,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136972436] [2019-11-16 00:29:41,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:41,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:41,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:42,712 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:29:42,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136972436] [2019-11-16 00:29:42,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738593758] [2019-11-16 00:29:42,713 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:29:42,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:29:42,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:29:42,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-16 00:29:42,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:42,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-16 00:29:42,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:42,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:42,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:29:42,883 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-16 00:29:42,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 39 treesize of output 23 [2019-11-16 00:29:42,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:42,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:42,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:29:42,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2019-11-16 00:29:43,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:29:43,012 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:43,013 INFO L375 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 1 case distinctions, treesize of input 54 treesize of output 67 [2019-11-16 00:29:43,013 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:43,064 INFO L567 ElimStorePlain]: treesize reduction 24, result has 66.2 percent of original size [2019-11-16 00:29:43,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:29:43,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:64, output treesize:47 [2019-11-16 00:29:43,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:29:43,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:29:43,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:29:43,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:29:43,249 INFO L341 Elim1Store]: treesize reduction 10, result has 87.7 percent of original size [2019-11-16 00:29:43,250 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 121 [2019-11-16 00:29:43,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:43,314 INFO L567 ElimStorePlain]: treesize reduction 54, result has 54.6 percent of original size [2019-11-16 00:29:43,315 INFO L496 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. [2019-11-16 00:29:43,315 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:82, output treesize:65 [2019-11-16 00:29:43,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:43,628 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-16 00:29:43,629 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:29:43,629 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11] total 29 [2019-11-16 00:29:43,629 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188529651] [2019-11-16 00:29:43,629 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:29:43,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:43,630 INFO L82 PathProgramCache]: Analyzing trace with hash 2942460, now seen corresponding path program 2 times [2019-11-16 00:29:43,630 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:43,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53769694] [2019-11-16 00:29:43,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:43,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:43,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:43,639 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:43,768 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-11-16 00:29:43,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:29:43,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-16 00:29:43,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2019-11-16 00:29:43,816 INFO L87 Difference]: Start difference. First operand 114 states and 151 transitions. cyclomatic complexity: 45 Second operand 29 states. [2019-11-16 00:29:44,519 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-11-16 00:29:44,756 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2019-11-16 00:29:45,214 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-11-16 00:29:47,368 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-11-16 00:29:48,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:29:48,034 INFO L93 Difference]: Finished difference Result 415 states and 561 transitions. [2019-11-16 00:29:48,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-11-16 00:29:48,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 415 states and 561 transitions. [2019-11-16 00:29:48,039 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 308 [2019-11-16 00:29:48,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 415 states to 415 states and 561 transitions. [2019-11-16 00:29:48,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 394 [2019-11-16 00:29:48,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 394 [2019-11-16 00:29:48,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 415 states and 561 transitions. [2019-11-16 00:29:48,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:29:48,048 INFO L688 BuchiCegarLoop]: Abstraction has 415 states and 561 transitions. [2019-11-16 00:29:48,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states and 561 transitions. [2019-11-16 00:29:48,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 114. [2019-11-16 00:29:48,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-16 00:29:48,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 150 transitions. [2019-11-16 00:29:48,055 INFO L711 BuchiCegarLoop]: Abstraction has 114 states and 150 transitions. [2019-11-16 00:29:48,055 INFO L591 BuchiCegarLoop]: Abstraction has 114 states and 150 transitions. [2019-11-16 00:29:48,056 INFO L424 BuchiCegarLoop]: ======== Iteration 20============ [2019-11-16 00:29:48,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 150 transitions. [2019-11-16 00:29:48,057 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 67 [2019-11-16 00:29:48,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:29:48,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:29:48,058 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:48,058 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-11-16 00:29:48,058 INFO L791 eck$LassoCheckResult]: Stem: 4476#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4468#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 4469#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 4479#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 4470#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 4471#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 4485#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 4486#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 4472#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 4466#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 4467#L535-3 assume !(main_~i~1 < main_~array_size~0); 4477#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 4478#L517-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); 4458#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4459#L517-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); 4460#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4461#L517-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); 4464#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4462#L517-3 assume !(lis_~i~0 < lis_~N); 4463#L517-4 lis_~i~0 := 1; 4465#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4522#L520-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; 4520#L521 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; 4519#L521-2 assume lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;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); 4518#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4517#L520-3 assume !(lis_~j~0 < lis_~i~0); 4516#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 4515#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4514#L520-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; 4512#L521 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; 4513#L521-2 assume lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;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); 4557#L520-2 [2019-11-16 00:29:48,058 INFO L793 eck$LassoCheckResult]: Loop: 4557#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4566#L520-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; 4563#L521 assume !lis_#t~short11; 4564#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9; 4492#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4562#L520-3 assume !(lis_~j~0 < lis_~i~0); 4561#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 4456#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4457#L520-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; 4569#L521 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; 4567#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9; 4557#L520-2 [2019-11-16 00:29:48,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:48,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1856448556, now seen corresponding path program 1 times [2019-11-16 00:29:48,059 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:48,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018605752] [2019-11-16 00:29:48,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:48,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:48,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:48,115 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:48,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:48,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1946508565, now seen corresponding path program 1 times [2019-11-16 00:29:48,116 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:48,116 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164418062] [2019-11-16 00:29:48,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:48,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:48,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:48,127 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:48,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:48,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1125074632, now seen corresponding path program 1 times [2019-11-16 00:29:48,128 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:48,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841760307] [2019-11-16 00:29:48,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:48,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:48,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 22 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:29:48,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841760307] [2019-11-16 00:29:48,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362416864] [2019-11-16 00:29:48,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:29:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:48,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:29:48,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:48,652 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-16 00:29:48,652 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:29:48,652 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-11-16 00:29:48,652 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105949175] [2019-11-16 00:29:48,860 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 90 [2019-11-16 00:29:48,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:29:48,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-16 00:29:48,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:29:48,906 INFO L87 Difference]: Start difference. First operand 114 states and 150 transitions. cyclomatic complexity: 44 Second operand 20 states. [2019-11-16 00:29:49,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:29:49,511 INFO L93 Difference]: Finished difference Result 251 states and 320 transitions. [2019-11-16 00:29:49,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:29:49,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 251 states and 320 transitions. [2019-11-16 00:29:49,513 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 115 [2019-11-16 00:29:49,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 251 states to 238 states and 305 transitions. [2019-11-16 00:29:49,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 217 [2019-11-16 00:29:49,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 221 [2019-11-16 00:29:49,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 238 states and 305 transitions. [2019-11-16 00:29:49,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:29:49,516 INFO L688 BuchiCegarLoop]: Abstraction has 238 states and 305 transitions. [2019-11-16 00:29:49,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states and 305 transitions. [2019-11-16 00:29:49,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 153. [2019-11-16 00:29:49,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-16 00:29:49,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 197 transitions. [2019-11-16 00:29:49,521 INFO L711 BuchiCegarLoop]: Abstraction has 153 states and 197 transitions. [2019-11-16 00:29:49,521 INFO L591 BuchiCegarLoop]: Abstraction has 153 states and 197 transitions. [2019-11-16 00:29:49,521 INFO L424 BuchiCegarLoop]: ======== Iteration 21============ [2019-11-16 00:29:49,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 153 states and 197 transitions. [2019-11-16 00:29:49,522 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 72 [2019-11-16 00:29:49,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:29:49,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:29:49,524 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:49,524 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:29:49,524 INFO L791 eck$LassoCheckResult]: Stem: 5023#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5016#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 5017#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 5025#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 5018#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 5014#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 5015#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 5019#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 5036#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 5033#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 5034#L535-3 assume !(main_~i~1 < main_~array_size~0); 5024#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 5009#L517-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); 5005#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 5006#L517-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); 5043#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 5042#L517-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); 5038#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 5035#L517-3 assume !(lis_~i~0 < lis_~N); 5012#L517-4 lis_~i~0 := 1; 5013#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 5144#L520-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; 5143#L521 assume !lis_#t~short11; 5046#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9; 5047#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5155#L520-3 assume !(lis_~j~0 < lis_~i~0); 5154#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 5003#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 5004#L520-3 [2019-11-16 00:29:49,525 INFO L793 eck$LassoCheckResult]: Loop: 5004#L520-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; 5020#L521 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; 5021#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9; 5027#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5004#L520-3 [2019-11-16 00:29:49,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:49,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1450128121, now seen corresponding path program 1 times [2019-11-16 00:29:49,525 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:49,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717793550] [2019-11-16 00:29:49,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:49,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:49,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:49,569 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:49,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:49,569 INFO L82 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 3 times [2019-11-16 00:29:49,569 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:49,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474804923] [2019-11-16 00:29:49,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:49,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:49,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:49,581 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:49,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:49,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1428298900, now seen corresponding path program 1 times [2019-11-16 00:29:49,582 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:49,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710543917] [2019-11-16 00:29:49,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:49,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:49,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:50,480 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:29:50,480 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710543917] [2019-11-16 00:29:50,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381744984] [2019-11-16 00:29:50,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:29:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:50,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-16 00:29:50,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:50,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-16 00:29:50,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:50,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:50,622 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:29:50,622 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-11-16 00:29:50,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 39 treesize of output 23 [2019-11-16 00:29:50,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:50,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:50,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:29:50,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2019-11-16 00:29:50,731 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:50,731 INFO L375 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 2 case distinctions, treesize of input 54 treesize of output 91 [2019-11-16 00:29:50,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:50,764 INFO L567 ElimStorePlain]: treesize reduction 48, result has 47.8 percent of original size [2019-11-16 00:29:50,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:29:50,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:44 [2019-11-16 00:29:50,903 INFO L341 Elim1Store]: treesize reduction 112, result has 22.8 percent of original size [2019-11-16 00:29:50,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 65 [2019-11-16 00:29:50,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:50,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:50,918 INFO L496 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. [2019-11-16 00:29:50,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:55 [2019-11-16 00:29:51,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-16 00:29:51,164 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:29:51,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 27 [2019-11-16 00:29:51,165 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095306460] [2019-11-16 00:29:51,273 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-11-16 00:29:51,305 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:29:51,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-16 00:29:51,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2019-11-16 00:29:51,306 INFO L87 Difference]: Start difference. First operand 153 states and 197 transitions. cyclomatic complexity: 53 Second operand 27 states. [2019-11-16 00:29:52,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:29:52,938 INFO L93 Difference]: Finished difference Result 165 states and 213 transitions. [2019-11-16 00:29:52,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-16 00:29:52,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 213 transitions. [2019-11-16 00:29:52,939 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 77 [2019-11-16 00:29:52,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 165 states and 213 transitions. [2019-11-16 00:29:52,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 149 [2019-11-16 00:29:52,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2019-11-16 00:29:52,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 165 states and 213 transitions. [2019-11-16 00:29:52,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:29:52,942 INFO L688 BuchiCegarLoop]: Abstraction has 165 states and 213 transitions. [2019-11-16 00:29:52,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states and 213 transitions. [2019-11-16 00:29:52,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 153. [2019-11-16 00:29:52,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-16 00:29:52,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 197 transitions. [2019-11-16 00:29:52,946 INFO L711 BuchiCegarLoop]: Abstraction has 153 states and 197 transitions. [2019-11-16 00:29:52,946 INFO L591 BuchiCegarLoop]: Abstraction has 153 states and 197 transitions. [2019-11-16 00:29:52,946 INFO L424 BuchiCegarLoop]: ======== Iteration 22============ [2019-11-16 00:29:52,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 153 states and 197 transitions. [2019-11-16 00:29:52,947 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 72 [2019-11-16 00:29:52,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:29:52,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:29:52,948 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:52,948 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:29:52,949 INFO L791 eck$LassoCheckResult]: Stem: 5496#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5489#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 5490#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 5498#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 5491#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 5487#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 5488#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 5492#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 5518#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 5511#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 5512#L535-3 assume !(main_~i~1 < main_~array_size~0); 5497#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 5482#L517-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); 5478#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 5479#L517-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); 5516#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 5514#L517-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); 5510#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 5509#L517-3 assume !(lis_~i~0 < lis_~N); 5485#L517-4 lis_~i~0 := 1; 5486#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 5621#L520-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; 5620#L521 assume !lis_#t~short11; 5523#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9; 5524#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5519#L520-3 assume !(lis_~j~0 < lis_~i~0); 5520#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 5625#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 5623#L520-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; 5493#L521 assume !lis_#t~short11; 5495#L521-2 [2019-11-16 00:29:52,949 INFO L793 eck$LassoCheckResult]: Loop: 5495#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9; 5499#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5500#L520-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; 5501#L521 assume !lis_#t~short11; 5495#L521-2 [2019-11-16 00:29:52,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:52,949 INFO L82 PathProgramCache]: Analyzing trace with hash -2003718676, now seen corresponding path program 2 times [2019-11-16 00:29:52,949 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:52,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114589802] [2019-11-16 00:29:52,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:52,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:52,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:52,989 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:52,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:52,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2895272, now seen corresponding path program 2 times [2019-11-16 00:29:52,990 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:52,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406770698] [2019-11-16 00:29:52,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:52,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:52,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:52,996 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:52,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:52,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1796140563, now seen corresponding path program 3 times [2019-11-16 00:29:52,996 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:52,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355146115] [2019-11-16 00:29:52,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:52,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:52,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:29:53,037 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:29:57,941 WARN L191 SmtUtils]: Spent 4.79 s on a formula simplification. DAG size of input: 305 DAG size of output: 218 [2019-11-16 00:29:58,728 WARN L191 SmtUtils]: Spent 776.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-11-16 00:29:58,731 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:29:58,731 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:29:58,731 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:29:58,731 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:29:58,731 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:29:58,731 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:29:58,732 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:29:58,732 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:29:58,732 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration22_Lasso [2019-11-16 00:29:58,732 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:29:58,732 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:29:58,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:58,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:58,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:58,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:59,822 WARN L191 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 112 [2019-11-16 00:29:59,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:59,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:59,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:59,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:59,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:59,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:59,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:59,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:59,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:59,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:59,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:59,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:59,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:59,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:59,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:29:59,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:30:00,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:30:00,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:30:00,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:30:00,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:30:00,287 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-11-16 00:30:01,030 WARN L191 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-11-16 00:30:01,195 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:30:01,196 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:30:01,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:30:01,199 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:30:01,200 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:30:01,200 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:30:01,200 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:30:01,200 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:30:01,200 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:30:01,201 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:30:01,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:30:01,202 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:30:01,202 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:30:01,202 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:30:01,203 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:30:01,203 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:30:01,203 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:30:01,203 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:30:01,203 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:30:01,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:30:01,204 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:30:01,204 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:30:01,204 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:30:01,204 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:30:01,204 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:30:01,205 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:30:01,205 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:30:01,205 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:30:01,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:30:01,206 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:30:01,206 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:30:01,206 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:30:01,206 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:30:01,206 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:30:01,207 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:30:01,208 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:30:01,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:30:01,208 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:30:01,209 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:30:01,209 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:30:01,209 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:30:01,209 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:30:01,209 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:30:01,210 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:30:01,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:30:01,211 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:30:01,213 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:30:01,213 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:30:01,213 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:30:01,215 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:30:01,215 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:30:01,218 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:30:01,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:30:01,219 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:30:01,220 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:30:01,220 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:30:01,220 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:30:01,221 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:30:01,221 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:30:01,224 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:30:01,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:30:01,225 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:30:01,225 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:30:01,225 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:30:01,225 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:30:01,226 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:30:01,226 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:30:01,227 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:30:01,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:30:01,228 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:30:01,228 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:30:01,229 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:30:01,229 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:30:01,229 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:30:01,230 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:30:01,231 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:30:01,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:30:01,232 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:30:01,232 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:30:01,232 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:30:01,232 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:30:01,233 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:30:01,233 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:30:01,234 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:30:01,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:30:01,235 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:30:01,235 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:30:01,235 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:30:01,235 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:30:01,236 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:30:01,236 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:30:01,237 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:30:01,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:30:01,238 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:30:01,238 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:30:01,239 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:30:01,239 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:30:01,239 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:30:01,240 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:30:01,241 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:30:01,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:30:01,242 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:30:01,242 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-16 00:30:01,242 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:30:01,242 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:30:01,246 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-16 00:30:01,246 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:30:01,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:30:01,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:30:01,264 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:30:01,264 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:30:01,264 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:30:01,265 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:30:01,265 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:30:01,265 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:30:01,267 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:30:01,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:30:01,267 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:30:01,268 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:30:01,268 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:30:01,268 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:30:01,271 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:30:01,271 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:30:01,298 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:30:01,325 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:30:01,325 INFO L444 ModelExtractionUtils]: 41 out of 49 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-16 00:30:01,326 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:30:01,326 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:30:01,327 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:30:01,327 INFO L512 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 [] [2019-11-16 00:30:01,691 INFO L297 tatePredicateManager]: 63 out of 63 supporting invariants were superfluous and have been removed [2019-11-16 00:30:01,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:01,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:30:01,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:30:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:01,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:30:01,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:30:01,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:01,792 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 [2019-11-16 00:30:01,792 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 153 states and 197 transitions. cyclomatic complexity: 53 Second operand 5 states. [2019-11-16 00:30:01,833 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 153 states and 197 transitions. cyclomatic complexity: 53. Second operand 5 states. Result 236 states and 307 transitions. Complement of second has 7 states. [2019-11-16 00:30:01,836 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 [2019-11-16 00:30:01,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:30:01,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2019-11-16 00:30:01,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 30 letters. Loop has 4 letters. [2019-11-16 00:30:01,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:30:01,837 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:30:01,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:01,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:30:01,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:30:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:01,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:30:01,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:30:01,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:01,928 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 [2019-11-16 00:30:01,928 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 153 states and 197 transitions. cyclomatic complexity: 53 Second operand 5 states. [2019-11-16 00:30:01,983 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 153 states and 197 transitions. cyclomatic complexity: 53. Second operand 5 states. Result 239 states and 310 transitions. Complement of second has 9 states. [2019-11-16 00:30:01,984 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 [2019-11-16 00:30:01,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:30:01,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2019-11-16 00:30:01,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 30 letters. Loop has 4 letters. [2019-11-16 00:30:01,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:30:01,985 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:30:02,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:02,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:30:02,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:30:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:02,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:30:02,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:30:02,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:02,082 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 [2019-11-16 00:30:02,083 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 153 states and 197 transitions. cyclomatic complexity: 53 Second operand 5 states. [2019-11-16 00:30:02,117 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 153 states and 197 transitions. cyclomatic complexity: 53. Second operand 5 states. Result 287 states and 385 transitions. Complement of second has 8 states. [2019-11-16 00:30:02,119 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 [2019-11-16 00:30:02,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:30:02,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2019-11-16 00:30:02,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 30 letters. Loop has 4 letters. [2019-11-16 00:30:02,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:30:02,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 34 letters. Loop has 4 letters. [2019-11-16 00:30:02,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:30:02,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 30 letters. Loop has 8 letters. [2019-11-16 00:30:02,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:30:02,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 287 states and 385 transitions. [2019-11-16 00:30:02,123 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 111 [2019-11-16 00:30:02,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 287 states to 234 states and 314 transitions. [2019-11-16 00:30:02,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2019-11-16 00:30:02,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2019-11-16 00:30:02,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 234 states and 314 transitions. [2019-11-16 00:30:02,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:30:02,127 INFO L688 BuchiCegarLoop]: Abstraction has 234 states and 314 transitions. [2019-11-16 00:30:02,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states and 314 transitions. [2019-11-16 00:30:02,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 198. [2019-11-16 00:30:02,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-11-16 00:30:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 276 transitions. [2019-11-16 00:30:02,134 INFO L711 BuchiCegarLoop]: Abstraction has 198 states and 276 transitions. [2019-11-16 00:30:02,134 INFO L591 BuchiCegarLoop]: Abstraction has 198 states and 276 transitions. [2019-11-16 00:30:02,134 INFO L424 BuchiCegarLoop]: ======== Iteration 23============ [2019-11-16 00:30:02,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 198 states and 276 transitions. [2019-11-16 00:30:02,135 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 93 [2019-11-16 00:30:02,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:30:02,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:30:02,136 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:02,136 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:30:02,137 INFO L791 eck$LassoCheckResult]: Stem: 7022#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7011#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 7012#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 7024#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 7013#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 7014#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 7015#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 7009#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 7010#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 7053#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 7052#L535-3 assume !(main_~i~1 < main_~array_size~0); 7023#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 7004#L517-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); 7000#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7001#L517-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); 7049#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7047#L517-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); 7044#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7045#L517-3 assume !(lis_~i~0 < lis_~N); 7007#L517-4 lis_~i~0 := 1; 7008#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7102#L520-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; 7099#L521 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; 7100#L521-2 assume lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;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); 7103#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7101#L520-3 assume !(lis_~j~0 < lis_~i~0); 7098#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 7096#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7094#L520-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; 7092#L521 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; 7090#L521-2 assume lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;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); 7085#L520-2 [2019-11-16 00:30:02,137 INFO L793 eck$LassoCheckResult]: Loop: 7085#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7133#L520-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; 7134#L521 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; 7137#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9; 7085#L520-2 [2019-11-16 00:30:02,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:02,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1856448556, now seen corresponding path program 2 times [2019-11-16 00:30:02,138 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:02,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298815644] [2019-11-16 00:30:02,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:02,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:02,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:30:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:30:02,190 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:30:02,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:02,190 INFO L82 PathProgramCache]: Analyzing trace with hash 2942460, now seen corresponding path program 4 times [2019-11-16 00:30:02,191 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:02,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339532562] [2019-11-16 00:30:02,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:02,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:02,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:30:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:30:02,199 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:30:02,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:02,199 INFO L82 PathProgramCache]: Analyzing trace with hash 115317839, now seen corresponding path program 3 times [2019-11-16 00:30:02,200 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:02,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945566548] [2019-11-16 00:30:02,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:02,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:02,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:03,005 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-16 00:30:03,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945566548] [2019-11-16 00:30:03,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636600534] [2019-11-16 00:30:03,006 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62efa5e-5e40-4e4c-bc2c-7b15c15d50ef/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:30:03,200 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-16 00:30:03,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:30:03,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-16 00:30:03,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:30:03,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-16 00:30:03,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:30:03,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:03,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:30:03,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-11-16 00:30:03,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:30:03,261 INFO L375 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 62 treesize of output 38 [2019-11-16 00:30:03,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:30:03,280 INFO L567 ElimStorePlain]: treesize reduction 7, result has 85.7 percent of original size [2019-11-16 00:30:03,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:30:03,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:42 [2019-11-16 00:30:03,362 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:30:03,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:30:03,401 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:03,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 94 treesize of output 165 [2019-11-16 00:30:03,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:30:03,461 INFO L567 ElimStorePlain]: treesize reduction 100, result has 45.7 percent of original size [2019-11-16 00:30:03,461 INFO L496 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. [2019-11-16 00:30:03,462 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:104, output treesize:84 [2019-11-16 00:30:03,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:30:03,766 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-16 00:30:03,767 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:30:03,767 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 21 [2019-11-16 00:30:03,767 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968734501] [2019-11-16 00:30:03,898 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-11-16 00:30:03,924 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:03,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-16 00:30:03,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:30:03,925 INFO L87 Difference]: Start difference. First operand 198 states and 276 transitions. cyclomatic complexity: 89 Second operand 22 states. [2019-11-16 00:30:04,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:04,897 INFO L93 Difference]: Finished difference Result 266 states and 372 transitions. [2019-11-16 00:30:04,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:30:04,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 266 states and 372 transitions. [2019-11-16 00:30:04,899 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 130 [2019-11-16 00:30:04,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 266 states to 266 states and 372 transitions. [2019-11-16 00:30:04,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2019-11-16 00:30:04,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2019-11-16 00:30:04,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 266 states and 372 transitions. [2019-11-16 00:30:04,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:30:04,903 INFO L688 BuchiCegarLoop]: Abstraction has 266 states and 372 transitions. [2019-11-16 00:30:04,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states and 372 transitions. [2019-11-16 00:30:04,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 230. [2019-11-16 00:30:04,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-16 00:30:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 325 transitions. [2019-11-16 00:30:04,909 INFO L711 BuchiCegarLoop]: Abstraction has 230 states and 325 transitions. [2019-11-16 00:30:04,909 INFO L591 BuchiCegarLoop]: Abstraction has 230 states and 325 transitions. [2019-11-16 00:30:04,909 INFO L424 BuchiCegarLoop]: ======== Iteration 24============ [2019-11-16 00:30:04,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 230 states and 325 transitions. [2019-11-16 00:30:04,911 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 122 [2019-11-16 00:30:04,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:30:04,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:30:04,912 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:04,912 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:30:04,912 INFO L791 eck$LassoCheckResult]: Stem: 7647#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7634#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 7635#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 7649#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 7636#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 7637#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 7638#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 7632#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 7633#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 7673#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 7672#L535-3 assume !(main_~i~1 < main_~array_size~0); 7648#L535-4 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.allocOnStack(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.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 7627#L517-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); 7623#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7624#L517-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); 7669#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7667#L517-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); 7666#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7665#L517-3 assume !(lis_~i~0 < lis_~N); 7630#L517-4 lis_~i~0 := 1; 7631#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7717#L520-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; 7715#L521 assume !lis_#t~short11; 7714#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9; 7713#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7712#L520-3 assume !(lis_~j~0 < lis_~i~0); 7711#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 7710#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7706#L520-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; 7704#L521 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; 7700#L521-2 assume lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;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); 7701#L520-2 [2019-11-16 00:30:04,913 INFO L793 eck$LassoCheckResult]: Loop: 7701#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7754#L520-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; 7752#L521 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; 7753#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9; 7701#L520-2 [2019-11-16 00:30:04,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:04,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1985736812, now seen corresponding path program 2 times [2019-11-16 00:30:04,913 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:04,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858639972] [2019-11-16 00:30:04,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:04,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:04,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:30:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:30:04,957 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:30:04,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:04,958 INFO L82 PathProgramCache]: Analyzing trace with hash 2942460, now seen corresponding path program 5 times [2019-11-16 00:30:04,958 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:04,959 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627652622] [2019-11-16 00:30:04,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:04,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:04,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:30:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:30:04,966 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:30:04,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:04,967 INFO L82 PathProgramCache]: Analyzing trace with hash -213322737, now seen corresponding path program 3 times [2019-11-16 00:30:04,967 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:04,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455556104] [2019-11-16 00:30:04,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:04,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:04,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:30:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:30:05,044 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:30:05,182 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-11-16 00:30:20,068 WARN L191 SmtUtils]: Spent 14.86 s on a formula simplification. DAG size of input: 343 DAG size of output: 241 [2019-11-16 00:30:24,000 WARN L191 SmtUtils]: Spent 3.92 s on a formula simplification that was a NOOP. DAG size: 173 [2019-11-16 00:30:24,004 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:30:24,004 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:30:24,004 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:30:24,004 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:30:24,004 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:30:24,004 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:30:24,004 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:30:24,004 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:30:24,005 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration24_Lasso [2019-11-16 00:30:24,005 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:30:24,005 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:30:24,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:30:24,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:30:26,345 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:536) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:951) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) 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) [2019-11-16 00:30:26,357 INFO L168 Benchmark]: Toolchain (without parser) took 83723.30 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 691.5 MB). Free memory was 935.7 MB in the beginning and 1.4 GB in the end (delta: -451.7 MB). Peak memory consumption was 813.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:30:26,357 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:30:26,358 INFO L168 Benchmark]: CACSL2BoogieTranslator took 689.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -189.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:30:26,358 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:30:26,358 INFO L168 Benchmark]: Boogie Preprocessor took 37.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:30:26,359 INFO L168 Benchmark]: RCFGBuilder took 489.23 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: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:30:26,359 INFO L168 Benchmark]: BuchiAutomizer took 82444.26 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 543.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -289.8 MB). Peak memory consumption was 826.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:30:26,361 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 689.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -189.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 489.23 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: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 82444.26 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 543.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -289.8 MB). Peak memory consumption was 826.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...