./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/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_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/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.25-f470102 [2019-12-07 11:22:19,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:22:19,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:22:19,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:22:19,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:22:19,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:22:19,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:22:19,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:22:19,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:22:19,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:22:19,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:22:19,857 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:22:19,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:22:19,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:22:19,858 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:22:19,859 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:22:19,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:22:19,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:22:19,862 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:22:19,863 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:22:19,864 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:22:19,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:22:19,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:22:19,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:22:19,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:22:19,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:22:19,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:22:19,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:22:19,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:22:19,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:22:19,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:22:19,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:22:19,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:22:19,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:22:19,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:22:19,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:22:19,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:22:19,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:22:19,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:22:19,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:22:19,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:22:19,874 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-12-07 11:22:19,885 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:22:19,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:22:19,885 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:22:19,885 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:22:19,886 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:22:19,886 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-12-07 11:22:19,886 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-12-07 11:22:19,886 INFO L138 SettingsManager]: * Use old map elimination=false [2019-12-07 11:22:19,886 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-12-07 11:22:19,886 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-12-07 11:22:19,886 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-12-07 11:22:19,886 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:22:19,887 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:22:19,887 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 11:22:19,887 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:22:19,887 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:22:19,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:22:19,887 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-12-07 11:22:19,887 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-12-07 11:22:19,887 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-12-07 11:22:19,888 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:22:19,888 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:22:19,888 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-12-07 11:22:19,888 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:22:19,888 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-12-07 11:22:19,888 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:22:19,888 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:22:19,889 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-12-07 11:22:19,889 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:22:19,889 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:22:19,889 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:22:19,889 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-12-07 11:22:19,890 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-12-07 11:22:19,890 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_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/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-12-07 11:22:19,999 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:22:20,010 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:22:20,013 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:22:20,014 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:22:20,015 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:22:20,015 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2019-12-07 11:22:20,066 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/data/1da9b6db5/f93f9535c7a5444eaa44c3fcf0e5f0e6/FLAGea6a242c0 [2019-12-07 11:22:20,441 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:22:20,441 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2019-12-07 11:22:20,451 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/data/1da9b6db5/f93f9535c7a5444eaa44c3fcf0e5f0e6/FLAGea6a242c0 [2019-12-07 11:22:20,459 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/data/1da9b6db5/f93f9535c7a5444eaa44c3fcf0e5f0e6 [2019-12-07 11:22:20,461 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:22:20,462 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:22:20,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:22:20,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:22:20,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:22:20,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:22:20" (1/1) ... [2019-12-07 11:22:20,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ed577ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:22:20, skipping insertion in model container [2019-12-07 11:22:20,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:22:20" (1/1) ... [2019-12-07 11:22:20,472 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:22:20,496 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:22:20,697 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:22:20,703 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:22:20,732 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:22:20,761 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:22:20,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:22:20 WrapperNode [2019-12-07 11:22:20,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:22:20,762 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:22:20,762 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:22:20,762 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:22:20,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:22:20" (1/1) ... [2019-12-07 11:22:20,778 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:22:20" (1/1) ... [2019-12-07 11:22:20,794 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:22:20,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:22:20,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:22:20,794 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:22:20,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:22:20" (1/1) ... [2019-12-07 11:22:20,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:22:20" (1/1) ... [2019-12-07 11:22:20,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:22:20" (1/1) ... [2019-12-07 11:22:20,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:22:20" (1/1) ... [2019-12-07 11:22:20,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:22:20" (1/1) ... [2019-12-07 11:22:20,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:22:20" (1/1) ... [2019-12-07 11:22:20,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:22:20" (1/1) ... [2019-12-07 11:22:20,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:22:20,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:22:20,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:22:20,815 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:22:20,815 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:22:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/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-12-07 11:22:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 11:22:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:22:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:22:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:22:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:22:20,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:22:21,047 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:22:21,047 INFO L287 CfgBuilder]: Removed 11 assume(true) statements. [2019-12-07 11:22:21,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:22:21 BoogieIcfgContainer [2019-12-07 11:22:21,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:22:21,048 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-12-07 11:22:21,048 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-12-07 11:22:21,050 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-12-07 11:22:21,051 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 11:22:21,051 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 11:22:20" (1/3) ... [2019-12-07 11:22:21,052 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71f1bf1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 11:22:21, skipping insertion in model container [2019-12-07 11:22:21,052 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 11:22:21,052 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:22:20" (2/3) ... [2019-12-07 11:22:21,052 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71f1bf1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 11:22:21, skipping insertion in model container [2019-12-07 11:22:21,052 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 11:22:21,052 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:22:21" (3/3) ... [2019-12-07 11:22:21,053 INFO L371 chiAutomizerObserver]: Analyzing ICFG lis-alloca-1.i [2019-12-07 11:22:21,081 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-12-07 11:22:21,081 INFO L357 BuchiCegarLoop]: Hoare is false [2019-12-07 11:22:21,081 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-12-07 11:22:21,081 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:22:21,081 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:22:21,081 INFO L361 BuchiCegarLoop]: Difference is false [2019-12-07 11:22:21,082 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:22:21,082 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-12-07 11:22:21,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-12-07 11:22:21,105 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2019-12-07 11:22:21,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:22:21,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:22:21,109 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-12-07 11:22:21,109 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 11:22:21,109 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-12-07 11:22:21,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-12-07 11:22:21,111 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2019-12-07 11:22:21,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:22:21,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:22:21,111 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-12-07 11:22:21,111 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 11:22:21,116 INFO L794 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-12-07 11:22:21,116 INFO L796 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-12-07 11:22:21,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:21,120 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-12-07 11:22:21,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:21,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339583448] [2019-12-07 11:22:21,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:21,207 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:21,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:21,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-12-07 11:22:21,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:21,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665206724] [2019-12-07 11:22:21,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:21,220 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:21,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:21,221 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-12-07 11:22:21,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:21,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778556587] [2019-12-07 11:22:21,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:21,243 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:21,370 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 11:22:21,371 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 11:22:21,371 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 11:22:21,371 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 11:22:21,371 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 11:22:21,371 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:21,371 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 11:22:21,371 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 11:22:21,371 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration1_Lasso [2019-12-07 11:22:21,371 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 11:22:21,371 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 11:22:21,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:21,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:21,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:21,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:21,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:21,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:21,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:21,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-12-07 11:22:21,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:21,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:21,621 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 11:22:21,625 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/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-12-07 11:22:21,629 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-12-07 11:22:21,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:21,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:22:21,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:21,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:21,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:21,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:22:21,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:22:21,635 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:21,639 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-12-07 11:22:21,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:21,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:22:21,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:21,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:21,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:21,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:22:21,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:22:21,642 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:21,646 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-12-07 11:22:21,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:21,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:21,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:21,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:21,650 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:22:21,650 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:22:21,653 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:21,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-12-07 11:22:21,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:21,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:21,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:21,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:21,661 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:22:21,661 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:22:21,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:21,668 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-12-07 11:22:21,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:21,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:22:21,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:21,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:21,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:21,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:22:21,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:22:21,672 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:21,675 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-12-07 11:22:21,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:21,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:22:21,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:21,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:21,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:21,677 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:22:21,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:22:21,679 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:21,682 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-12-07 11:22:21,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:21,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:21,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:21,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:21,691 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:22:21,692 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:22:21,702 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 11:22:21,737 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2019-12-07 11:22:21,738 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:21,742 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 11:22:21,748 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-12-07 11:22:21,748 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 11:22:21,748 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1) = -4*ULTIMATE.start_main_~i~1 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 Supporting invariants [1*ULTIMATE.start_main_~numbers~0.offset >= 0] [2019-12-07 11:22:21,762 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-12-07 11:22:21,770 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 11:22:21,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:21,808 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:22:21,810 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:22:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:21,823 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 11:22:21,824 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:22:21,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:22:21,849 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-12-07 11:22:21,850 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 3 states. [2019-12-07 11:22:21,902 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-12-07 11:22:21,902 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-12-07 11:22:21,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 11:22:21,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2019-12-07 11:22:21,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 4 letters. Loop has 2 letters. [2019-12-07 11:22:21,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:22:21,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 6 letters. Loop has 2 letters. [2019-12-07 11:22:21,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:22:21,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 4 letters. Loop has 4 letters. [2019-12-07 11:22:21,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:22:21,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 74 transitions. [2019-12-07 11:22:21,910 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-12-07 11:22:21,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 21 states and 33 transitions. [2019-12-07 11:22:21,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-12-07 11:22:21,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-12-07 11:22:21,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 33 transitions. [2019-12-07 11:22:21,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:22:21,915 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2019-12-07 11:22:21,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 33 transitions. [2019-12-07 11:22:21,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-12-07 11:22:21,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 11:22:21,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2019-12-07 11:22:21,934 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2019-12-07 11:22:21,934 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2019-12-07 11:22:21,934 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-12-07 11:22:21,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 33 transitions. [2019-12-07 11:22:21,935 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-12-07 11:22:21,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:22:21,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:22:21,935 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-12-07 11:22:21,935 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 11:22:21,936 INFO L794 eck$LassoCheckResult]: Stem: 156#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-12-07 11:22:21,936 INFO L796 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-12-07 11:22:21,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:21,936 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-12-07 11:22:21,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:21,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322433427] [2019-12-07 11:22:21,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:21,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:22:21,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322433427] [2019-12-07 11:22:21,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:22:21,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:22:21,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81464866] [2019-12-07 11:22:21,978 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 11:22:21,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:21,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2019-12-07 11:22:21,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:21,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39044252] [2019-12-07 11:22:21,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:21,991 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:22,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:22:22,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:22:22,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:22:22,035 INFO L87 Difference]: Start difference. First operand 21 states and 33 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-12-07 11:22:22,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:22:22,056 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2019-12-07 11:22:22,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:22:22,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2019-12-07 11:22:22,059 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-12-07 11:22:22,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2019-12-07 11:22:22,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-12-07 11:22:22,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-12-07 11:22:22,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2019-12-07 11:22:22,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:22:22,060 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-12-07 11:22:22,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2019-12-07 11:22:22,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-12-07 11:22:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 11:22:22,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2019-12-07 11:22:22,062 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-12-07 11:22:22,062 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-12-07 11:22:22,062 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-12-07 11:22:22,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2019-12-07 11:22:22,063 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-12-07 11:22:22,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:22:22,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:22:22,064 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:22:22,064 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 11:22:22,064 INFO L794 eck$LassoCheckResult]: Stem: 206#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-12-07 11:22:22,064 INFO L796 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-12-07 11:22:22,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:22,065 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-12-07 11:22:22,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:22,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830401363] [2019-12-07 11:22:22,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:22,099 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:22,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:22,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2019-12-07 11:22:22,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:22,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209098431] [2019-12-07 11:22:22,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:22,112 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:22,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:22,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1899811567, now seen corresponding path program 1 times [2019-12-07 11:22:22,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:22,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013438820] [2019-12-07 11:22:22,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:22,148 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:22,429 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 97 [2019-12-07 11:22:22,525 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 11:22:22,525 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 11:22:22,525 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 11:22:22,526 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 11:22:22,526 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 11:22:22,526 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:22,526 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 11:22:22,526 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 11:22:22,526 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration3_Lasso [2019-12-07 11:22:22,526 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 11:22:22,526 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 11:22:22,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:22,742 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-12-07 11:22:22,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:22,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:22,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:22,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:22,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:22,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:22,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:22,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:22,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:22,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:22,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-12-07 11:22:22,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:22,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:22,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:22,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:22,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:22,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:22,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:22,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:22,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:22,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-12-07 11:22:22,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:22,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:22,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-12-07 11:22:22,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:23,134 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 11:22:23,135 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:23,137 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-12-07 11:22:23,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:23,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:22:23,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:23,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:23,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:23,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:22:23,140 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:22:23,141 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:23,148 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-12-07 11:22:23,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:23,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:23,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:23,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:23,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:22:23,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:22:23,154 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:23,158 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-12-07 11:22:23,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:23,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:23,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:23,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:23,160 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:22:23,161 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:22:23,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:23,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-12-07 11:22:23,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:23,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:23,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:23,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:23,178 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:22:23,178 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:22:23,187 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:23,191 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-12-07 11:22:23,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:23,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:23,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:23,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:23,195 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:22:23,195 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:22:23,199 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:23,203 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-12-07 11:22:23,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:23,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:23,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:23,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:23,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:22:23,213 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:22:23,232 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 11:22:23,256 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-12-07 11:22:23,256 INFO L444 ModelExtractionUtils]: 32 out of 58 variables were initially zero. Simplification set additionally 22 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:23,259 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 11:22:23,261 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 11:22:23,262 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 11:22:23,262 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_#t~malloc3.base)_1) = -1*ULTIMATE.start_lis_~best~0.offset - 4*ULTIMATE.start_lis_~i~0 + 1*v_rep(select #length ULTIMATE.start_lis_#t~malloc3.base)_1 Supporting invariants [] [2019-12-07 11:22:23,311 INFO L297 tatePredicateManager]: 16 out of 18 supporting invariants were superfluous and have been removed [2019-12-07 11:22:23,315 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 11:22:23,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:23,344 INFO L264 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 11:22:23,344 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:22:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:23,349 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 11:22:23,349 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:22:23,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:22:23,362 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-12-07 11:22:23,363 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-12-07 11:22:23,391 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 24 states and 35 transitions. Complement of second has 7 states. [2019-12-07 11:22:23,391 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-12-07 11:22:23,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 11:22:23,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-12-07 11:22:23,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 2 letters. [2019-12-07 11:22:23,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:22:23,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2019-12-07 11:22:23,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:22:23,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2019-12-07 11:22:23,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:22:23,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2019-12-07 11:22:23,393 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-12-07 11:22:23,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 31 transitions. [2019-12-07 11:22:23,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-12-07 11:22:23,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-12-07 11:22:23,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2019-12-07 11:22:23,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:22:23,394 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-12-07 11:22:23,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2019-12-07 11:22:23,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-12-07 11:22:23,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 11:22:23,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2019-12-07 11:22:23,395 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-12-07 11:22:23,395 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-12-07 11:22:23,396 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-12-07 11:22:23,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2019-12-07 11:22:23,396 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-12-07 11:22:23,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:22:23,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:22:23,397 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:22:23,397 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 11:22:23,397 INFO L794 eck$LassoCheckResult]: Stem: 383#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 377#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; 378#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 384#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; 379#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; 375#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 376#L535-3 assume !(main_~i~1 < main_~array_size~0); 380#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; 371#L517-3 assume !(lis_~i~0 < lis_~N); 372#L517-4 lis_~i~0 := 1; 365#L519-3 [2019-12-07 11:22:23,397 INFO L796 eck$LassoCheckResult]: Loop: 365#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 367#L520-3 assume !(lis_~j~0 < lis_~i~0); 386#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 365#L519-3 [2019-12-07 11:22:23,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:23,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1899811625, now seen corresponding path program 1 times [2019-12-07 11:22:23,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:23,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035193935] [2019-12-07 11:22:23,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:23,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:22:23,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035193935] [2019-12-07 11:22:23,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:22:23,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:22:23,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734577564] [2019-12-07 11:22:23,419 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 11:22:23,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:23,419 INFO L82 PathProgramCache]: Analyzing trace with hash 74687, now seen corresponding path program 1 times [2019-12-07 11:22:23,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:23,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669720730] [2019-12-07 11:22:23,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:23,423 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:23,433 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 11:22:23,433 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 11:22:23,433 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 11:22:23,433 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 11:22:23,434 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-12-07 11:22:23,434 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:23,434 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 11:22:23,434 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 11:22:23,434 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2019-12-07 11:22:23,434 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 11:22:23,434 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 11:22:23,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:23,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:23,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:23,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:23,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:23,477 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 11:22:23,478 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:23,482 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 11:22:23,482 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 11:22:23,486 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 11:22:23,486 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_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:23,490 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 11:22:23,491 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 11:22:23,494 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 11:22:23,494 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_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:23,497 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 11:22:23,497 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:23,504 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-12-07 11:22:23,504 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 11:22:23,609 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-12-07 11:22:23,611 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 11:22:23,611 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 11:22:23,611 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 11:22:23,611 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 11:22:23,611 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 11:22:23,612 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:23,612 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 11:22:23,612 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 11:22:23,612 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2019-12-07 11:22:23,612 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 11:22:23,612 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 11:22:23,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:23,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:23,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:23,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:23,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:23,658 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 11:22:23,658 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:23,661 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-12-07 11:22:23,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:23,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:23,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:23,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:23,664 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:22:23,664 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:22:23,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:23,671 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-12-07 11:22:23,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:23,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:23,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:23,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:23,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:22:23,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:22:23,677 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:23,682 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-12-07 11:22:23,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:23,683 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:22:23,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:23,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:23,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:23,684 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:22:23,684 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:22:23,686 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 11:22:23,688 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-12-07 11:22:23,688 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:23,691 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 11:22:23,691 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-12-07 11:22:23,691 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 11:22:23,691 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-12-07 11:22:23,693 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-12-07 11:22:23,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:23,712 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:22:23,713 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:22:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:23,716 WARN L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 11:22:23,716 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:22:23,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:22:23,733 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-12-07 11:22:23,733 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13 Second operand 4 states. [2019-12-07 11:22:23,775 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 43 states and 67 transitions. Complement of second has 9 states. [2019-12-07 11:22:23,775 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-12-07 11:22:23,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-12-07 11:22:23,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2019-12-07 11:22:23,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 3 letters. [2019-12-07 11:22:23,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:22:23,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 13 letters. Loop has 3 letters. [2019-12-07 11:22:23,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:22:23,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 6 letters. [2019-12-07 11:22:23,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:22:23,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 67 transitions. [2019-12-07 11:22:23,778 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-12-07 11:22:23,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 62 transitions. [2019-12-07 11:22:23,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-12-07 11:22:23,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-12-07 11:22:23,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 62 transitions. [2019-12-07 11:22:23,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 11:22:23,779 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 62 transitions. [2019-12-07 11:22:23,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 62 transitions. [2019-12-07 11:22:23,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2019-12-07 11:22:23,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 11:22:23,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2019-12-07 11:22:23,781 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 50 transitions. [2019-12-07 11:22:23,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:22:23,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:22:23,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:22:23,782 INFO L87 Difference]: Start difference. First operand 33 states and 50 transitions. Second operand 4 states. [2019-12-07 11:22:23,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:22:23,815 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2019-12-07 11:22:23,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:22:23,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2019-12-07 11:22:23,816 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-12-07 11:22:23,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 50 transitions. [2019-12-07 11:22:23,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-12-07 11:22:23,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-12-07 11:22:23,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2019-12-07 11:22:23,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 11:22:23,818 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 50 transitions. [2019-12-07 11:22:23,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2019-12-07 11:22:23,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-12-07 11:22:23,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 11:22:23,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2019-12-07 11:22:23,820 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2019-12-07 11:22:23,820 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2019-12-07 11:22:23,821 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-12-07 11:22:23,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 49 transitions. [2019-12-07 11:22:23,821 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-12-07 11:22:23,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:22:23,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:22:23,822 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:22:23,822 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:22:23,822 INFO L794 eck$LassoCheckResult]: Stem: 590#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 582#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; 583#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 591#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; 584#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; 580#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 581#L535-3 assume !(main_~i~1 < main_~array_size~0); 585#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; 575#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); 572#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 573#L517-3 assume !(lis_~i~0 < lis_~N); 576#L517-4 lis_~i~0 := 1; 579#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 569#L520-3 [2019-12-07 11:22:23,822 INFO L796 eck$LassoCheckResult]: Loop: 569#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; 586#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; 587#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem10; 592#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 594#L520-3 assume !(lis_~j~0 < lis_~i~0); 597#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 567#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 569#L520-3 [2019-12-07 11:22:23,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:23,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1792663252, now seen corresponding path program 1 times [2019-12-07 11:22:23,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:23,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889574698] [2019-12-07 11:22:23,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:23,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:22:23,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889574698] [2019-12-07 11:22:23,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798361037] [2019-12-07 11:22:23,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:22:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:23,893 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 11:22:23,893 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:22:23,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:22:23,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:22:23,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-12-07 11:22:23,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332328721] [2019-12-07 11:22:23,906 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 11:22:23,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:23,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 1 times [2019-12-07 11:22:23,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:23,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767796536] [2019-12-07 11:22:23,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:23,919 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:24,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:22:24,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:22:24,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:22:24,034 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. cyclomatic complexity: 21 Second operand 9 states. [2019-12-07 11:22:24,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:22:24,107 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2019-12-07 11:22:24,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:22:24,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 71 transitions. [2019-12-07 11:22:24,108 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-12-07 11:22:24,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 71 transitions. [2019-12-07 11:22:24,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-12-07 11:22:24,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-12-07 11:22:24,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 71 transitions. [2019-12-07 11:22:24,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 11:22:24,109 INFO L688 BuchiCegarLoop]: Abstraction has 51 states and 71 transitions. [2019-12-07 11:22:24,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 71 transitions. [2019-12-07 11:22:24,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2019-12-07 11:22:24,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 11:22:24,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2019-12-07 11:22:24,112 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 64 transitions. [2019-12-07 11:22:24,112 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 64 transitions. [2019-12-07 11:22:24,112 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-12-07 11:22:24,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 64 transitions. [2019-12-07 11:22:24,113 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-12-07 11:22:24,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:22:24,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:22:24,114 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:22:24,114 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 11:22:24,114 INFO L794 eck$LassoCheckResult]: Stem: 733#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 723#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; 724#L530 assume main_~array_size~0 < 1 || main_~array_size~0 >= 536870911;main_~array_size~0 := 1; 734#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; 725#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; 721#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 722#L535-3 assume !(main_~i~1 < main_~array_size~0); 751#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; 750#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); 749#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 748#L517-3 assume !(lis_~i~0 < lis_~N); 747#L517-4 lis_~i~0 := 1; 709#L519-3 assume !(lis_~i~0 < lis_~N); 710#L519-4 lis_~i~0 := 0; 715#L523-3 [2019-12-07 11:22:24,114 INFO L796 eck$LassoCheckResult]: Loop: 715#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); 718#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; 719#L523-2 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 715#L523-3 [2019-12-07 11:22:24,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:24,114 INFO L82 PathProgramCache]: Analyzing trace with hash -520179462, now seen corresponding path program 1 times [2019-12-07 11:22:24,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:24,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83196806] [2019-12-07 11:22:24,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:24,135 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:24,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:24,135 INFO L82 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 1 times [2019-12-07 11:22:24,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:24,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608355451] [2019-12-07 11:22:24,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:24,140 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:24,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:24,141 INFO L82 PathProgramCache]: Analyzing trace with hash -424266948, now seen corresponding path program 1 times [2019-12-07 11:22:24,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:24,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115781240] [2019-12-07 11:22:24,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:24,164 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:24,576 WARN L192 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 127 [2019-12-07 11:22:24,707 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-12-07 11:22:24,709 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 11:22:24,709 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 11:22:24,709 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 11:22:24,709 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 11:22:24,709 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 11:22:24,709 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:24,709 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 11:22:24,709 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 11:22:24,709 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration6_Lasso [2019-12-07 11:22:24,709 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 11:22:24,710 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 11:22:24,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:24,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:24,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:24,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:24,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:24,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:24,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:24,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:24,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:24,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:24,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:24,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:24,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:24,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:24,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:24,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:24,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:24,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:24,949 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-12-07 11:22:24,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-12-07 11:22:24,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-12-07 11:22:24,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-12-07 11:22:24,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-12-07 11:22:24,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-12-07 11:22:24,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-12-07 11:22:24,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-12-07 11:22:24,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-12-07 11:22:25,139 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-12-07 11:22:25,299 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 11:22:25,299 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:25,302 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-12-07 11:22:25,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:25,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:22:25,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:25,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:25,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:25,304 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:22:25,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:22:25,305 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:25,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-12-07 11:22:25,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:25,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:22:25,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:25,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:25,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:25,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:22:25,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:22:25,312 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:25,315 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-12-07 11:22:25,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:25,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:25,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:25,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:25,318 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:22:25,318 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:22:25,320 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:25,325 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-12-07 11:22:25,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:25,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:22:25,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:25,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:25,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:25,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:22:25,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:22:25,328 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:25,331 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-12-07 11:22:25,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:25,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:22:25,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:25,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:25,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:25,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:22:25,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:22:25,334 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:25,338 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-12-07 11:22:25,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:25,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:25,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:25,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:25,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:22:25,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:22:25,344 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:25,349 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-12-07 11:22:25,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:25,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:25,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:25,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:25,351 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:22:25,351 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:22:25,354 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:25,357 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-12-07 11:22:25,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:25,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:22:25,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:25,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:25,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:25,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:22:25,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:22:25,360 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:25,366 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-12-07 11:22:25,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:25,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:22:25,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:25,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:25,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:25,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:22:25,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:22:25,369 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:25,373 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-12-07 11:22:25,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:25,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:22:25,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:25,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:25,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:25,375 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:22:25,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:22:25,376 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:25,380 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-12-07 11:22:25,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:25,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:22:25,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:25,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:25,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:25,382 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:22:25,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:22:25,383 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:25,389 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-12-07 11:22:25,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:25,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:22:25,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:25,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:25,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:25,390 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:22:25,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:22:25,392 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:25,395 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-12-07 11:22:25,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:25,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:25,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:25,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:25,397 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:22:25,397 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:22:25,399 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:25,403 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-12-07 11:22:25,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:25,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:22:25,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:25,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:25,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:25,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:22:25,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:22:25,405 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:25,409 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-12-07 11:22:25,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:25,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:22:25,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:25,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:25,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:25,411 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:22:25,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:22:25,412 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:25,415 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-12-07 11:22:25,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:25,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:22:25,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:25,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:25,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:25,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:22:25,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:22:25,418 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:25,422 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-12-07 11:22:25,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:25,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:22:25,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:25,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:25,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:25,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:22:25,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:22:25,424 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:25,427 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-12-07 11:22:25,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:25,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:25,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:25,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:25,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:22:25,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:22:25,439 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:25,442 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-12-07 11:22:25,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:25,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:25,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:25,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:25,444 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:22:25,444 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:22:25,446 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:25,450 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-12-07 11:22:25,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:25,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:25,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:25,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:25,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:22:25,453 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:22:25,457 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:25,460 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-12-07 11:22:25,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:25,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:25,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:25,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:25,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:22:25,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:22:25,484 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 11:22:25,530 INFO L443 ModelExtractionUtils]: Simplification made 32 calls to the SMT solver. [2019-12-07 11:22:25,530 INFO L444 ModelExtractionUtils]: 31 out of 55 variables were initially zero. Simplification set additionally 21 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:25,538 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 11:22:25,540 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 11:22:25,540 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 11:22:25,540 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-12-07 11:22:25,574 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-12-07 11:22:25,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:25,591 INFO L264 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:22:25,592 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:22:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:25,595 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:22:25,596 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:22:25,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:22:25,602 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-12-07 11:22:25,602 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 64 transitions. cyclomatic complexity: 26 Second operand 3 states. [2019-12-07 11:22:25,610 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 64 transitions. cyclomatic complexity: 26. Second operand 3 states. Result 48 states and 69 transitions. Complement of second has 4 states. [2019-12-07 11:22:25,611 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-12-07 11:22:25,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 11:22:25,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2019-12-07 11:22:25,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 14 letters. Loop has 3 letters. [2019-12-07 11:22:25,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:22:25,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 17 letters. Loop has 3 letters. [2019-12-07 11:22:25,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:22:25,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 14 letters. Loop has 6 letters. [2019-12-07 11:22:25,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:22:25,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 69 transitions. [2019-12-07 11:22:25,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-12-07 11:22:25,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 31 states and 42 transitions. [2019-12-07 11:22:25,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-12-07 11:22:25,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-12-07 11:22:25,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 42 transitions. [2019-12-07 11:22:25,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 11:22:25,614 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-12-07 11:22:25,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 42 transitions. [2019-12-07 11:22:25,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-07 11:22:25,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 11:22:25,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-12-07 11:22:25,615 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-12-07 11:22:25,615 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-12-07 11:22:25,615 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-12-07 11:22:25,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2019-12-07 11:22:25,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-12-07 11:22:25,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:22:25,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:22:25,616 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:22:25,616 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:22:25,617 INFO L794 eck$LassoCheckResult]: Stem: 952#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 944#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; 945#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 954#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; 946#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; 942#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 943#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; 947#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 963#L535-3 assume !(main_~i~1 < main_~array_size~0); 953#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; 939#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); 937#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 938#L517-3 assume !(lis_~i~0 < lis_~N); 940#L517-4 lis_~i~0 := 1; 941#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 934#L520-3 [2019-12-07 11:22:25,617 INFO L796 eck$LassoCheckResult]: Loop: 934#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; 948#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; 949#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem10; 955#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 957#L520-3 assume !(lis_~j~0 < lis_~i~0); 960#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 933#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 934#L520-3 [2019-12-07 11:22:25,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:25,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1166516274, now seen corresponding path program 2 times [2019-12-07 11:22:25,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:25,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987604239] [2019-12-07 11:22:25,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:25,673 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:22:25,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987604239] [2019-12-07 11:22:25,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916583692] [2019-12-07 11:22:25,673 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:22:25,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 11:22:25,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:22:25,709 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 11:22:25,709 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:22:25,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 11:22:25,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:22:25,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2019-12-07 11:22:25,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742202105] [2019-12-07 11:22:25,733 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 11:22:25,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:25,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 2 times [2019-12-07 11:22:25,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:25,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329864050] [2019-12-07 11:22:25,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:25,743 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:25,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:22:25,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:22:25,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:22:25,843 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. cyclomatic complexity: 15 Second operand 12 states. [2019-12-07 11:22:25,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:22:25,955 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2019-12-07 11:22:25,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:22:25,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 65 transitions. [2019-12-07 11:22:25,957 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-12-07 11:22:25,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 65 transitions. [2019-12-07 11:22:25,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-12-07 11:22:25,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-12-07 11:22:25,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 65 transitions. [2019-12-07 11:22:25,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 11:22:25,958 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 65 transitions. [2019-12-07 11:22:25,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 65 transitions. [2019-12-07 11:22:25,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 33. [2019-12-07 11:22:25,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 11:22:25,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2019-12-07 11:22:25,960 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-12-07 11:22:25,960 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-12-07 11:22:25,960 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-12-07 11:22:25,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 44 transitions. [2019-12-07 11:22:25,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-12-07 11:22:25,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:22:25,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:22:25,962 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:22:25,962 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:22:25,962 INFO L794 eck$LassoCheckResult]: Stem: 1100#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1093#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; 1094#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1101#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; 1091#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; 1089#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1090#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; 1092#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1110#L535-3 assume !(main_~i~1 < main_~array_size~0); 1099#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; 1085#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); 1083#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1084#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); 1086#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1109#L517-3 assume !(lis_~i~0 < lis_~N); 1087#L517-4 lis_~i~0 := 1; 1088#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1080#L520-3 [2019-12-07 11:22:25,962 INFO L796 eck$LassoCheckResult]: Loop: 1080#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; 1095#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; 1096#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem10; 1102#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1104#L520-3 assume !(lis_~j~0 < lis_~i~0); 1107#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1079#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1080#L520-3 [2019-12-07 11:22:25,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:25,962 INFO L82 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 3 times [2019-12-07 11:22:25,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:25,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999994059] [2019-12-07 11:22:25,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:25,988 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:25,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:25,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 3 times [2019-12-07 11:22:25,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:25,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922776830] [2019-12-07 11:22:25,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:25,999 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:25,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:25,999 INFO L82 PathProgramCache]: Analyzing trace with hash 502604869, now seen corresponding path program 1 times [2019-12-07 11:22:25,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:25,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567083706] [2019-12-07 11:22:25,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:26,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 11:22:26,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567083706] [2019-12-07 11:22:26,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187218438] [2019-12-07 11:22:26,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:22:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:26,089 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 11:22:26,090 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:22:26,142 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 11:22:26,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:22:26,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-12-07 11:22:26,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158014521] [2019-12-07 11:22:26,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:22:26,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 11:22:26,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:22:26,248 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. cyclomatic complexity: 15 Second operand 16 states. [2019-12-07 11:22:26,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:22:26,362 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2019-12-07 11:22:26,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:22:26,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 78 transitions. [2019-12-07 11:22:26,362 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-12-07 11:22:26,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 49 states and 64 transitions. [2019-12-07 11:22:26,363 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-12-07 11:22:26,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-12-07 11:22:26,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 64 transitions. [2019-12-07 11:22:26,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 11:22:26,363 INFO L688 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2019-12-07 11:22:26,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 64 transitions. [2019-12-07 11:22:26,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-12-07 11:22:26,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 11:22:26,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-12-07 11:22:26,365 INFO L711 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-12-07 11:22:26,366 INFO L591 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-12-07 11:22:26,366 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-12-07 11:22:26,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 62 transitions. [2019-12-07 11:22:26,366 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-12-07 11:22:26,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:22:26,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:22:26,366 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:22:26,367 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 11:22:26,367 INFO L794 eck$LassoCheckResult]: Stem: 1292#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1284#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; 1285#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1294#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; 1286#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; 1282#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1283#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; 1287#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1316#L535-3 assume !(main_~i~1 < main_~array_size~0); 1315#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; 1314#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); 1313#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1311#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); 1310#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1309#L517-3 assume !(lis_~i~0 < lis_~N); 1308#L517-4 lis_~i~0 := 1; 1272#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1273#L520-3 [2019-12-07 11:22:26,367 INFO L796 eck$LassoCheckResult]: Loop: 1273#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; 1288#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; 1289#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem10; 1298#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1273#L520-3 [2019-12-07 11:22:26,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:26,367 INFO L82 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 4 times [2019-12-07 11:22:26,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:26,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367480776] [2019-12-07 11:22:26,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:26,383 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:26,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:26,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 1 times [2019-12-07 11:22:26,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:26,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376983706] [2019-12-07 11:22:26,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:26,389 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:26,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:26,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2057178037, now seen corresponding path program 1 times [2019-12-07 11:22:26,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:26,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311283057] [2019-12-07 11:22:26,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:26,750 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:22:26,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311283057] [2019-12-07 11:22:26,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214627249] [2019-12-07 11:22:26,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:22:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:26,784 INFO L264 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 11:22:26,785 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:22:26,805 INFO L377 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-12-07 11:22:26,806 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:22:26,809 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:22:26,809 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:22:26,809 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-12-07 11:22:26,828 INFO L377 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-12-07 11:22:26,828 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:22:26,834 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:22:26,835 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:22:26,835 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2019-12-07 11:22:26,897 INFO L343 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2019-12-07 11:22:26,898 INFO L377 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 50 treesize of output 41 [2019-12-07 11:22:26,898 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:22:26,905 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:22:26,906 INFO L534 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-12-07 11:22:26,906 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:37 [2019-12-07 11:22:27,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:22:27,028 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 11:22:27,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:22:27,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 22 [2019-12-07 11:22:27,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247910031] [2019-12-07 11:22:27,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:22:27,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 11:22:27,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-12-07 11:22:27,125 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. cyclomatic complexity: 21 Second operand 22 states. [2019-12-07 11:22:27,775 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-12-07 11:22:28,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:22:28,653 INFO L93 Difference]: Finished difference Result 103 states and 143 transitions. [2019-12-07 11:22:28,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 11:22:28,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 143 transitions. [2019-12-07 11:22:28,655 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 26 [2019-12-07 11:22:28,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 103 states and 143 transitions. [2019-12-07 11:22:28,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2019-12-07 11:22:28,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2019-12-07 11:22:28,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 143 transitions. [2019-12-07 11:22:28,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 11:22:28,656 INFO L688 BuchiCegarLoop]: Abstraction has 103 states and 143 transitions. [2019-12-07 11:22:28,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 143 transitions. [2019-12-07 11:22:28,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 66. [2019-12-07 11:22:28,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 11:22:28,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 88 transitions. [2019-12-07 11:22:28,660 INFO L711 BuchiCegarLoop]: Abstraction has 66 states and 88 transitions. [2019-12-07 11:22:28,660 INFO L591 BuchiCegarLoop]: Abstraction has 66 states and 88 transitions. [2019-12-07 11:22:28,660 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-12-07 11:22:28,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 88 transitions. [2019-12-07 11:22:28,660 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-12-07 11:22:28,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:22:28,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:22:28,661 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:22:28,661 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 11:22:28,661 INFO L794 eck$LassoCheckResult]: Stem: 1560#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1550#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; 1551#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1563#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; 1552#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; 1553#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1554#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; 1555#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1575#L535-3 assume !(main_~i~1 < main_~array_size~0); 1576#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; 1544#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); 1542#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1543#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); 1545#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1601#L517-3 assume !(lis_~i~0 < lis_~N); 1602#L517-4 lis_~i~0 := 1; 1538#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1539#L520-3 [2019-12-07 11:22:28,661 INFO L796 eck$LassoCheckResult]: Loop: 1539#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; 1595#L521 assume !lis_#t~short11; 1592#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem10; 1568#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1539#L520-3 [2019-12-07 11:22:28,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:28,661 INFO L82 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 5 times [2019-12-07 11:22:28,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:28,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570756158] [2019-12-07 11:22:28,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:28,677 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:28,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:28,677 INFO L82 PathProgramCache]: Analyzing trace with hash 2560232, now seen corresponding path program 1 times [2019-12-07 11:22:28,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:28,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522311114] [2019-12-07 11:22:28,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:28,681 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:28,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:28,682 INFO L82 PathProgramCache]: Analyzing trace with hash 2057179959, now seen corresponding path program 1 times [2019-12-07 11:22:28,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:28,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919187709] [2019-12-07 11:22:28,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:28,701 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:29,907 WARN L192 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 194 DAG size of output: 154 [2019-12-07 11:22:30,277 WARN L192 SmtUtils]: Spent 367.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-12-07 11:22:30,279 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 11:22:30,280 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 11:22:30,280 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 11:22:30,280 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 11:22:30,280 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 11:22:30,280 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:30,280 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 11:22:30,280 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 11:22:30,280 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration10_Lasso [2019-12-07 11:22:30,280 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 11:22:30,280 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 11:22:30,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:30,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:30,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:30,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:30,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-12-07 11:22:30,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:30,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-12-07 11:22:30,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:30,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-12-07 11:22:30,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:30,743 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 96 [2019-12-07 11:22:30,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:30,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:30,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:30,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:30,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:30,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-12-07 11:22:30,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:30,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:30,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:30,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:30,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:30,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:30,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:30,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:30,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:22:30,971 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-12-07 11:22:31,198 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 11:22:31,198 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:31,201 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-12-07 11:22:31,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:31,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:22:31,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:31,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:31,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:31,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:22:31,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:22:31,203 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:31,206 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-12-07 11:22:31,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:31,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:22:31,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:31,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:31,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:31,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:22:31,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:22:31,209 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:31,213 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-12-07 11:22:31,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:31,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:31,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:31,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:31,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:22:31,215 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:22:31,218 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:31,221 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-12-07 11:22:31,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:31,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:22:31,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:31,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:31,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:31,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:22:31,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:22:31,224 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:31,227 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-12-07 11:22:31,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:31,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:22:31,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:31,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:31,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:31,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:22:31,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:22:31,230 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:31,233 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-12-07 11:22:31,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:31,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:22:31,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:31,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:31,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:31,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:22:31,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:22:31,236 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:31,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-12-07 11:22:31,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:31,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:31,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:31,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:31,243 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:22:31,243 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:22:31,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:31,249 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-12-07 11:22:31,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:31,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:22:31,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:31,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:31,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:31,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:22:31,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:22:31,252 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:31,255 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-12-07 11:22:31,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:31,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:31,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:31,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:31,259 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:22:31,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:22:31,261 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:31,265 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-12-07 11:22:31,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:31,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:31,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:31,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:31,267 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:22:31,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:22:31,269 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:31,273 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-12-07 11:22:31,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:31,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:31,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:31,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:31,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:22:31,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:22:31,278 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:31,281 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-12-07 11:22:31,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:31,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:22:31,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:31,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:31,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:31,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:22:31,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:22:31,285 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:31,288 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-12-07 11:22:31,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:31,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:31,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:31,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:31,290 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:22:31,290 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:22:31,292 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:31,296 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-12-07 11:22:31,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:31,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:31,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:31,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:31,298 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:22:31,298 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:22:31,300 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:31,303 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-12-07 11:22:31,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:22:31,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:22:31,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:22:31,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:22:31,314 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:22:31,314 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:22:31,335 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 11:22:31,382 INFO L443 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2019-12-07 11:22:31,382 INFO L444 ModelExtractionUtils]: 9 out of 64 variables were initially zero. Simplification set additionally 49 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:22:31,384 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 11:22:31,388 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-12-07 11:22:31,388 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 11:22:31,388 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0, v_rep(select #length ULTIMATE.start_lis_#t~malloc2.base)_3, ULTIMATE.start_lis_~a.offset) = -4*ULTIMATE.start_lis_~j~0 + 2*v_rep(select #length ULTIMATE.start_lis_#t~malloc2.base)_3 - 1*ULTIMATE.start_lis_~a.offset Supporting invariants [1*v_rep(select #length ULTIMATE.start_lis_#t~malloc2.base)_3 - 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_2 >= 0] [2019-12-07 11:22:31,506 INFO L297 tatePredicateManager]: 34 out of 36 supporting invariants were superfluous and have been removed [2019-12-07 11:22:31,510 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 11:22:31,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:31,542 INFO L264 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 11:22:31,543 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:22:31,547 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-12-07 11:22:31,547 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:22:31,552 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:22:31,552 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:22:31,552 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 11:22:31,634 INFO L430 ElimStorePlain]: Different costs {2=[|v_#length_157|], 4=[|v_#valid_185|]} [2019-12-07 11:22:31,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:22:31,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:22:31,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:22:31,640 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-12-07 11:22:31,641 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:22:31,662 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:22:31,679 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:22:31,679 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 38 [2019-12-07 11:22:31,680 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:22:31,700 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:22:31,701 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:22:31,701 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:64 [2019-12-07 11:22:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:31,987 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 11:22:31,987 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:22:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:22:32,010 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2019-12-07 11:22:32,010 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 88 transitions. cyclomatic complexity: 29 Second operand 11 states. [2019-12-07 11:22:32,397 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-12-07 11:22:32,635 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 88 transitions. cyclomatic complexity: 29. Second operand 11 states. Result 79 states and 109 transitions. Complement of second has 13 states. [2019-12-07 11:22:32,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 8 stem states 1 non-accepting loop states 2 accepting loop states [2019-12-07 11:22:32,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-12-07 11:22:32,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 35 transitions. [2019-12-07 11:22:32,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 35 transitions. Stem has 17 letters. Loop has 4 letters. [2019-12-07 11:22:32,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:22:32,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 35 transitions. Stem has 21 letters. Loop has 4 letters. [2019-12-07 11:22:32,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:22:32,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 35 transitions. Stem has 17 letters. Loop has 8 letters. [2019-12-07 11:22:32,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:22:32,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 109 transitions. [2019-12-07 11:22:32,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-12-07 11:22:32,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 49 states and 66 transitions. [2019-12-07 11:22:32,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-12-07 11:22:32,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-12-07 11:22:32,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 66 transitions. [2019-12-07 11:22:32,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 11:22:32,638 INFO L688 BuchiCegarLoop]: Abstraction has 49 states and 66 transitions. [2019-12-07 11:22:32,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 66 transitions. [2019-12-07 11:22:32,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2019-12-07 11:22:32,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 11:22:32,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-12-07 11:22:32,640 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-12-07 11:22:32,640 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-12-07 11:22:32,640 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-12-07 11:22:32,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 60 transitions. [2019-12-07 11:22:32,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-12-07 11:22:32,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:22:32,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:22:32,641 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:22:32,641 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 11:22:32,641 INFO L794 eck$LassoCheckResult]: Stem: 1968#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1959#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; 1960#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1970#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; 1961#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; 1957#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1958#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; 1962#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1990#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; 1989#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1988#L535-3 assume !(main_~i~1 < main_~array_size~0); 1969#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; 1953#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); 1954#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1987#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); 1986#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1985#L517-3 assume !(lis_~i~0 < lis_~N); 1984#L517-4 lis_~i~0 := 1; 1983#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1982#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; 1981#L521 assume !lis_#t~short11; 1964#L521-2 [2019-12-07 11:22:32,641 INFO L796 eck$LassoCheckResult]: Loop: 1964#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem10; 1972#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1974#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; 1963#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; 1964#L521-2 [2019-12-07 11:22:32,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:32,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1044113581, now seen corresponding path program 1 times [2019-12-07 11:22:32,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:32,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611745726] [2019-12-07 11:22:32,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:32,696 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:22:32,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611745726] [2019-12-07 11:22:32,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037717778] [2019-12-07 11:22:32,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:22:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:32,727 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 11:22:32,728 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:22:32,784 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:22:32,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:22:32,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-12-07 11:22:32,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518136769] [2019-12-07 11:22:32,785 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 11:22:32,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:32,785 INFO L82 PathProgramCache]: Analyzing trace with hash 2895270, now seen corresponding path program 2 times [2019-12-07 11:22:32,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:32,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270198288] [2019-12-07 11:22:32,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:32,791 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:32,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:22:32,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 11:22:32,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-12-07 11:22:32,937 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. cyclomatic complexity: 19 Second operand 17 states. [2019-12-07 11:22:33,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:22:33,092 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2019-12-07 11:22:33,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:22:33,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 49 transitions. [2019-12-07 11:22:33,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-12-07 11:22:33,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 49 transitions. [2019-12-07 11:22:33,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-12-07 11:22:33,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-12-07 11:22:33,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 49 transitions. [2019-12-07 11:22:33,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 11:22:33,094 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 49 transitions. [2019-12-07 11:22:33,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 49 transitions. [2019-12-07 11:22:33,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-12-07 11:22:33,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-07 11:22:33,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2019-12-07 11:22:33,095 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-12-07 11:22:33,096 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-12-07 11:22:33,096 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-12-07 11:22:33,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 48 transitions. [2019-12-07 11:22:33,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-12-07 11:22:33,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:22:33,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:22:33,096 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:22:33,097 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:22:33,097 INFO L794 eck$LassoCheckResult]: Stem: 2147#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2139#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; 2140#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2149#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; 2141#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; 2137#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2138#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; 2142#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2161#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; 2160#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2159#L535-3 assume !(main_~i~1 < main_~array_size~0); 2148#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; 2132#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); 2133#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2162#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); 2130#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2131#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); 2134#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2158#L517-3 assume !(lis_~i~0 < lis_~N); 2135#L517-4 lis_~i~0 := 1; 2136#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2127#L520-3 [2019-12-07 11:22:33,097 INFO L796 eck$LassoCheckResult]: Loop: 2127#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; 2143#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; 2144#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem10; 2150#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2152#L520-3 assume !(lis_~j~0 < lis_~i~0); 2154#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2126#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2127#L520-3 [2019-12-07 11:22:33,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:33,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1042401588, now seen corresponding path program 6 times [2019-12-07 11:22:33,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:33,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546291499] [2019-12-07 11:22:33,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:33,113 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:33,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:33,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 4 times [2019-12-07 11:22:33,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:33,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31562742] [2019-12-07 11:22:33,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:33,119 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:33,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:33,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1507386423, now seen corresponding path program 2 times [2019-12-07 11:22:33,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:33,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728333606] [2019-12-07 11:22:33,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:33,771 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:22:33,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728333606] [2019-12-07 11:22:33,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399127555] [2019-12-07 11:22:33,772 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:22:33,807 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 11:22:33,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:22:33,808 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 11:22:33,809 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:22:33,813 INFO L377 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-12-07 11:22:33,813 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:22:33,816 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:22:33,817 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:22:33,817 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 11:22:33,837 INFO L377 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-12-07 11:22:33,837 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:22:33,843 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:22:33,843 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:22:33,843 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2019-12-07 11:22:33,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:22:33,899 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:22:33,899 INFO L377 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-12-07 11:22:33,900 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:22:33,918 INFO L614 ElimStorePlain]: treesize reduction 24, result has 66.2 percent of original size [2019-12-07 11:22:33,918 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:22:33,918 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:64, output treesize:47 [2019-12-07 11:22:33,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:22:33,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:22:33,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:22:33,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:22:34,020 INFO L343 Elim1Store]: treesize reduction 10, result has 87.7 percent of original size [2019-12-07 11:22:34,021 INFO L377 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-12-07 11:22:34,021 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:22:34,050 INFO L614 ElimStorePlain]: treesize reduction 54, result has 54.6 percent of original size [2019-12-07 11:22:34,051 INFO L534 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-12-07 11:22:34,051 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:82, output treesize:65 [2019-12-07 11:22:34,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:22:34,473 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 11:22:34,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:22:34,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 28 [2019-12-07 11:22:34,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550920207] [2019-12-07 11:22:34,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:22:34,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 11:22:34,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2019-12-07 11:22:34,582 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. cyclomatic complexity: 15 Second operand 28 states. [2019-12-07 11:22:36,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:22:36,824 INFO L93 Difference]: Finished difference Result 116 states and 167 transitions. [2019-12-07 11:22:36,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 11:22:36,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 167 transitions. [2019-12-07 11:22:36,825 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 33 [2019-12-07 11:22:36,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 167 transitions. [2019-12-07 11:22:36,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2019-12-07 11:22:36,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2019-12-07 11:22:36,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 167 transitions. [2019-12-07 11:22:36,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 11:22:36,827 INFO L688 BuchiCegarLoop]: Abstraction has 116 states and 167 transitions. [2019-12-07 11:22:36,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 167 transitions. [2019-12-07 11:22:36,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 49. [2019-12-07 11:22:36,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 11:22:36,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2019-12-07 11:22:36,830 INFO L711 BuchiCegarLoop]: Abstraction has 49 states and 66 transitions. [2019-12-07 11:22:36,830 INFO L591 BuchiCegarLoop]: Abstraction has 49 states and 66 transitions. [2019-12-07 11:22:36,830 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-12-07 11:22:36,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 66 transitions. [2019-12-07 11:22:36,830 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-12-07 11:22:36,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:22:36,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:22:36,831 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:22:36,831 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 11:22:36,831 INFO L794 eck$LassoCheckResult]: Stem: 2453#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2444#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; 2445#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2455#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; 2446#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; 2442#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2443#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; 2447#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2471#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; 2470#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2469#L535-3 assume !(main_~i~1 < main_~array_size~0); 2454#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; 2438#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); 2436#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2437#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); 2439#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2472#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); 2468#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2467#L517-3 assume !(lis_~i~0 < lis_~N); 2440#L517-4 lis_~i~0 := 1; 2441#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2475#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; 2448#L521 [2019-12-07 11:22:36,831 INFO L796 eck$LassoCheckResult]: Loop: 2448#L521 assume !lis_#t~short11; 2450#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem10; 2476#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2474#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; 2448#L521 [2019-12-07 11:22:36,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:36,832 INFO L82 PathProgramCache]: Analyzing trace with hash 2045289193, now seen corresponding path program 1 times [2019-12-07 11:22:36,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:36,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700961373] [2019-12-07 11:22:36,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:36,857 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:36,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:36,857 INFO L82 PathProgramCache]: Analyzing trace with hash 2715002, now seen corresponding path program 2 times [2019-12-07 11:22:36,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:36,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614459993] [2019-12-07 11:22:36,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:36,861 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:36,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:36,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1035361378, now seen corresponding path program 2 times [2019-12-07 11:22:36,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:36,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815601877] [2019-12-07 11:22:36,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:36,903 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 11:22:36,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815601877] [2019-12-07 11:22:36,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:22:36,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:22:36,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113249835] [2019-12-07 11:22:36,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:22:36,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:22:36,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:22:36,971 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. cyclomatic complexity: 23 Second operand 7 states. [2019-12-07 11:22:37,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:22:37,013 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2019-12-07 11:22:37,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:22:37,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 70 transitions. [2019-12-07 11:22:37,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-12-07 11:22:37,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 70 transitions. [2019-12-07 11:22:37,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-12-07 11:22:37,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-12-07 11:22:37,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 70 transitions. [2019-12-07 11:22:37,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 11:22:37,015 INFO L688 BuchiCegarLoop]: Abstraction has 55 states and 70 transitions. [2019-12-07 11:22:37,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 70 transitions. [2019-12-07 11:22:37,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2019-12-07 11:22:37,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 11:22:37,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2019-12-07 11:22:37,016 INFO L711 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2019-12-07 11:22:37,016 INFO L591 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2019-12-07 11:22:37,017 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-12-07 11:22:37,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 64 transitions. [2019-12-07 11:22:37,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-12-07 11:22:37,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:22:37,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:22:37,017 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-12-07 11:22:37,017 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:22:37,018 INFO L794 eck$LassoCheckResult]: Stem: 2579#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2569#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; 2570#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2581#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; 2571#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; 2567#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2568#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; 2572#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2594#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; 2593#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2592#L535-3 assume !(main_~i~1 < main_~array_size~0); 2580#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; 2562#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); 2563#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2564#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); 2560#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2561#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); 2591#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2590#L517-3 assume !(lis_~i~0 < lis_~N); 2565#L517-4 lis_~i~0 := 1; 2566#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2599#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; 2574#L521-2 assume lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem10;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); 2582#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2584#L520-3 assume !(lis_~j~0 < lis_~i~0); 2586#L519-2 [2019-12-07 11:22:37,018 INFO L796 eck$LassoCheckResult]: Loop: 2586#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2556#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2557#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; 2595#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; 2598#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem10; 2597#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2596#L520-3 assume !(lis_~j~0 < lis_~i~0); 2586#L519-2 [2019-12-07 11:22:37,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:37,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1035299872, now seen corresponding path program 1 times [2019-12-07 11:22:37,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:37,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343142187] [2019-12-07 11:22:37,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:37,045 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:37,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:37,046 INFO L82 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 5 times [2019-12-07 11:22:37,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:37,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724139124] [2019-12-07 11:22:37,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:37,051 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:37,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:37,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1635630457, now seen corresponding path program 1 times [2019-12-07 11:22:37,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:37,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565450198] [2019-12-07 11:22:37,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:37,101 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 11:22:37,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565450198] [2019-12-07 11:22:37,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094412841] [2019-12-07 11:22:37,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:22:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:37,144 INFO L264 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 11:22:37,145 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:22:37,172 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 11:22:37,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:22:37,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2019-12-07 11:22:37,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121076806] [2019-12-07 11:22:37,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:22:37,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 11:22:37,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:22:37,287 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. cyclomatic complexity: 19 Second operand 13 states. [2019-12-07 11:22:37,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:22:37,400 INFO L93 Difference]: Finished difference Result 63 states and 84 transitions. [2019-12-07 11:22:37,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:22:37,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 84 transitions. [2019-12-07 11:22:37,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-12-07 11:22:37,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 42 states and 53 transitions. [2019-12-07 11:22:37,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-12-07 11:22:37,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-12-07 11:22:37,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 53 transitions. [2019-12-07 11:22:37,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:22:37,402 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 53 transitions. [2019-12-07 11:22:37,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 53 transitions. [2019-12-07 11:22:37,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2019-12-07 11:22:37,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 11:22:37,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2019-12-07 11:22:37,403 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2019-12-07 11:22:37,403 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2019-12-07 11:22:37,403 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-12-07 11:22:37,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2019-12-07 11:22:37,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-12-07 11:22:37,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:22:37,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:22:37,404 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-12-07 11:22:37,404 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2019-12-07 11:22:37,404 INFO L794 eck$LassoCheckResult]: Stem: 2811#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2805#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; 2806#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2813#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; 2807#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; 2803#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2804#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; 2808#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2825#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; 2823#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2822#L535-3 assume !(main_~i~1 < main_~array_size~0); 2812#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; 2800#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); 2798#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2799#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); 2801#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2824#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); 2821#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2820#L517-3 assume !(lis_~i~0 < lis_~N); 2802#L517-4 lis_~i~0 := 1; 2796#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2797#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; 2832#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; 2814#L521-2 assume lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem10;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); 2815#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2826#L520-3 assume !(lis_~j~0 < lis_~i~0); 2818#L519-2 [2019-12-07 11:22:37,404 INFO L796 eck$LassoCheckResult]: Loop: 2818#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2819#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2829#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; 2828#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; 2827#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem10; 2816#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2817#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; 2809#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; 2810#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem10; 2830#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2831#L520-3 assume !(lis_~j~0 < lis_~i~0); 2818#L519-2 [2019-12-07 11:22:37,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:37,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1035299872, now seen corresponding path program 2 times [2019-12-07 11:22:37,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:37,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820393934] [2019-12-07 11:22:37,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:37,445 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:37,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:37,445 INFO L82 PathProgramCache]: Analyzing trace with hash -943445823, now seen corresponding path program 6 times [2019-12-07 11:22:37,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:37,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990675156] [2019-12-07 11:22:37,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:22:37,455 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:22:37,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:37,455 INFO L82 PathProgramCache]: Analyzing trace with hash 926303042, now seen corresponding path program 2 times [2019-12-07 11:22:37,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:37,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596056662] [2019-12-07 11:22:37,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:22:38,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596056662] [2019-12-07 11:22:38,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505435195] [2019-12-07 11:22:38,891 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:22:38,941 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 11:22:38,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:22:38,942 INFO L264 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-07 11:22:38,944 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:22:38,985 INFO L377 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-12-07 11:22:38,985 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:22:38,989 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:22:38,989 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:22:38,989 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 11:22:39,044 INFO L377 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-12-07 11:22:39,044 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:22:39,052 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:22:39,053 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:22:39,053 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2019-12-07 11:22:39,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:22:39,127 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 11:22:39,127 INFO L377 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-12-07 11:22:39,127 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:22:39,135 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:22:39,135 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:22:39,135 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:44 [2019-12-07 11:22:39,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:22:39,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:22:39,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:22:39,289 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:22:39,353 INFO L343 Elim1Store]: treesize reduction 12, result has 92.9 percent of original size [2019-12-07 11:22:39,353 INFO L377 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-12-07 11:22:39,354 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:22:39,400 INFO L614 ElimStorePlain]: treesize reduction 131, result has 45.6 percent of original size [2019-12-07 11:22:39,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:22:39,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:22:39,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:22:39,402 INFO L534 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-12-07 11:22:39,403 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:125, output treesize:123 [2019-12-07 11:22:39,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:22:39,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:22:39,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:22:39,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:22:39,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:22:39,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:22:39,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:22:39,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:22:39,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:22:39,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:22:39,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:22:39,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:22:39,915 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-12-07 11:22:40,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:22:40,251 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:22:40,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:22:40,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 16] total 43 [2019-12-07 11:22:40,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653235494] [2019-12-07 11:22:40,412 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 91 [2019-12-07 11:22:40,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:22:40,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-07 11:22:40,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1656, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 11:22:40,442 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. cyclomatic complexity: 12 Second operand 43 states. [2019-12-07 11:22:41,844 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-12-07 11:22:43,482 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-12-07 11:22:46,562 WARN L192 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 106 DAG size of output: 86 [2019-12-07 11:22:47,429 WARN L192 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 87 [2019-12-07 11:22:48,604 WARN L192 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 87 [2019-12-07 11:22:49,458 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 88 [2019-12-07 11:22:50,164 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-12-07 11:22:50,442 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-12-07 11:22:51,367 WARN L192 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 76 [2019-12-07 11:22:51,734 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 77 [2019-12-07 11:22:58,587 WARN L192 SmtUtils]: Spent 6.55 s on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-12-07 11:22:59,378 WARN L192 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-12-07 11:23:00,432 WARN L192 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-12-07 11:23:00,665 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-12-07 11:23:00,886 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-12-07 11:23:01,164 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-12-07 11:23:01,688 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-12-07 11:23:02,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:02,885 INFO L93 Difference]: Finished difference Result 297 states and 406 transitions. [2019-12-07 11:23:02,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-12-07 11:23:02,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 297 states and 406 transitions. [2019-12-07 11:23:02,887 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 149 [2019-12-07 11:23:02,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 297 states to 297 states and 406 transitions. [2019-12-07 11:23:02,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 272 [2019-12-07 11:23:02,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 272 [2019-12-07 11:23:02,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 297 states and 406 transitions. [2019-12-07 11:23:02,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:23:02,890 INFO L688 BuchiCegarLoop]: Abstraction has 297 states and 406 transitions. [2019-12-07 11:23:02,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states and 406 transitions. [2019-12-07 11:23:02,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 142. [2019-12-07 11:23:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-12-07 11:23:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 191 transitions. [2019-12-07 11:23:02,895 INFO L711 BuchiCegarLoop]: Abstraction has 142 states and 191 transitions. [2019-12-07 11:23:02,895 INFO L591 BuchiCegarLoop]: Abstraction has 142 states and 191 transitions. [2019-12-07 11:23:02,895 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-12-07 11:23:02,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 191 transitions. [2019-12-07 11:23:02,895 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 60 [2019-12-07 11:23:02,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:23:02,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:23:02,896 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-12-07 11:23:02,896 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2019-12-07 11:23:02,896 INFO L794 eck$LassoCheckResult]: Stem: 3491#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3484#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; 3485#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 3494#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; 3486#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; 3487#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 3488#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; 3482#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 3483#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; 3504#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 3505#L535-3 assume !(main_~i~1 < main_~array_size~0); 3492#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; 3493#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); 3474#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3475#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); 3509#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3510#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); 3562#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3561#L517-3 assume !(lis_~i~0 < lis_~N); 3560#L517-4 lis_~i~0 := 1; 3559#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3558#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; 3557#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; 3554#L521-2 assume lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem10;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); 3553#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3552#L520-3 assume !(lis_~j~0 < lis_~i~0); 3551#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3550#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3549#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; 3548#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; 3495#L521-2 assume lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem10;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); 3496#L520-2 [2019-12-07 11:23:02,896 INFO L796 eck$LassoCheckResult]: Loop: 3496#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3497#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; 3517#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; 3515#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem10; 3513#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3514#L520-3 assume !(lis_~j~0 < lis_~i~0); 3500#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3472#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3473#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; 3489#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; 3490#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem10; 3496#L520-2 [2019-12-07 11:23:02,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:02,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1856448556, now seen corresponding path program 1 times [2019-12-07 11:23:02,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:02,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879265512] [2019-12-07 11:23:02,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:23:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:23:02,935 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:23:02,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:02,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1668400361, now seen corresponding path program 7 times [2019-12-07 11:23:02,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:02,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882555075] [2019-12-07 11:23:02,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:23:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:23:02,944 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:23:02,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:02,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1805133002, now seen corresponding path program 3 times [2019-12-07 11:23:02,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:02,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755025642] [2019-12-07 11:23:02,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:03,025 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 22 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 11:23:03,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755025642] [2019-12-07 11:23:03,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085015612] [2019-12-07 11:23:03,026 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb9b9dfc-3535-49ff-9ecd-62d61bc0e529/bin/uautomizer/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:23:03,078 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 11:23:03,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:23:03,079 INFO L264 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 11:23:03,080 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:23:03,172 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 11:23:03,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:23:03,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2019-12-07 11:23:03,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512633161] [2019-12-07 11:23:03,356 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 103 [2019-12-07 11:23:03,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:03,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 11:23:03,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-12-07 11:23:03,394 INFO L87 Difference]: Start difference. First operand 142 states and 191 transitions. cyclomatic complexity: 58 Second operand 21 states. [2019-12-07 11:23:04,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:04,120 INFO L93 Difference]: Finished difference Result 170 states and 218 transitions. [2019-12-07 11:23:04,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 11:23:04,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 170 states and 218 transitions. [2019-12-07 11:23:04,122 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 45 [2019-12-07 11:23:04,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 170 states to 162 states and 208 transitions. [2019-12-07 11:23:04,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2019-12-07 11:23:04,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 144 [2019-12-07 11:23:04,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 208 transitions. [2019-12-07 11:23:04,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:23:04,124 INFO L688 BuchiCegarLoop]: Abstraction has 162 states and 208 transitions. [2019-12-07 11:23:04,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 208 transitions. [2019-12-07 11:23:04,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 112. [2019-12-07 11:23:04,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-07 11:23:04,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 143 transitions. [2019-12-07 11:23:04,128 INFO L711 BuchiCegarLoop]: Abstraction has 112 states and 143 transitions. [2019-12-07 11:23:04,128 INFO L591 BuchiCegarLoop]: Abstraction has 112 states and 143 transitions. [2019-12-07 11:23:04,128 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2019-12-07 11:23:04,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 143 transitions. [2019-12-07 11:23:04,128 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 26 [2019-12-07 11:23:04,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:23:04,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:23:04,129 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-12-07 11:23:04,129 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 11:23:04,129 INFO L794 eck$LassoCheckResult]: Stem: 4006#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 4000#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; 4001#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 4009#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; 4002#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; 3998#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 3999#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; 4003#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 4017#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; 4018#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 4026#L535-3 assume !(main_~i~1 < main_~array_size~0); 4007#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; 4008#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); 3989#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3990#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); 4025#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4024#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); 4023#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4019#L517-3 assume !(lis_~i~0 < lis_~N); 3996#L517-4 lis_~i~0 := 1; 3997#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4078#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; 4079#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; 4032#L521-2 assume lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem10;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); 4030#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4029#L520-3 assume !(lis_~j~0 < lis_~i~0); 4012#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 4013#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4083#L520-3 [2019-12-07 11:23:04,130 INFO L796 eck$LassoCheckResult]: Loop: 4083#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; 4084#L521 assume !lis_#t~short11; 4091#L521-2 assume !lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem10; 4085#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4083#L520-3 [2019-12-07 11:23:04,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:04,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1509233465, now seen corresponding path program 2 times [2019-12-07 11:23:04,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:04,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016577449] [2019-12-07 11:23:04,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:23:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:23:04,158 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:23:04,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:04,159 INFO L82 PathProgramCache]: Analyzing trace with hash 2560232, now seen corresponding path program 3 times [2019-12-07 11:23:04,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:04,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609526476] [2019-12-07 11:23:04,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:23:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:23:04,162 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:23:04,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:04,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1715328338, now seen corresponding path program 1 times [2019-12-07 11:23:04,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:04,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774362696] [2019-12-07 11:23:04,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:23:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:23:04,190 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:23:08,391 WARN L192 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 316 DAG size of output: 210 [2019-12-07 11:23:09,611 WARN L192 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 137 [2019-12-07 11:23:09,614 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 11:23:09,614 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 11:23:09,614 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 11:23:09,614 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 11:23:09,614 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 11:23:09,614 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:23:09,614 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 11:23:09,614 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 11:23:09,614 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration17_Lasso [2019-12-07 11:23:09,614 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 11:23:09,614 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 11:23:09,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:23:09,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:23:10,327 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:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) 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-12-07 11:23:10,329 INFO L168 Benchmark]: Toolchain (without parser) took 49867.37 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 347.1 MB). Free memory was 938.1 MB in the beginning and 976.1 MB in the end (delta: -38.1 MB). Peak memory consumption was 309.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:23:10,329 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:23:10,329 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.4 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -130.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:23:10,329 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:23:10,330 INFO L168 Benchmark]: Boogie Preprocessor took 20.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:23:10,330 INFO L168 Benchmark]: RCFGBuilder took 233.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:23:10,330 INFO L168 Benchmark]: BuchiAutomizer took 49279.91 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 262.7 MB). Free memory was 1.0 GB in the beginning and 976.1 MB in the end (delta: 59.1 MB). Peak memory consumption was 321.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:23:10,331 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 299.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.4 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -130.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 233.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 49279.91 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 262.7 MB). Free memory was 1.0 GB in the beginning and 976.1 MB in the end (delta: 59.1 MB). Peak memory consumption was 321.8 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 - 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...