./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 64bit --witnessprinter.graph.data.programhash 70142fc261543b4951115471830b502e8a88ca6e ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 00:46:17,749 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:46:17,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:46:17,812 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:46:17,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:46:17,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:46:17,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:46:17,828 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:46:17,830 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:46:17,832 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:46:17,833 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:46:17,835 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:46:17,835 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:46:17,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:46:17,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:46:17,840 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:46:17,841 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:46:17,843 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:46:17,845 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:46:17,848 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:46:17,851 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:46:17,853 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:46:17,855 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:46:17,856 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:46:17,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:46:17,861 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:46:17,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:46:17,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:46:17,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:46:17,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:46:17,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:46:17,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:46:17,867 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:46:17,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:46:17,870 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:46:17,870 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:46:17,871 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:46:17,871 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:46:17,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:46:17,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:46:17,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:46:17,875 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-11-30 00:46:17,901 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:46:17,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:46:17,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:46:17,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:46:17,904 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:46:17,904 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-30 00:46:17,904 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-30 00:46:17,905 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-30 00:46:17,905 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-30 00:46:17,905 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-30 00:46:17,905 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-30 00:46:17,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:46:17,906 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 00:46:17,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:46:17,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:46:17,907 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-30 00:46:17,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-30 00:46:17,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-30 00:46:17,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:46:17,908 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-30 00:46:17,908 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:46:17,908 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-30 00:46:17,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:46:17,909 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:46:17,909 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-30 00:46:17,909 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:46:17,910 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:46:17,910 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:46:17,910 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-30 00:46:17,911 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-30 00:46:17,912 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_366417aa-0c70-4211-b98a-026ac0c973ff/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 70142fc261543b4951115471830b502e8a88ca6e [2020-11-30 00:46:18,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:46:18,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:46:18,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:46:18,183 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:46:18,184 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:46:18,185 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i [2020-11-30 00:46:18,281 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/data/9ed065892/eb37a51a4cb348ea9e9336e1051285aa/FLAG110d06f5a [2020-11-30 00:46:18,846 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:46:18,846 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i [2020-11-30 00:46:18,860 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/data/9ed065892/eb37a51a4cb348ea9e9336e1051285aa/FLAG110d06f5a [2020-11-30 00:46:19,181 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/data/9ed065892/eb37a51a4cb348ea9e9336e1051285aa [2020-11-30 00:46:19,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:46:19,188 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:46:19,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:46:19,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:46:19,198 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:46:19,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:46:19" (1/1) ... [2020-11-30 00:46:19,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a3375bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:19, skipping insertion in model container [2020-11-30 00:46:19,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:46:19" (1/1) ... [2020-11-30 00:46:19,214 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:46:19,282 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:46:19,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:46:19,659 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:46:19,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:46:19,761 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:46:19,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:19 WrapperNode [2020-11-30 00:46:19,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:46:19,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:46:19,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:46:19,763 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:46:19,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:19" (1/1) ... [2020-11-30 00:46:19,787 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:19" (1/1) ... [2020-11-30 00:46:19,813 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:46:19,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:46:19,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:46:19,814 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:46:19,823 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:19" (1/1) ... [2020-11-30 00:46:19,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:19" (1/1) ... [2020-11-30 00:46:19,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:19" (1/1) ... [2020-11-30 00:46:19,828 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:19" (1/1) ... [2020-11-30 00:46:19,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:19" (1/1) ... [2020-11-30 00:46:19,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:19" (1/1) ... [2020-11-30 00:46:19,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:19" (1/1) ... [2020-11-30 00:46:19,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:46:19,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:46:19,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:46:19,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:46:19,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:19,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-30 00:46:19,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 00:46:19,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:46:19,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 00:46:19,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:46:19,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:46:20,360 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:46:20,361 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-11-30 00:46:20,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:46:20 BoogieIcfgContainer [2020-11-30 00:46:20,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:46:20,364 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-30 00:46:20,364 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-30 00:46:20,366 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-30 00:46:20,367 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:46:20,367 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 30.11 12:46:19" (1/3) ... [2020-11-30 00:46:20,368 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d89e683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 12:46:20, skipping insertion in model container [2020-11-30 00:46:20,368 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:46:20,369 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:19" (2/3) ... [2020-11-30 00:46:20,369 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d89e683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 12:46:20, skipping insertion in model container [2020-11-30 00:46:20,369 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:46:20,369 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:46:20" (3/3) ... [2020-11-30 00:46:20,370 INFO L373 chiAutomizerObserver]: Analyzing ICFG lis-alloca-2.i [2020-11-30 00:46:20,422 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-30 00:46:20,422 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-30 00:46:20,422 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-30 00:46:20,422 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:46:20,422 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:46:20,423 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-30 00:46:20,423 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:46:20,423 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-30 00:46:20,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2020-11-30 00:46:20,453 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-11-30 00:46:20,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:46:20,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:46:20,461 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-11-30 00:46:20,461 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-30 00:46:20,461 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-30 00:46:20,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2020-11-30 00:46:20,464 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-11-30 00:46:20,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:46:20,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:46:20,464 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-11-30 00:46:20,464 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-30 00:46:20,471 INFO L794 eck$LassoCheckResult]: Stem: 13#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~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 8#L565true assume !(main_~array_size~0 < 1); 14#L565-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;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; 23#L552-3true [2020-11-30 00:46:20,472 INFO L796 eck$LassoCheckResult]: Loop: 23#L552-3true assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 20#L552-2true lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 23#L552-3true [2020-11-30 00:46:20,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:20,478 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-11-30 00:46:20,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:20,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260308625] [2020-11-30 00:46:20,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:20,594 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:20,626 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:20,647 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:46:20,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:20,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2020-11-30 00:46:20,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:20,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891264526] [2020-11-30 00:46:20,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:20,663 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:20,673 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:20,677 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:46:20,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:20,679 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2020-11-30 00:46:20,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:20,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777387747] [2020-11-30 00:46:20,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:20,722 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:20,766 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:20,775 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:46:20,922 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-11-30 00:46:21,346 WARN L193 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2020-11-30 00:46:21,541 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-11-30 00:46:21,556 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:46:21,563 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:46:21,571 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:46:21,572 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:46:21,572 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:46:21,572 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:21,572 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:46:21,573 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:46:21,573 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration1_Lasso [2020-11-30 00:46:21,573 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:46:21,573 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:46:21,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:21,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:21,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:21,978 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2020-11-30 00:46:22,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:22,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:22,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:22,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:22,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:22,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:22,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:22,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:22,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:22,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:22,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:22,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:22,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:22,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:22,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:22,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:22,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:22,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:22,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:22,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:22,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:22,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:22,880 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:46:22,884 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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) [2020-11-30 00:46:22,902 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 [2020-11-30 00:46:22,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:22,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:46:22,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:22,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:22,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:22,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:46:22,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:22,912 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:22,948 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 [2020-11-30 00:46:22,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:22,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:22,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:22,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:22,955 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:22,955 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:46:22,958 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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) [2020-11-30 00:46:22,999 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 [2020-11-30 00:46:23,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:23,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:23,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:23,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:23,007 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:23,007 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:46:23,013 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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) [2020-11-30 00:46:23,050 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 [2020-11-30 00:46:23,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:23,052 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:46:23,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:23,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:23,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:23,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:46:23,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:23,059 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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) [2020-11-30 00:46:23,094 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 [2020-11-30 00:46:23,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:23,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:46:23,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:23,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:23,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:23,097 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:46:23,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:23,099 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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) [2020-11-30 00:46:23,141 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 [2020-11-30 00:46:23,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:23,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:23,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:23,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:23,148 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:23,149 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:23,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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) [2020-11-30 00:46:23,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:46:23,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:23,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:23,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:23,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:23,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:23,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:23,208 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:23,236 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 [2020-11-30 00:46:23,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:23,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:23,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:23,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:23,243 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:23,243 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:46:23,255 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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) [2020-11-30 00:46:23,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 [2020-11-30 00:46:23,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:23,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:23,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:23,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:23,309 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:23,309 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:46:23,323 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:23,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 [2020-11-30 00:46:23,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:23,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:23,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:23,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:23,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:23,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:46:23,409 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:46:23,663 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2020-11-30 00:46:23,663 INFO L444 ModelExtractionUtils]: 26 out of 43 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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) [2020-11-30 00:46:23,671 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:23,675 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-11-30 00:46:23,675 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:46:23,676 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0, v_rep(select #length ULTIMATE.start_lis_~prev~0.base)_1) = -4*ULTIMATE.start_lis_~i~0 + 1*v_rep(select #length ULTIMATE.start_lis_~prev~0.base)_1 Supporting invariants [1*ULTIMATE.start_lis_~prev~0.offset >= 0] [2020-11-30 00:46:23,785 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2020-11-30 00:46:23,793 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-30 00:46:23,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:23,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:46:23,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:46:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:23,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 00:46:23,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:46:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:46:23,977 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 [2020-11-30 00:46:23,979 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 3 states. [2020-11-30 00:46:24,053 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 3 states. Result 41 states and 64 transitions. Complement of second has 8 states. [2020-11-30 00:46:24,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-30 00:46:24,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 00:46:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-11-30 00:46:24,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 2 letters. [2020-11-30 00:46:24,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:46:24,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 6 letters. Loop has 2 letters. [2020-11-30 00:46:24,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:46:24,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 4 letters. [2020-11-30 00:46:24,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:46:24,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 64 transitions. [2020-11-30 00:46:24,069 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-11-30 00:46:24,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 18 states and 28 transitions. [2020-11-30 00:46:24,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-11-30 00:46:24,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-11-30 00:46:24,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 28 transitions. [2020-11-30 00:46:24,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:46:24,078 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2020-11-30 00:46:24,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 28 transitions. [2020-11-30 00:46:24,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-11-30 00:46:24,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-11-30 00:46:24,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2020-11-30 00:46:24,105 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2020-11-30 00:46:24,105 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2020-11-30 00:46:24,105 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-30 00:46:24,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2020-11-30 00:46:24,108 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-11-30 00:46:24,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:46:24,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:46:24,109 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-11-30 00:46:24,109 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:46:24,110 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 192#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 189#L565 assume !(main_~array_size~0 < 1); 190#L565-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;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; 195#L552-3 assume !(lis_~i~0 < lis_~N); 182#L552-4 lis_~i~0 := 1; 183#L554-3 [2020-11-30 00:46:24,111 INFO L796 eck$LassoCheckResult]: Loop: 183#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 193#L555-3 assume !(lis_~j~0 < lis_~i~0); 196#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 183#L554-3 [2020-11-30 00:46:24,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:24,112 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2020-11-30 00:46:24,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:24,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992976344] [2020-11-30 00:46:24,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:24,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:46:24,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992976344] [2020-11-30 00:46:24,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:46:24,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:46:24,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121593353] [2020-11-30 00:46:24,221 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:46:24,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:24,221 INFO L82 PathProgramCache]: Analyzing trace with hash 60785, now seen corresponding path program 1 times [2020-11-30 00:46:24,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:24,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937721877] [2020-11-30 00:46:24,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:24,226 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:24,229 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:24,231 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:46:24,249 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:46:24,249 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:46:24,249 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:46:24,249 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:46:24,249 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-11-30 00:46:24,250 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:24,250 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:46:24,250 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:46:24,250 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration2_Loop [2020-11-30 00:46:24,250 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:46:24,250 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:46:24,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:24,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:24,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:24,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:24,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:24,372 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:46:24,373 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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) [2020-11-30 00:46:24,381 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:46:24,382 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:24,388 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:46:24,388 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_2=1} Honda state: {v_rep~unnamed0~0~P_PID_2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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) [2020-11-30 00:46:24,437 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:46:24,437 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:24,441 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:46:24,442 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_2=2} Honda state: {v_rep~unnamed0~0~P_PGID_2=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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) [2020-11-30 00:46:24,488 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:46:24,489 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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) [2020-11-30 00:46:24,544 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-11-30 00:46:24,545 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:24,735 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-11-30 00:46:24,738 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:46:24,739 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:46:24,739 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:46:24,739 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:46:24,739 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:46:24,739 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:24,739 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:46:24,739 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:46:24,739 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration2_Loop [2020-11-30 00:46:24,739 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:46:24,739 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:46:24,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:24,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:24,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:24,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:24,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:24,850 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:46:24,850 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:24,854 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 [2020-11-30 00:46:24,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:24,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:24,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:24,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:24,859 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:24,859 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:46:24,864 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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) [2020-11-30 00:46:24,913 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 [2020-11-30 00:46:24,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:24,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:24,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:24,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:24,919 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:24,919 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:24,929 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:24,961 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 [2020-11-30 00:46:24,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:24,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:46:24,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:24,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:24,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:24,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:46:24,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:46:24,967 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:46:24,979 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-11-30 00:46:24,979 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:25,007 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-30 00:46:25,008 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-30 00:46:25,008 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:46:25,008 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~i~0) = 1*ULTIMATE.start_lis_~N - 1*ULTIMATE.start_lis_~i~0 Supporting invariants [] [2020-11-30 00:46:25,031 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-11-30 00:46:25,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:25,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:46:25,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:46:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:25,094 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:46:25,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:46:25,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:46:25,111 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 [2020-11-30 00:46:25,111 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-11-30 00:46:25,161 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 36 states and 61 transitions. Complement of second has 8 states. [2020-11-30 00:46:25,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-30 00:46:25,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 00:46:25,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2020-11-30 00:46:25,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 6 letters. Loop has 3 letters. [2020-11-30 00:46:25,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:46:25,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 9 letters. Loop has 3 letters. [2020-11-30 00:46:25,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:46:25,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 6 letters. Loop has 6 letters. [2020-11-30 00:46:25,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:46:25,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 61 transitions. [2020-11-30 00:46:25,168 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-30 00:46:25,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 24 states and 37 transitions. [2020-11-30 00:46:25,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-11-30 00:46:25,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-11-30 00:46:25,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 37 transitions. [2020-11-30 00:46:25,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:46:25,170 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 37 transitions. [2020-11-30 00:46:25,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 37 transitions. [2020-11-30 00:46:25,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-11-30 00:46:25,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-11-30 00:46:25,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 36 transitions. [2020-11-30 00:46:25,180 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 36 transitions. [2020-11-30 00:46:25,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:46:25,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:46:25,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:46:25,186 INFO L87 Difference]: Start difference. First operand 23 states and 36 transitions. Second operand 4 states. [2020-11-30 00:46:25,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:46:25,263 INFO L93 Difference]: Finished difference Result 24 states and 36 transitions. [2020-11-30 00:46:25,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:46:25,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 36 transitions. [2020-11-30 00:46:25,268 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-30 00:46:25,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 36 transitions. [2020-11-30 00:46:25,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-11-30 00:46:25,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-11-30 00:46:25,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 36 transitions. [2020-11-30 00:46:25,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:46:25,269 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2020-11-30 00:46:25,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 36 transitions. [2020-11-30 00:46:25,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-11-30 00:46:25,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-11-30 00:46:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2020-11-30 00:46:25,272 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2020-11-30 00:46:25,272 INFO L594 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2020-11-30 00:46:25,272 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-30 00:46:25,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2020-11-30 00:46:25,273 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-30 00:46:25,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:46:25,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:46:25,274 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:46:25,274 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-30 00:46:25,274 INFO L794 eck$LassoCheckResult]: Stem: 353#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 350#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 346#L565 assume !(main_~array_size~0 < 1); 347#L565-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;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; 354#L552-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); 358#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 359#L552-3 assume !(lis_~i~0 < lis_~N); 337#L552-4 lis_~i~0 := 1; 338#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 351#L555-3 [2020-11-30 00:46:25,274 INFO L796 eck$LassoCheckResult]: Loop: 351#L555-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; 339#L556 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; 340#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 348#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 351#L555-3 [2020-11-30 00:46:25,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:25,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2020-11-30 00:46:25,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:25,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554119512] [2020-11-30 00:46:25,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:46:25,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554119512] [2020-11-30 00:46:25,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685512315] [2020-11-30 00:46:25,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:46:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:25,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 00:46:25,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:46:25,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:46:25,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:46:25,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-11-30 00:46:25,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248366169] [2020-11-30 00:46:25,514 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:46:25,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:25,514 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 1 times [2020-11-30 00:46:25,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:25,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608040003] [2020-11-30 00:46:25,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:25,539 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:25,566 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:25,574 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:46:25,855 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2020-11-30 00:46:25,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:46:25,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 00:46:25,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:46:25,927 INFO L87 Difference]: Start difference. First operand 23 states and 35 transitions. cyclomatic complexity: 16 Second operand 8 states. [2020-11-30 00:46:26,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:46:26,100 INFO L93 Difference]: Finished difference Result 49 states and 69 transitions. [2020-11-30 00:46:26,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:46:26,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 69 transitions. [2020-11-30 00:46:26,103 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-11-30 00:46:26,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 41 states and 59 transitions. [2020-11-30 00:46:26,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-11-30 00:46:26,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-11-30 00:46:26,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 59 transitions. [2020-11-30 00:46:26,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:46:26,105 INFO L691 BuchiCegarLoop]: Abstraction has 41 states and 59 transitions. [2020-11-30 00:46:26,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 59 transitions. [2020-11-30 00:46:26,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 25. [2020-11-30 00:46:26,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-11-30 00:46:26,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2020-11-30 00:46:26,109 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2020-11-30 00:46:26,109 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2020-11-30 00:46:26,109 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-30 00:46:26,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 36 transitions. [2020-11-30 00:46:26,110 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-30 00:46:26,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:46:26,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:46:26,111 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:46:26,111 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-30 00:46:26,111 INFO L794 eck$LassoCheckResult]: Stem: 464#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 461#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 457#L565 assume !(main_~array_size~0 < 1); 458#L565-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;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; 465#L552-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); 471#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 472#L552-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); 469#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 470#L552-3 assume !(lis_~i~0 < lis_~N); 448#L552-4 lis_~i~0 := 1; 449#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 462#L555-3 [2020-11-30 00:46:26,111 INFO L796 eck$LassoCheckResult]: Loop: 462#L555-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; 450#L556 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; 451#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 459#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 462#L555-3 [2020-11-30 00:46:26,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:26,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 2 times [2020-11-30 00:46:26,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:26,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117616237] [2020-11-30 00:46:26,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:26,133 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:26,171 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:26,177 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:46:26,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:26,178 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 2 times [2020-11-30 00:46:26,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:26,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706024528] [2020-11-30 00:46:26,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:26,190 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:26,216 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:26,219 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:46:26,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:26,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1166707861, now seen corresponding path program 1 times [2020-11-30 00:46:26,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:26,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616320616] [2020-11-30 00:46:26,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:26,257 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:26,317 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:26,326 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:46:26,577 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2020-11-30 00:46:27,292 WARN L193 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 117 [2020-11-30 00:46:27,595 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-11-30 00:46:27,603 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:46:27,603 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:46:27,603 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:46:27,604 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:46:27,604 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:46:27,604 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:27,604 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:46:27,604 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:46:27,604 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration4_Lasso [2020-11-30 00:46:27,604 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:46:27,604 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:46:27,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:27,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:27,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:27,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:27,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:27,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:27,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:27,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:27,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:27,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:27,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:27,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:27,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:27,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:27,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:27,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:27,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:27,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:27,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:27,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:27,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:27,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:27,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:27,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:28,527 WARN L193 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 97 [2020-11-30 00:46:28,864 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 89 [2020-11-30 00:46:29,171 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2020-11-30 00:46:29,769 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:46:29,769 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:29,792 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 [2020-11-30 00:46:29,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:29,794 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:46:29,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:29,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:29,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:29,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:46:29,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:46:29,797 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:29,820 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 [2020-11-30 00:46:29,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:29,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:46:29,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:29,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:29,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:29,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:46:29,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:46:29,832 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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) [2020-11-30 00:46:29,854 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 Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:29,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:29,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:29,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:29,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:29,857 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:29,857 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:46:29,859 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:29,881 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 [2020-11-30 00:46:29,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:29,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:46:29,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:29,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:29,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:29,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:46:29,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:46:29,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:29,905 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 [2020-11-30 00:46:29,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:29,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:46:29,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:29,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:29,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:29,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:46:29,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:46:29,909 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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) [2020-11-30 00:46:29,947 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 [2020-11-30 00:46:29,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:29,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:29,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:29,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:29,951 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:29,951 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:29,961 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:29,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:46:29,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:29,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:46:29,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:29,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:29,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:29,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:46:29,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:46:30,000 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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) [2020-11-30 00:46:30,044 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 [2020-11-30 00:46:30,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:30,045 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:46:30,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:30,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:30,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:30,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:46:30,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:30,048 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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) [2020-11-30 00:46:30,087 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 [2020-11-30 00:46:30,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:30,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:30,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:30,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:30,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:30,091 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:30,095 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:30,134 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 [2020-11-30 00:46:30,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:30,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:46:30,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:30,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:30,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:30,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:46:30,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:46:30,137 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:30,160 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 [2020-11-30 00:46:30,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:30,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:30,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:30,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:30,163 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:30,163 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:46:30,165 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:30,187 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 [2020-11-30 00:46:30,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:30,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:46:30,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:30,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:30,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:30,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:46:30,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:46:30,191 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:30,214 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 [2020-11-30 00:46:30,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:30,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:30,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:30,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:30,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:30,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:46:30,226 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:30,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 [2020-11-30 00:46:30,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:30,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:46:30,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:30,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:30,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:30,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:46:30,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:46:30,258 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:30,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 [2020-11-30 00:46:30,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:30,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:46:30,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:30,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:30,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:30,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:46:30,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:46:30,284 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:30,307 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 [2020-11-30 00:46:30,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:30,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:46:30,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:30,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:30,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:30,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:46:30,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:46:30,316 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:30,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 [2020-11-30 00:46:30,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:30,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:46:30,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:30,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:30,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:30,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:46:30,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:46:30,346 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:30,369 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 [2020-11-30 00:46:30,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:30,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:46:30,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:30,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:30,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:30,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:46:30,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:46:30,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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) [2020-11-30 00:46:30,400 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 [2020-11-30 00:46:30,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:30,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:30,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:30,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:30,405 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:30,405 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:46:30,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:30,441 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 [2020-11-30 00:46:30,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:30,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:46:30,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:30,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:30,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:30,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:46:30,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:46:30,444 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:30,469 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 [2020-11-30 00:46:30,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:30,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:46:30,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:30,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:30,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:30,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:46:30,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:46:30,473 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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) [2020-11-30 00:46:30,509 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 [2020-11-30 00:46:30,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:30,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:46:30,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:30,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:30,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:30,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:46:30,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:30,515 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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) [2020-11-30 00:46:30,555 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 [2020-11-30 00:46:30,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:30,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:30,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:30,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:30,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:30,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:30,564 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:30,597 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 [2020-11-30 00:46:30,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:30,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:30,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:30,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:30,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:30,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:46:30,608 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:30,631 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 [2020-11-30 00:46:30,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:30,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:30,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:30,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:30,637 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:30,637 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:46:30,647 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:30,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 [2020-11-30 00:46:30,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:30,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:30,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:30,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:30,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:30,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:46:30,676 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:30,698 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 [2020-11-30 00:46:30,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:30,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:46:30,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:30,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:30,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:30,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:46:30,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:46:30,702 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:30,725 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 [2020-11-30 00:46:30,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:30,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:30,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:30,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:30,739 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:30,739 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:46:30,747 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:30,769 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 [2020-11-30 00:46:30,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:30,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:30,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:30,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:30,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:30,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:46:30,829 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:46:30,928 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2020-11-30 00:46:30,928 INFO L444 ModelExtractionUtils]: 18 out of 58 variables were initially zero. Simplification set additionally 37 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:30,935 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-30 00:46:30,937 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-30 00:46:30,938 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:46:30,938 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0, v_rep(select #length ULTIMATE.start_lis_~prev~0.base)_2) = -16*ULTIMATE.start_lis_~j~0 + 1*v_rep(select #length ULTIMATE.start_lis_~prev~0.base)_2 Supporting invariants [] [2020-11-30 00:46:31,264 INFO L297 tatePredicateManager]: 41 out of 43 supporting invariants were superfluous and have been removed [2020-11-30 00:46:31,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-30 00:46:31,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:31,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 00:46:31,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:46:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:31,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-30 00:46:31,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:46:31,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:46:31,494 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 4 loop predicates [2020-11-30 00:46:31,494 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 15 Second operand 7 states. [2020-11-30 00:46:31,617 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 15. Second operand 7 states. Result 59 states and 87 transitions. Complement of second has 13 states. [2020-11-30 00:46:31,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 4 non-accepting loop states 1 accepting loop states [2020-11-30 00:46:31,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-11-30 00:46:31,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2020-11-30 00:46:31,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 23 transitions. Stem has 11 letters. Loop has 4 letters. [2020-11-30 00:46:31,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:46:31,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 23 transitions. Stem has 15 letters. Loop has 4 letters. [2020-11-30 00:46:31,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:46:31,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 23 transitions. Stem has 11 letters. Loop has 8 letters. [2020-11-30 00:46:31,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:46:31,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 87 transitions. [2020-11-30 00:46:31,621 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-11-30 00:46:31,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 56 states and 81 transitions. [2020-11-30 00:46:31,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-11-30 00:46:31,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-11-30 00:46:31,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 81 transitions. [2020-11-30 00:46:31,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:46:31,622 INFO L691 BuchiCegarLoop]: Abstraction has 56 states and 81 transitions. [2020-11-30 00:46:31,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 81 transitions. [2020-11-30 00:46:31,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 46. [2020-11-30 00:46:31,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-11-30 00:46:31,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2020-11-30 00:46:31,626 INFO L714 BuchiCegarLoop]: Abstraction has 46 states and 68 transitions. [2020-11-30 00:46:31,626 INFO L594 BuchiCegarLoop]: Abstraction has 46 states and 68 transitions. [2020-11-30 00:46:31,626 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-30 00:46:31,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 68 transitions. [2020-11-30 00:46:31,626 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-11-30 00:46:31,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:46:31,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:46:31,628 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:46:31,628 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-30 00:46:31,628 INFO L794 eck$LassoCheckResult]: Stem: 809#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 805#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 801#L565 assume !(main_~array_size~0 < 1); 802#L565-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;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; 810#L552-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); 819#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 820#L552-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); 821#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 822#L552-3 assume !(lis_~i~0 < lis_~N); 792#L552-4 lis_~i~0 := 1; 793#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 815#L555-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; 794#L556 [2020-11-30 00:46:31,628 INFO L796 eck$LassoCheckResult]: Loop: 794#L556 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; 795#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 803#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 806#L555-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; 794#L556 [2020-11-30 00:46:31,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:31,629 INFO L82 PathProgramCache]: Analyzing trace with hash -304736135, now seen corresponding path program 1 times [2020-11-30 00:46:31,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:31,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743326238] [2020-11-30 00:46:31,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:31,650 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:31,669 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:31,674 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:46:31,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:31,675 INFO L82 PathProgramCache]: Analyzing trace with hash 2224444, now seen corresponding path program 1 times [2020-11-30 00:46:31,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:31,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596095761] [2020-11-30 00:46:31,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:31,683 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:31,688 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:31,691 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:46:31,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:31,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1808207284, now seen corresponding path program 1 times [2020-11-30 00:46:31,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:31,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426532376] [2020-11-30 00:46:31,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:31,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 00:46:31,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426532376] [2020-11-30 00:46:31,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124164598] [2020-11-30 00:46:31,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:46:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:31,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:46:31,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:46:31,889 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 00:46:31,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:46:31,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2020-11-30 00:46:31,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565980632] [2020-11-30 00:46:32,025 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2020-11-30 00:46:32,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:46:32,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:46:32,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:46:32,071 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. cyclomatic complexity: 30 Second operand 5 states. [2020-11-30 00:46:32,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:46:32,136 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2020-11-30 00:46:32,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:46:32,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 69 transitions. [2020-11-30 00:46:32,138 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-30 00:46:32,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 39 states and 54 transitions. [2020-11-30 00:46:32,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-11-30 00:46:32,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-11-30 00:46:32,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 54 transitions. [2020-11-30 00:46:32,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:46:32,140 INFO L691 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-11-30 00:46:32,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 54 transitions. [2020-11-30 00:46:32,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2020-11-30 00:46:32,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-30 00:46:32,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2020-11-30 00:46:32,144 INFO L714 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2020-11-30 00:46:32,144 INFO L594 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2020-11-30 00:46:32,144 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-30 00:46:32,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 46 transitions. [2020-11-30 00:46:32,146 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-30 00:46:32,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:46:32,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:46:32,147 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:46:32,147 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-30 00:46:32,147 INFO L794 eck$LassoCheckResult]: Stem: 965#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 962#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 957#L565 assume !(main_~array_size~0 < 1); 958#L565-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;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; 966#L552-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); 972#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 973#L552-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); 974#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 975#L552-3 assume !(lis_~i~0 < lis_~N); 948#L552-4 lis_~i~0 := 1; 949#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 969#L555-3 assume !(lis_~j~0 < lis_~i~0); 967#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 968#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 963#L555-3 [2020-11-30 00:46:32,147 INFO L796 eck$LassoCheckResult]: Loop: 963#L555-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; 950#L556 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; 951#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 959#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 963#L555-3 [2020-11-30 00:46:32,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:32,148 INFO L82 PathProgramCache]: Analyzing trace with hash -793649762, now seen corresponding path program 1 times [2020-11-30 00:46:32,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:32,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722082078] [2020-11-30 00:46:32,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:32,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 00:46:32,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722082078] [2020-11-30 00:46:32,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:46:32,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:46:32,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874949171] [2020-11-30 00:46:32,229 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:46:32,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:32,230 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 3 times [2020-11-30 00:46:32,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:32,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231373659] [2020-11-30 00:46:32,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:32,248 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:32,260 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:32,268 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:46:32,492 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2020-11-30 00:46:32,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:46:32,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:46:32,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:46:32,546 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. cyclomatic complexity: 18 Second operand 4 states. [2020-11-30 00:46:32,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:46:32,591 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2020-11-30 00:46:32,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:46:32,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2020-11-30 00:46:32,593 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-30 00:46:32,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2020-11-30 00:46:32,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-11-30 00:46:32,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-11-30 00:46:32,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2020-11-30 00:46:32,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:46:32,594 INFO L691 BuchiCegarLoop]: Abstraction has 33 states and 46 transitions. [2020-11-30 00:46:32,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2020-11-30 00:46:32,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2020-11-30 00:46:32,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-30 00:46:32,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2020-11-30 00:46:32,597 INFO L714 BuchiCegarLoop]: Abstraction has 32 states and 45 transitions. [2020-11-30 00:46:32,597 INFO L594 BuchiCegarLoop]: Abstraction has 32 states and 45 transitions. [2020-11-30 00:46:32,597 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-30 00:46:32,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 45 transitions. [2020-11-30 00:46:32,598 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-30 00:46:32,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:46:32,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:46:32,599 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:46:32,599 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-30 00:46:32,599 INFO L794 eck$LassoCheckResult]: Stem: 1036#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1033#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1029#L565 assume !(main_~array_size~0 < 1); 1030#L565-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;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; 1037#L552-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); 1044#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1045#L552-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); 1046#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1047#L552-3 assume !(lis_~i~0 < lis_~N); 1020#L552-4 lis_~i~0 := 1; 1021#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1038#L555-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; 1024#L556 assume !lis_#t~short11; 1025#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 1032#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1035#L555-3 assume !(lis_~j~0 < lis_~i~0); 1040#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1041#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1034#L555-3 [2020-11-30 00:46:32,599 INFO L796 eck$LassoCheckResult]: Loop: 1034#L555-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; 1022#L556 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; 1023#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1031#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1034#L555-3 [2020-11-30 00:46:32,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:32,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1717296809, now seen corresponding path program 1 times [2020-11-30 00:46:32,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:32,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762208960] [2020-11-30 00:46:32,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:46:32,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762208960] [2020-11-30 00:46:32,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129289150] [2020-11-30 00:46:32,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:46:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:32,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 00:46:32,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:46:32,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:46:32,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:46:32,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-11-30 00:46:32,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177858355] [2020-11-30 00:46:32,818 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:46:32,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:32,819 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 4 times [2020-11-30 00:46:32,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:32,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676304954] [2020-11-30 00:46:32,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:32,831 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:32,840 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:32,847 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:46:33,049 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2020-11-30 00:46:33,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:46:33,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 00:46:33,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:46:33,100 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. cyclomatic complexity: 17 Second operand 11 states. [2020-11-30 00:46:33,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:46:33,309 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2020-11-30 00:46:33,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 00:46:33,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 103 transitions. [2020-11-30 00:46:33,311 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-11-30 00:46:33,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 55 states and 77 transitions. [2020-11-30 00:46:33,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-11-30 00:46:33,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-11-30 00:46:33,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 77 transitions. [2020-11-30 00:46:33,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:46:33,315 INFO L691 BuchiCegarLoop]: Abstraction has 55 states and 77 transitions. [2020-11-30 00:46:33,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 77 transitions. [2020-11-30 00:46:33,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 36. [2020-11-30 00:46:33,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-11-30 00:46:33,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2020-11-30 00:46:33,318 INFO L714 BuchiCegarLoop]: Abstraction has 36 states and 50 transitions. [2020-11-30 00:46:33,318 INFO L594 BuchiCegarLoop]: Abstraction has 36 states and 50 transitions. [2020-11-30 00:46:33,318 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-30 00:46:33,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 50 transitions. [2020-11-30 00:46:33,319 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-30 00:46:33,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:46:33,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:46:33,320 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:46:33,320 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-30 00:46:33,320 INFO L794 eck$LassoCheckResult]: Stem: 1214#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1211#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1207#L565 assume !(main_~array_size~0 < 1); 1208#L565-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;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; 1215#L552-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); 1224#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1229#L552-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); 1222#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1223#L552-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); 1225#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1226#L552-3 assume !(lis_~i~0 < lis_~N); 1198#L552-4 lis_~i~0 := 1; 1199#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1218#L555-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; 1219#L556 assume !lis_#t~short11; 1233#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 1231#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1230#L555-3 assume !(lis_~j~0 < lis_~i~0); 1216#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1217#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1212#L555-3 [2020-11-30 00:46:33,320 INFO L796 eck$LassoCheckResult]: Loop: 1212#L555-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; 1200#L556 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; 1201#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1209#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1212#L555-3 [2020-11-30 00:46:33,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:33,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1523485369, now seen corresponding path program 2 times [2020-11-30 00:46:33,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:33,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174122218] [2020-11-30 00:46:33,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:33,337 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:33,352 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:33,358 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:46:33,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:33,359 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 5 times [2020-11-30 00:46:33,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:33,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157108383] [2020-11-30 00:46:33,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:33,366 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:33,373 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:33,375 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:46:33,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:33,376 INFO L82 PathProgramCache]: Analyzing trace with hash -423959456, now seen corresponding path program 1 times [2020-11-30 00:46:33,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:33,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916973353] [2020-11-30 00:46:33,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:33,401 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:33,432 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:33,445 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:46:33,720 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2020-11-30 00:46:35,767 WARN L193 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 213 DAG size of output: 161 [2020-11-30 00:46:36,362 WARN L193 SmtUtils]: Spent 559.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-11-30 00:46:36,365 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:46:36,365 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:46:36,365 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:46:36,365 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:46:36,365 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:46:36,365 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:36,365 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:46:36,365 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:46:36,365 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration8_Lasso [2020-11-30 00:46:36,365 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:46:36,365 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:46:36,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:36,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:36,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:36,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:36,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:36,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:36,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:36,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:36,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:37,808 WARN L193 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 113 [2020-11-30 00:46:38,246 WARN L193 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 101 [2020-11-30 00:46:38,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:38,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:38,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:38,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:38,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:38,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:38,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:38,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:38,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:38,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:38,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:38,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:38,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:38,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:38,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:46:38,722 WARN L193 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 78 [2020-11-30 00:46:39,127 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-11-30 00:46:39,323 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:46:39,323 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:39,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 [2020-11-30 00:46:39,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:39,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:46:39,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:39,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:39,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:39,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:46:39,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:46:39,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_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:39,358 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 [2020-11-30 00:46:39,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:39,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:39,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:39,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:39,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:39,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:46:39,394 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:39,419 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 [2020-11-30 00:46:39,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:39,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:39,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:39,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:39,421 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:39,421 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:46:39,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_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:39,447 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 [2020-11-30 00:46:39,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:39,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:46:39,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:39,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:39,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:39,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:46:39,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:46:39,456 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:39,487 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 [2020-11-30 00:46:39,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:39,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:39,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:39,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:39,490 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:39,490 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:46:39,503 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:39,525 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 [2020-11-30 00:46:39,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:39,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:46:39,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:39,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:39,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:39,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:46:39,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:46:39,529 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:39,552 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 [2020-11-30 00:46:39,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:39,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:46:39,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:39,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:39,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:39,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:46:39,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:46:39,566 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:39,590 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 [2020-11-30 00:46:39,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:39,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:46:39,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:39,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:39,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:39,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:46:39,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:46:39,593 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:39,615 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 [2020-11-30 00:46:39,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:39,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:39,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:39,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:39,620 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:39,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:46:39,624 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:39,648 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 [2020-11-30 00:46:39,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:39,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:39,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:39,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:39,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:39,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:46:39,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:39,678 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 [2020-11-30 00:46:39,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:39,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:39,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:39,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:39,681 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:39,681 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:46:39,683 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:39,705 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 [2020-11-30 00:46:39,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:39,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:39,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:39,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:39,709 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:39,709 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:46:39,712 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:39,733 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 [2020-11-30 00:46:39,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:39,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:39,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:39,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:39,740 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:39,740 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:46:39,746 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:39,769 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 [2020-11-30 00:46:39,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:39,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:39,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:39,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:39,790 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:39,790 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:46:39,815 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:46:39,944 INFO L443 ModelExtractionUtils]: Simplification made 40 calls to the SMT solver. [2020-11-30 00:46:39,944 INFO L444 ModelExtractionUtils]: 12 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_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:39,946 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-30 00:46:39,948 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-30 00:46:39,949 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:46:39,949 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0) = -2*ULTIMATE.start_lis_~j~0 + 3 Supporting invariants [] [2020-11-30 00:46:40,281 INFO L297 tatePredicateManager]: 65 out of 67 supporting invariants were superfluous and have been removed [2020-11-30 00:46:40,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:40,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-30 00:46:40,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:46:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:40,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 00:46:40,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:46:40,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:46:40,465 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2020-11-30 00:46:40,465 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 50 transitions. cyclomatic complexity: 18 Second operand 6 states. [2020-11-30 00:46:40,541 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 50 transitions. cyclomatic complexity: 18. Second operand 6 states. Result 36 states and 50 transitions. Complement of second has 5 states. [2020-11-30 00:46:40,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2020-11-30 00:46:40,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-11-30 00:46:40,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-11-30 00:46:40,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 20 letters. Loop has 4 letters. [2020-11-30 00:46:40,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:46:40,545 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-11-30 00:46:40,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:40,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-30 00:46:40,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:46:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:40,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 00:46:40,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:46:40,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:46:40,738 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2020-11-30 00:46:40,738 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 50 transitions. cyclomatic complexity: 18 Second operand 7 states. [2020-11-30 00:46:40,844 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 50 transitions. cyclomatic complexity: 18. Second operand 7 states. Result 36 states and 50 transitions. Complement of second has 6 states. [2020-11-30 00:46:40,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 4 stem states 0 non-accepting loop states 1 accepting loop states [2020-11-30 00:46:40,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-11-30 00:46:40,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2020-11-30 00:46:40,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 20 letters. Loop has 4 letters. [2020-11-30 00:46:40,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:46:40,846 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-11-30 00:46:40,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:40,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-30 00:46:40,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:46:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:41,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 00:46:41,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:46:41,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:46:41,051 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2020-11-30 00:46:41,051 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 50 transitions. cyclomatic complexity: 18 Second operand 7 states. [2020-11-30 00:46:41,314 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 50 transitions. cyclomatic complexity: 18. Second operand 7 states. Result 59 states and 86 transitions. Complement of second has 12 states. [2020-11-30 00:46:41,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2020-11-30 00:46:41,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-11-30 00:46:41,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2020-11-30 00:46:41,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 58 transitions. Stem has 20 letters. Loop has 4 letters. [2020-11-30 00:46:41,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:46:41,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 58 transitions. Stem has 24 letters. Loop has 4 letters. [2020-11-30 00:46:41,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:46:41,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 58 transitions. Stem has 20 letters. Loop has 8 letters. [2020-11-30 00:46:41,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:46:41,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 86 transitions. [2020-11-30 00:46:41,320 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-30 00:46:41,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 47 states and 66 transitions. [2020-11-30 00:46:41,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-11-30 00:46:41,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-11-30 00:46:41,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 66 transitions. [2020-11-30 00:46:41,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:46:41,322 INFO L691 BuchiCegarLoop]: Abstraction has 47 states and 66 transitions. [2020-11-30 00:46:41,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 66 transitions. [2020-11-30 00:46:41,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2020-11-30 00:46:41,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-11-30 00:46:41,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2020-11-30 00:46:41,341 INFO L714 BuchiCegarLoop]: Abstraction has 36 states and 49 transitions. [2020-11-30 00:46:41,341 INFO L594 BuchiCegarLoop]: Abstraction has 36 states and 49 transitions. [2020-11-30 00:46:41,341 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-30 00:46:41,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 49 transitions. [2020-11-30 00:46:41,342 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-30 00:46:41,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:46:41,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:46:41,345 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:46:41,346 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-30 00:46:41,346 INFO L794 eck$LassoCheckResult]: Stem: 1940#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1937#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1933#L565 assume !(main_~array_size~0 < 1); 1934#L565-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;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; 1941#L552-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); 1947#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1948#L552-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); 1949#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1953#L552-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); 1951#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1950#L552-3 assume !(lis_~i~0 < lis_~N); 1924#L552-4 lis_~i~0 := 1; 1925#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1945#L555-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; 1958#L556 assume !lis_#t~short11; 1956#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1955#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1954#L555-3 assume !(lis_~j~0 < lis_~i~0); 1943#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1944#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1939#L555-3 assume !(lis_~j~0 < lis_~i~0); 1942#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1952#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1938#L555-3 [2020-11-30 00:46:41,346 INFO L796 eck$LassoCheckResult]: Loop: 1938#L555-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; 1926#L556 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; 1927#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1935#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1938#L555-3 [2020-11-30 00:46:41,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:41,347 INFO L82 PathProgramCache]: Analyzing trace with hash 2042594997, now seen corresponding path program 1 times [2020-11-30 00:46:41,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:41,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335036281] [2020-11-30 00:46:41,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:41,390 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-30 00:46:41,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335036281] [2020-11-30 00:46:41,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:46:41,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:46:41,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691029908] [2020-11-30 00:46:41,391 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:46:41,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:41,392 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 6 times [2020-11-30 00:46:41,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:41,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098600313] [2020-11-30 00:46:41,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:41,399 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:41,419 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:41,422 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:46:41,658 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2020-11-30 00:46:41,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:46:41,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:46:41,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:46:41,713 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. cyclomatic complexity: 17 Second operand 3 states. [2020-11-30 00:46:41,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:46:41,728 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2020-11-30 00:46:41,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:46:41,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 52 transitions. [2020-11-30 00:46:41,730 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-30 00:46:41,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 51 transitions. [2020-11-30 00:46:41,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-11-30 00:46:41,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-11-30 00:46:41,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2020-11-30 00:46:41,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:46:41,732 INFO L691 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2020-11-30 00:46:41,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2020-11-30 00:46:41,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2020-11-30 00:46:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-11-30 00:46:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2020-11-30 00:46:41,735 INFO L714 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2020-11-30 00:46:41,735 INFO L594 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2020-11-30 00:46:41,735 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-30 00:46:41,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 50 transitions. [2020-11-30 00:46:41,736 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-30 00:46:41,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:46:41,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:46:41,737 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:46:41,737 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-30 00:46:41,737 INFO L794 eck$LassoCheckResult]: Stem: 2023#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2020#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 2016#L565 assume !(main_~array_size~0 < 1); 2017#L565-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;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; 2024#L552-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); 2031#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2032#L552-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); 2033#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2036#L552-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); 2035#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2034#L552-3 assume !(lis_~i~0 < lis_~N); 2006#L552-4 lis_~i~0 := 1; 2007#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2025#L555-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; 2026#L556 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; 2043#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2019#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2022#L555-3 assume !(lis_~j~0 < lis_~i~0); 2027#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2028#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2029#L555-3 assume !(lis_~j~0 < lis_~i~0); 2038#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2037#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2021#L555-3 [2020-11-30 00:46:41,737 INFO L796 eck$LassoCheckResult]: Loop: 2021#L555-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; 2008#L556 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; 2009#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2018#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2021#L555-3 [2020-11-30 00:46:41,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:41,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1362536627, now seen corresponding path program 1 times [2020-11-30 00:46:41,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:41,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797487189] [2020-11-30 00:46:41,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-30 00:46:41,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797487189] [2020-11-30 00:46:41,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630896047] [2020-11-30 00:46:41,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:41,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:46:41,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:46:41,908 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-30 00:46:41,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:46:41,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2020-11-30 00:46:41,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069744084] [2020-11-30 00:46:41,909 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:46:41,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:41,910 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 7 times [2020-11-30 00:46:41,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:41,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840023237] [2020-11-30 00:46:41,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:41,918 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:41,924 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:41,927 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:46:42,226 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2020-11-30 00:46:42,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:46:42,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:46:42,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:46:42,286 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. cyclomatic complexity: 16 Second operand 5 states. [2020-11-30 00:46:42,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:46:42,354 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2020-11-30 00:46:42,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:46:42,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. [2020-11-30 00:46:42,355 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-30 00:46:42,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 64 transitions. [2020-11-30 00:46:42,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-11-30 00:46:42,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-11-30 00:46:42,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2020-11-30 00:46:42,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:46:42,356 INFO L691 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2020-11-30 00:46:42,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2020-11-30 00:46:42,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2020-11-30 00:46:42,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-30 00:46:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2020-11-30 00:46:42,362 INFO L714 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2020-11-30 00:46:42,362 INFO L594 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2020-11-30 00:46:42,362 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-11-30 00:46:42,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2020-11-30 00:46:42,363 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-30 00:46:42,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:46:42,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:46:42,364 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:46:42,364 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-30 00:46:42,364 INFO L794 eck$LassoCheckResult]: Stem: 2186#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2183#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 2179#L565 assume !(main_~array_size~0 < 1); 2180#L565-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;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; 2187#L552-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); 2192#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2193#L552-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); 2195#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2198#L552-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); 2197#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2196#L552-3 assume !(lis_~i~0 < lis_~N); 2168#L552-4 lis_~i~0 := 1; 2169#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2191#L555-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; 2205#L556 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; 2203#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2202#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2201#L555-3 assume !(lis_~j~0 < lis_~i~0); 2189#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2190#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2188#L555-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; 2173#L556 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; 2174#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 2182#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2185#L555-3 assume !(lis_~j~0 < lis_~i~0); 2200#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2199#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2184#L555-3 [2020-11-30 00:46:42,364 INFO L796 eck$LassoCheckResult]: Loop: 2184#L555-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; 2170#L556 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; 2171#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2181#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2184#L555-3 [2020-11-30 00:46:42,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:42,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1653188782, now seen corresponding path program 1 times [2020-11-30 00:46:42,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:42,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359583181] [2020-11-30 00:46:42,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:42,452 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-30 00:46:42,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359583181] [2020-11-30 00:46:42,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932709597] [2020-11-30 00:46:42,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:42,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 00:46:42,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:46:42,596 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-30 00:46:42,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:46:42,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-11-30 00:46:42,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918193895] [2020-11-30 00:46:42,597 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:46:42,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:42,597 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 8 times [2020-11-30 00:46:42,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:42,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499776359] [2020-11-30 00:46:42,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:42,605 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:42,616 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:42,619 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:46:42,856 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2020-11-30 00:46:42,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:46:42,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 00:46:42,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:46:42,940 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. cyclomatic complexity: 16 Second operand 9 states. [2020-11-30 00:46:43,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:46:43,104 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2020-11-30 00:46:43,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:46:43,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 78 transitions. [2020-11-30 00:46:43,106 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-30 00:46:43,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 78 transitions. [2020-11-30 00:46:43,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-11-30 00:46:43,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-11-30 00:46:43,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 78 transitions. [2020-11-30 00:46:43,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:46:43,107 INFO L691 BuchiCegarLoop]: Abstraction has 58 states and 78 transitions. [2020-11-30 00:46:43,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 78 transitions. [2020-11-30 00:46:43,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2020-11-30 00:46:43,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-11-30 00:46:43,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2020-11-30 00:46:43,111 INFO L714 BuchiCegarLoop]: Abstraction has 44 states and 58 transitions. [2020-11-30 00:46:43,111 INFO L594 BuchiCegarLoop]: Abstraction has 44 states and 58 transitions. [2020-11-30 00:46:43,111 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-11-30 00:46:43,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 58 transitions. [2020-11-30 00:46:43,112 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-30 00:46:43,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:46:43,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:46:43,113 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:46:43,113 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-30 00:46:43,113 INFO L794 eck$LassoCheckResult]: Stem: 2378#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2374#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 2370#L565 assume !(main_~array_size~0 < 1); 2371#L565-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;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; 2379#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2384#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2385#L552-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); 2387#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2390#L552-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); 2389#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2388#L552-3 assume !(lis_~i~0 < lis_~N); 2359#L552-4 lis_~i~0 := 1; 2360#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2382#L555-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; 2401#L556 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; 2398#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2395#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2393#L555-3 assume !(lis_~j~0 < lis_~i~0); 2380#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2381#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2383#L555-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; 2400#L556 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; 2396#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 2376#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2377#L555-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; 2364#L556 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; 2365#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 2373#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2394#L555-3 assume !(lis_~j~0 < lis_~i~0); 2392#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2391#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2375#L555-3 [2020-11-30 00:46:43,113 INFO L796 eck$LassoCheckResult]: Loop: 2375#L555-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; 2361#L556 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; 2362#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2372#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2375#L555-3 [2020-11-30 00:46:43,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:43,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1844038871, now seen corresponding path program 2 times [2020-11-30 00:46:43,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:43,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163185088] [2020-11-30 00:46:43,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:43,277 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-30 00:46:43,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163185088] [2020-11-30 00:46:43,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833964705] [2020-11-30 00:46:43,277 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/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 [2020-11-30 00:46:43,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 00:46:43,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:46:43,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 00:46:43,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:46:43,522 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-30 00:46:43,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:46:43,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2020-11-30 00:46:43,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980762944] [2020-11-30 00:46:43,523 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:46:43,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:43,524 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 9 times [2020-11-30 00:46:43,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:43,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875016304] [2020-11-30 00:46:43,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:43,532 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:43,538 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:43,540 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:46:43,778 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2020-11-30 00:46:43,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:46:43,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 00:46:43,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2020-11-30 00:46:43,842 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. cyclomatic complexity: 18 Second operand 14 states. [2020-11-30 00:46:44,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:46:44,164 INFO L93 Difference]: Finished difference Result 125 states and 167 transitions. [2020-11-30 00:46:44,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 00:46:44,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 167 transitions. [2020-11-30 00:46:44,167 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-11-30 00:46:44,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 89 states and 120 transitions. [2020-11-30 00:46:44,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2020-11-30 00:46:44,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2020-11-30 00:46:44,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 120 transitions. [2020-11-30 00:46:44,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:46:44,169 INFO L691 BuchiCegarLoop]: Abstraction has 89 states and 120 transitions. [2020-11-30 00:46:44,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 120 transitions. [2020-11-30 00:46:44,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2020-11-30 00:46:44,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-30 00:46:44,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2020-11-30 00:46:44,173 INFO L714 BuchiCegarLoop]: Abstraction has 59 states and 79 transitions. [2020-11-30 00:46:44,174 INFO L594 BuchiCegarLoop]: Abstraction has 59 states and 79 transitions. [2020-11-30 00:46:44,174 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-11-30 00:46:44,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 79 transitions. [2020-11-30 00:46:44,175 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-30 00:46:44,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:46:44,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:46:44,176 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:46:44,176 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-30 00:46:44,177 INFO L794 eck$LassoCheckResult]: Stem: 2662#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2658#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 2654#L565 assume !(main_~array_size~0 < 1); 2655#L565-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;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; 2663#L552-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); 2670#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2671#L552-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); 2672#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2680#L552-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); 2679#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2678#L552-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); 2674#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2673#L552-3 assume !(lis_~i~0 < lis_~N); 2643#L552-4 lis_~i~0 := 1; 2644#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2666#L555-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; 2691#L556 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; 2689#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2686#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2681#L555-3 assume !(lis_~j~0 < lis_~i~0); 2682#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2667#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2668#L555-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; 2697#L556 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; 2695#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 2694#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2693#L555-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; 2685#L556 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; 2687#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 2683#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2684#L555-3 assume !(lis_~j~0 < lis_~i~0); 2664#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2665#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2659#L555-3 [2020-11-30 00:46:44,177 INFO L796 eck$LassoCheckResult]: Loop: 2659#L555-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; 2645#L556 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; 2646#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2656#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2659#L555-3 [2020-11-30 00:46:44,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:44,178 INFO L82 PathProgramCache]: Analyzing trace with hash -205154041, now seen corresponding path program 3 times [2020-11-30 00:46:44,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:44,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733373775] [2020-11-30 00:46:44,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:45,612 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:46:45,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733373775] [2020-11-30 00:46:45,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473212973] [2020-11-30 00:46:45,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:46:45,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-11-30 00:46:45,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:46:45,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 41 conjunts are in the unsatisfiable core [2020-11-30 00:46:45,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:46:45,741 INFO L384 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 14 treesize of output 12 [2020-11-30 00:46:45,743 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:46:45,751 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:46:45,752 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:46:45,752 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2020-11-30 00:46:45,811 INFO L384 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 [2020-11-30 00:46:45,811 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:46:45,833 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:46:45,833 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:46:45,833 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:36 [2020-11-30 00:46:45,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:46:45,984 INFO L350 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2020-11-30 00:46:45,984 INFO L384 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 66 treesize of output 55 [2020-11-30 00:46:45,985 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:46:46,002 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:46:46,002 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:46:46,002 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:79, output treesize:62 [2020-11-30 00:46:46,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:46:46,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:46:46,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:46:46,130 INFO L350 Elim1Store]: treesize reduction 96, result has 20.7 percent of original size [2020-11-30 00:46:46,130 INFO L384 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 92 treesize of output 87 [2020-11-30 00:46:46,132 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:46:46,152 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:46:46,153 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:46:46,153 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:105, output treesize:88 [2020-11-30 00:46:46,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:46:46,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:46:46,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:46:46,526 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2020-11-30 00:46:46,526 INFO L350 Elim1Store]: treesize reduction 32, result has 87.3 percent of original size [2020-11-30 00:46:46,527 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 90 treesize of output 259 [2020-11-30 00:46:46,529 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:46:46,617 INFO L625 ElimStorePlain]: treesize reduction 168, result has 33.9 percent of original size [2020-11-30 00:46:46,617 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:46:46,617 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:103, output treesize:86 [2020-11-30 00:46:47,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:46:47,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:46:47,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:46:47,533 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2020-11-30 00:46:47,533 INFO L350 Elim1Store]: treesize reduction 104, result has 60.5 percent of original size [2020-11-30 00:46:47,534 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 4 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 13 case distinctions, treesize of input 118 treesize of output 219 [2020-11-30 00:46:47,536 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:46:47,661 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2020-11-30 00:46:47,662 INFO L625 ElimStorePlain]: treesize reduction 58, result has 65.7 percent of original size [2020-11-30 00:46:47,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,684 INFO L545 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. [2020-11-30 00:46:47,685 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:136, output treesize:111 [2020-11-30 00:46:47,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:47,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:48,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:49,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:46:49,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:46:49,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:46:49,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:46:49,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:46:49,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:46:49,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:46:49,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:46:49,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:46:49,539 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:46:49,539 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 105 [2020-11-30 00:46:49,540 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:46:49,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:46:49,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:46:49,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:46:49,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:46:49,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:46:49,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:46:49,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:46:49,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:46:49,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:46:49,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:46:49,642 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:46:49,642 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 11 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 11 case distinctions, treesize of input 94 treesize of output 184 [2020-11-30 00:46:49,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:46:49,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:46:49,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:46:49,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:46:49,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:46:49,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:46:49,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:46:49,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:46:49,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:46:49,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:46:49,690 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:46:49,930 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 40 [2020-11-30 00:46:49,931 INFO L625 ElimStorePlain]: treesize reduction 201, result has 33.7 percent of original size [2020-11-30 00:46:49,937 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2020-11-30 00:46:49,937 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:227, output treesize:97 [2020-11-30 00:46:50,505 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:46:50,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:46:50,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 42 [2020-11-30 00:46:50,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904763013] [2020-11-30 00:46:50,506 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:46:50,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:50,506 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 10 times [2020-11-30 00:46:50,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:50,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291771805] [2020-11-30 00:46:50,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:50,513 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:50,519 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:50,521 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:46:50,726 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2020-11-30 00:46:50,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:46:50,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2020-11-30 00:46:50,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1646, Unknown=0, NotChecked=0, Total=1806 [2020-11-30 00:46:50,780 INFO L87 Difference]: Start difference. First operand 59 states and 79 transitions. cyclomatic complexity: 25 Second operand 43 states. [2020-11-30 00:46:51,921 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2020-11-30 00:46:52,846 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 65 [2020-11-30 00:46:53,337 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2020-11-30 00:46:53,574 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 38 [2020-11-30 00:46:53,878 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2020-11-30 00:46:54,063 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 43 [2020-11-30 00:46:54,223 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 50 [2020-11-30 00:46:54,434 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2020-11-30 00:46:54,760 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2020-11-30 00:46:55,068 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 69 [2020-11-30 00:46:55,488 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2020-11-30 00:46:55,708 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2020-11-30 00:46:55,959 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 69 [2020-11-30 00:46:56,141 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 67 [2020-11-30 00:46:56,433 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 71 [2020-11-30 00:46:56,697 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 69 [2020-11-30 00:46:57,448 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 67 [2020-11-30 00:46:57,905 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2020-11-30 00:46:58,138 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2020-11-30 00:46:58,382 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2020-11-30 00:46:58,663 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 54 [2020-11-30 00:47:00,334 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2020-11-30 00:47:00,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:00,833 INFO L93 Difference]: Finished difference Result 261 states and 347 transitions. [2020-11-30 00:47:00,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-11-30 00:47:00,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 261 states and 347 transitions. [2020-11-30 00:47:00,836 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 38 [2020-11-30 00:47:00,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 261 states to 224 states and 302 transitions. [2020-11-30 00:47:00,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2020-11-30 00:47:00,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2020-11-30 00:47:00,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 224 states and 302 transitions. [2020-11-30 00:47:00,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:47:00,839 INFO L691 BuchiCegarLoop]: Abstraction has 224 states and 302 transitions. [2020-11-30 00:47:00,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states and 302 transitions. [2020-11-30 00:47:00,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 140. [2020-11-30 00:47:00,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-11-30 00:47:00,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 188 transitions. [2020-11-30 00:47:00,849 INFO L714 BuchiCegarLoop]: Abstraction has 140 states and 188 transitions. [2020-11-30 00:47:00,849 INFO L594 BuchiCegarLoop]: Abstraction has 140 states and 188 transitions. [2020-11-30 00:47:00,849 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-11-30 00:47:00,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 188 transitions. [2020-11-30 00:47:00,850 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2020-11-30 00:47:00,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:47:00,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:47:00,851 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:00,851 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-30 00:47:00,852 INFO L794 eck$LassoCheckResult]: Stem: 3211#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3208#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 3204#L565 assume !(main_~array_size~0 < 1); 3205#L565-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;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; 3212#L552-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); 3222#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3223#L552-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); 3224#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3269#L552-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); 3268#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3267#L552-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); 3266#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3263#L552-3 assume !(lis_~i~0 < lis_~N); 3262#L552-4 lis_~i~0 := 1; 3261#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3259#L555-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; 3258#L556 assume !lis_#t~short11; 3257#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 3256#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3255#L555-3 assume !(lis_~j~0 < lis_~i~0); 3254#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3253#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3252#L555-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; 3250#L556 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; 3251#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3207#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3210#L555-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; 3213#L556 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; 3324#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 3323#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3322#L555-3 assume !(lis_~j~0 < lis_~i~0); 3216#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3217#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3209#L555-3 [2020-11-30 00:47:00,852 INFO L796 eck$LassoCheckResult]: Loop: 3209#L555-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; 3195#L556 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; 3196#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3206#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3209#L555-3 [2020-11-30 00:47:00,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:00,852 INFO L82 PathProgramCache]: Analyzing trace with hash 800338629, now seen corresponding path program 2 times [2020-11-30 00:47:00,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:00,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469966291] [2020-11-30 00:47:00,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:47:00,886 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:47:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:47:00,934 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:47:00,940 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:47:00,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:00,941 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 11 times [2020-11-30 00:47:00,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:00,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724176296] [2020-11-30 00:47:00,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:47:00,956 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:47:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:47:00,961 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:47:00,963 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:47:00,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:00,964 INFO L82 PathProgramCache]: Analyzing trace with hash 20293228, now seen corresponding path program 3 times [2020-11-30 00:47:00,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:00,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115290253] [2020-11-30 00:47:00,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:47:01,042 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:47:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:47:01,072 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:47:01,079 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:47:01,339 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2020-11-30 00:47:14,403 WARN L193 SmtUtils]: Spent 12.99 s on a formula simplification. DAG size of input: 359 DAG size of output: 231 [2020-11-30 00:47:18,671 WARN L193 SmtUtils]: Spent 4.23 s on a formula simplification that was a NOOP. DAG size: 141 [2020-11-30 00:47:18,674 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:47:18,674 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:47:18,674 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:47:18,674 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:47:18,674 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:47:18,674 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:47:18,674 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:47:18,674 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:47:18,674 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration14_Lasso [2020-11-30 00:47:18,675 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:47:18,675 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:47:18,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:47:18,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:47:18,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:47:18,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:47:18,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:47:18,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:47:18,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:47:18,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:47:18,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:47:18,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:47:18,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:47:18,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:47:18,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:47:18,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:47:18,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:47:18,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:47:18,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:47:18,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:47:18,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:47:18,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:47:18,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:47:24,721 WARN L193 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 118 [2020-11-30 00:47:25,546 WARN L193 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 120 [2020-11-30 00:47:25,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:47:25,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:47:25,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:47:25,846 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2020-11-30 00:47:26,613 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:47:26,613 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:47:26,617 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 [2020-11-30 00:47:26,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:47:26,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:47:26,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:47:26,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:47:26,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:47:26,618 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:47:26,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:47:26,619 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:47:26,642 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 [2020-11-30 00:47:26,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:47:26,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:47:26,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:47:26,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:47:26,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:47:26,644 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:47:26,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:47:26,645 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:47:26,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:47:26,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:47:26,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:47:26,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:47:26,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:47:26,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:47:26,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:47:26,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:47:26,670 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:47:26,691 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 [2020-11-30 00:47:26,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:47:26,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:47:26,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:47:26,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:47:26,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:47:26,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:47:26,696 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:47:26,725 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 [2020-11-30 00:47:26,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:47:26,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:47:26,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:47:26,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:47:26,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:47:26,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:47:26,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:47:26,728 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:47:26,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:47:26,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:47:26,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:47:26,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:47:26,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:47:26,766 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:47:26,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:47:26,770 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:47:26,807 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 [2020-11-30 00:47:26,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:47:26,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:47:26,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:47:26,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:47:26,810 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:47:26,810 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:47:26,813 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:47:26,835 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 [2020-11-30 00:47:26,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:47:26,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:47:26,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:47:26,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:47:26,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:47:26,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:47:26,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:47:26,837 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:47:26,860 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 [2020-11-30 00:47:26,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:47:26,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:47:26,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:47:26,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:47:26,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:47:26,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:47:26,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:47:26,863 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 82 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:47:26,886 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 [2020-11-30 00:47:26,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:47:26,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:47:26,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:47:26,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:47:26,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:47:26,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:47:26,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:47:26,889 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:47:26,913 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 [2020-11-30 00:47:26,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:47:26,915 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:47:26,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:47:26,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:47:26,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:47:26,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:47:26,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:47:26,916 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:47:26,938 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 [2020-11-30 00:47:26,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:47:26,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:47:26,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:47:26,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:47:26,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:47:26,939 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:47:26,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:47:26,941 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:47:26,984 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 [2020-11-30 00:47:26,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:47:26,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:47:26,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:47:26,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:47:26,989 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:47:26,989 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:47:26,993 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 86 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:47:27,023 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 [2020-11-30 00:47:27,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:47:27,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:47:27,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:47:27,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:47:27,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:47:27,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:47:27,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:47:27,026 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:47:27,066 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 [2020-11-30 00:47:27,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:47:27,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:47:27,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:47:27,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:47:27,070 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:47:27,070 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:47:27,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 88 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:47:27,102 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 [2020-11-30 00:47:27,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:47:27,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:47:27,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:47:27,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:47:27,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:47:27,104 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:47:27,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:47:27,105 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 89 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:47:27,126 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 [2020-11-30 00:47:27,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:47:27,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:47:27,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:47:27,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:47:27,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:47:27,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:47:27,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:47:27,129 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 90 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 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:47:27,151 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 [2020-11-30 00:47:27,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:47:27,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:47:27,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:47:27,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:47:27,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:47:27,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:47:27,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:47:27,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 91 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 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:47:27,178 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 [2020-11-30 00:47:27,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:47:27,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:47:27,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:47:27,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:47:27,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:47:27,179 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:47:27,179 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:47:27,181 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 92 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 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:47:27,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:47:27,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:47:27,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:47:27,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:47:27,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:47:27,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:47:27,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:47:27,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:47:27,214 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 93 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 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:47:27,235 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 [2020-11-30 00:47:27,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:47:27,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:47:27,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:47:27,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:47:27,238 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:47:27,238 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:47:27,241 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 94 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 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:47:27,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:47:27,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:47:27,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:47:27,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:47:27,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:47:27,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:47:27,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:47:27,270 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 95 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 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:47:27,292 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 [2020-11-30 00:47:27,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:47:27,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:47:27,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:47:27,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:47:27,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:47:27,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:47:27,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:47:27,302 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 96 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 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:47:27,324 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 [2020-11-30 00:47:27,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:47:27,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:47:27,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:47:27,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:47:27,340 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:47:27,340 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:47:27,362 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:47:27,398 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2020-11-30 00:47:27,398 INFO L444 ModelExtractionUtils]: 32 out of 55 variables were initially zero. Simplification set additionally 20 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 97 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 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:47:27,400 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-30 00:47:27,402 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-30 00:47:27,402 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:47:27,402 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0) = -2*ULTIMATE.start_lis_~j~0 + 5 Supporting invariants [] [2020-11-30 00:47:28,246 INFO L297 tatePredicateManager]: 139 out of 142 supporting invariants were superfluous and have been removed [2020-11-30 00:47:28,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:28,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 24 conjunts are in the unsatisfiable core [2020-11-30 00:47:28,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:47:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:28,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-30 00:47:28,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:47:28,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:47:28,613 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2020-11-30 00:47:28,613 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 140 states and 188 transitions. cyclomatic complexity: 59 Second operand 8 states. [2020-11-30 00:47:28,737 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 140 states and 188 transitions. cyclomatic complexity: 59. Second operand 8 states. Result 140 states and 188 transitions. Complement of second has 6 states. [2020-11-30 00:47:28,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 4 stem states 0 non-accepting loop states 1 accepting loop states [2020-11-30 00:47:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-11-30 00:47:28,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2020-11-30 00:47:28,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 33 letters. Loop has 4 letters. [2020-11-30 00:47:28,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:47:28,742 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-11-30 00:47:28,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:28,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 24 conjunts are in the unsatisfiable core [2020-11-30 00:47:28,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:47:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:29,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-30 00:47:29,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:47:29,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:47:29,086 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 2 loop predicates [2020-11-30 00:47:29,086 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 140 states and 188 transitions. cyclomatic complexity: 59 Second operand 9 states. [2020-11-30 00:47:29,142 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 140 states and 188 transitions. cyclomatic complexity: 59. Second operand 9 states. Result 140 states and 188 transitions. Complement of second has 5 states. [2020-11-30 00:47:29,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2020-11-30 00:47:29,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-11-30 00:47:29,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-11-30 00:47:29,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 33 letters. Loop has 4 letters. [2020-11-30 00:47:29,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:47:29,144 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-11-30 00:47:29,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:29,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 24 conjunts are in the unsatisfiable core [2020-11-30 00:47:29,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:47:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:29,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-30 00:47:29,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:47:29,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:47:29,485 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2020-11-30 00:47:29,485 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 140 states and 188 transitions. cyclomatic complexity: 59 Second operand 9 states. [2020-11-30 00:47:29,791 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 140 states and 188 transitions. cyclomatic complexity: 59. Second operand 9 states. Result 219 states and 305 transitions. Complement of second has 16 states. [2020-11-30 00:47:29,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2020-11-30 00:47:29,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-11-30 00:47:29,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 78 transitions. [2020-11-30 00:47:29,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 78 transitions. Stem has 33 letters. Loop has 4 letters. [2020-11-30 00:47:29,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:47:29,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 78 transitions. Stem has 37 letters. Loop has 4 letters. [2020-11-30 00:47:29,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:47:29,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 78 transitions. Stem has 33 letters. Loop has 8 letters. [2020-11-30 00:47:29,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:47:29,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 219 states and 305 transitions. [2020-11-30 00:47:29,795 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2020-11-30 00:47:29,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 219 states to 188 states and 255 transitions. [2020-11-30 00:47:29,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-11-30 00:47:29,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2020-11-30 00:47:29,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 188 states and 255 transitions. [2020-11-30 00:47:29,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:47:29,798 INFO L691 BuchiCegarLoop]: Abstraction has 188 states and 255 transitions. [2020-11-30 00:47:29,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states and 255 transitions. [2020-11-30 00:47:29,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 158. [2020-11-30 00:47:29,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-11-30 00:47:29,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 212 transitions. [2020-11-30 00:47:29,803 INFO L714 BuchiCegarLoop]: Abstraction has 158 states and 212 transitions. [2020-11-30 00:47:29,803 INFO L594 BuchiCegarLoop]: Abstraction has 158 states and 212 transitions. [2020-11-30 00:47:29,803 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-11-30 00:47:29,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 158 states and 212 transitions. [2020-11-30 00:47:29,804 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2020-11-30 00:47:29,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:47:29,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:47:29,819 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:29,820 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-30 00:47:29,820 INFO L794 eck$LassoCheckResult]: Stem: 4841#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 4836#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 4832#L565 assume !(main_~array_size~0 < 1); 4833#L565-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;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; 4842#L552-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); 4852#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4853#L552-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); 4854#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4872#L552-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); 4871#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4869#L552-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); 4865#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4866#L552-3 assume !(lis_~i~0 < lis_~N); 4821#L552-4 lis_~i~0 := 1; 4822#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4927#L555-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; 4928#L556 assume !lis_#t~short11; 4969#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 4967#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4965#L555-3 assume !(lis_~j~0 < lis_~i~0); 4954#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 4952#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4950#L555-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; 4947#L556 assume !lis_#t~short11; 4944#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 4942#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4940#L555-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; 4933#L556 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; 4935#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4934#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4931#L555-3 assume !(lis_~j~0 < lis_~i~0); 4930#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 4929#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4838#L555-3 [2020-11-30 00:47:29,820 INFO L796 eck$LassoCheckResult]: Loop: 4838#L555-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; 4862#L556 assume !lis_#t~short11; 4864#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 4837#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4838#L555-3 [2020-11-30 00:47:29,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:29,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1085522947, now seen corresponding path program 4 times [2020-11-30 00:47:29,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:29,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151320442] [2020-11-30 00:47:29,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:47:29,858 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:47:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:47:29,880 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:47:29,888 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:47:29,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:29,889 INFO L82 PathProgramCache]: Analyzing trace with hash 2129256, now seen corresponding path program 1 times [2020-11-30 00:47:29,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:29,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853841507] [2020-11-30 00:47:29,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:47:29,893 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:47:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:47:29,895 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:47:29,896 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:47:29,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:29,896 INFO L82 PathProgramCache]: Analyzing trace with hash 2037280874, now seen corresponding path program 5 times [2020-11-30 00:47:29,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:29,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27984203] [2020-11-30 00:47:29,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:47:29,945 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:47:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:47:30,001 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:47:30,007 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:47:50,615 WARN L193 SmtUtils]: Spent 20.51 s on a formula simplification. DAG size of input: 337 DAG size of output: 224 [2020-11-30 00:47:58,051 WARN L193 SmtUtils]: Spent 7.40 s on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 00:47:58,054 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:47:58,054 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:47:58,054 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:47:58,054 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:47:58,054 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:47:58,054 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:47:58,054 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:47:58,054 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:47:58,054 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration15_Lasso [2020-11-30 00:47:58,054 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:47:58,054 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:47:58,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:48:05,094 WARN L193 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 115 [2020-11-30 00:48:05,284 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2020-11-30 00:48:05,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:48:05,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:48:05,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:48:05,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:48:05,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:48:05,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:48:05,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:48:05,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:48:05,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:48:05,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:48:05,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:48:05,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:48:05,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:48:05,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:48:05,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:48:05,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:48:05,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:48:05,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:48:05,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:48:05,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:48:05,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:48:05,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:48:05,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:48:05,688 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2020-11-30 00:48:06,074 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-11-30 00:48:06,389 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:48:06,389 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 98 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 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:48:06,391 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 [2020-11-30 00:48:06,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:48:06,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:48:06,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:48:06,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:48:06,395 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:48:06,395 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:48:06,398 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 99 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 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:48:06,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:48:06,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:48:06,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:48:06,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:48:06,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:48:06,422 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:48:06,422 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:48:06,425 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 100 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 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:48:06,447 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 [2020-11-30 00:48:06,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:48:06,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:48:06,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:48:06,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:48:06,450 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:48:06,450 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:48:06,452 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 101 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 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:48:06,479 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 [2020-11-30 00:48:06,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:48:06,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:48:06,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:48:06,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:48:06,482 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:48:06,482 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:48:06,484 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 102 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 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:48:06,507 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 [2020-11-30 00:48:06,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:48:06,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:48:06,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:48:06,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:48:06,521 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:48:06,521 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:48:06,541 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:48:06,670 INFO L443 ModelExtractionUtils]: Simplification made 38 calls to the SMT solver. [2020-11-30 00:48:06,670 INFO L444 ModelExtractionUtils]: 11 out of 55 variables were initially zero. Simplification set additionally 41 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:48:06,673 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:48:06,676 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-30 00:48:06,676 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:48:06,676 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_~i~0) = -6*ULTIMATE.start_lis_~j~0 + 5*ULTIMATE.start_lis_~i~0 Supporting invariants [] [2020-11-30 00:48:07,569 INFO L297 tatePredicateManager]: 80 out of 82 supporting invariants were superfluous and have been removed [2020-11-30 00:48:07,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:48:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:07,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-30 00:48:07,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:48:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:07,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 00:48:07,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:48:07,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:48:07,910 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2020-11-30 00:48:07,910 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 158 states and 212 transitions. cyclomatic complexity: 67 Second operand 8 states. [2020-11-30 00:48:08,013 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 158 states and 212 transitions. cyclomatic complexity: 67. Second operand 8 states. Result 158 states and 212 transitions. Complement of second has 6 states. [2020-11-30 00:48:08,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 4 stem states 0 non-accepting loop states 1 accepting loop states [2020-11-30 00:48:08,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-11-30 00:48:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2020-11-30 00:48:08,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 33 letters. Loop has 4 letters. [2020-11-30 00:48:08,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:48:08,017 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-11-30 00:48:08,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:48:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:08,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-30 00:48:08,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:48:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:08,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 00:48:08,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:48:08,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:48:08,291 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2020-11-30 00:48:08,291 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 158 states and 212 transitions. cyclomatic complexity: 67 Second operand 8 states. [2020-11-30 00:48:08,417 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 158 states and 212 transitions. cyclomatic complexity: 67. Second operand 8 states. Result 158 states and 212 transitions. Complement of second has 6 states. [2020-11-30 00:48:08,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 4 stem states 0 non-accepting loop states 1 accepting loop states [2020-11-30 00:48:08,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-11-30 00:48:08,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2020-11-30 00:48:08,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 33 letters. Loop has 4 letters. [2020-11-30 00:48:08,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:48:08,419 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-11-30 00:48:08,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:48:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:08,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-30 00:48:08,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:48:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:08,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 00:48:08,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:48:08,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:48:08,652 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2020-11-30 00:48:08,653 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 158 states and 212 transitions. cyclomatic complexity: 67 Second operand 7 states. [2020-11-30 00:48:08,961 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 158 states and 212 transitions. cyclomatic complexity: 67. Second operand 7 states. Result 238 states and 330 transitions. Complement of second has 13 states. [2020-11-30 00:48:08,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2020-11-30 00:48:08,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-11-30 00:48:08,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2020-11-30 00:48:08,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 62 transitions. Stem has 33 letters. Loop has 4 letters. [2020-11-30 00:48:08,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:48:08,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 62 transitions. Stem has 37 letters. Loop has 4 letters. [2020-11-30 00:48:08,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:48:08,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 62 transitions. Stem has 33 letters. Loop has 8 letters. [2020-11-30 00:48:08,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:48:08,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 238 states and 330 transitions. [2020-11-30 00:48:08,966 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2020-11-30 00:48:08,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 238 states to 184 states and 245 transitions. [2020-11-30 00:48:08,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-11-30 00:48:08,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-11-30 00:48:08,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 245 transitions. [2020-11-30 00:48:08,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:48:08,968 INFO L691 BuchiCegarLoop]: Abstraction has 184 states and 245 transitions. [2020-11-30 00:48:08,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 245 transitions. [2020-11-30 00:48:08,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 140. [2020-11-30 00:48:08,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-11-30 00:48:08,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 185 transitions. [2020-11-30 00:48:08,980 INFO L714 BuchiCegarLoop]: Abstraction has 140 states and 185 transitions. [2020-11-30 00:48:08,980 INFO L594 BuchiCegarLoop]: Abstraction has 140 states and 185 transitions. [2020-11-30 00:48:08,980 INFO L427 BuchiCegarLoop]: ======== Iteration 16============ [2020-11-30 00:48:08,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 185 transitions. [2020-11-30 00:48:08,981 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2020-11-30 00:48:08,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:48:08,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:48:08,985 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2020-11-30 00:48:08,986 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-30 00:48:08,987 INFO L794 eck$LassoCheckResult]: Stem: 6294#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 6290#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 6286#L565 assume !(main_~array_size~0 < 1); 6287#L565-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;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; 6295#L552-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); 6310#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6311#L552-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); 6308#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6309#L552-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); 6345#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6344#L552-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); 6341#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6342#L552-3 assume !(lis_~i~0 < lis_~N); 6275#L552-4 lis_~i~0 := 1; 6276#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6390#L555-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; 6389#L556 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; 6388#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6387#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6386#L555-3 assume !(lis_~j~0 < lis_~i~0); 6385#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 6384#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6383#L555-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; 6381#L556 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; 6382#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6289#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6293#L555-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; 6396#L556 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; 6404#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 6401#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6395#L555-3 assume !(lis_~j~0 < lis_~i~0); 6301#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 6302#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6315#L555-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; 6369#L556 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; 6366#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 6363#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6361#L555-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; 6354#L556 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; 6358#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 6355#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6353#L555-3 assume !(lis_~j~0 < lis_~i~0); 6352#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 6314#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6292#L555-3 [2020-11-30 00:48:08,990 INFO L796 eck$LassoCheckResult]: Loop: 6292#L555-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; 6337#L556 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; 6338#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6291#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6292#L555-3 [2020-11-30 00:48:08,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:48:08,991 INFO L82 PathProgramCache]: Analyzing trace with hash 756978461, now seen corresponding path program 4 times [2020-11-30 00:48:08,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:48:08,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395495705] [2020-11-30 00:48:08,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:48:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:09,106 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-11-30 00:48:09,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395495705] [2020-11-30 00:48:09,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312724126] [2020-11-30 00:48:09,107 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:48:09,197 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 00:48:09,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:48:09,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 00:48:09,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:48:09,278 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-11-30 00:48:09,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:48:09,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2020-11-30 00:48:09,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988499858] [2020-11-30 00:48:09,279 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:48:09,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:48:09,279 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 12 times [2020-11-30 00:48:09,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:48:09,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520783720] [2020-11-30 00:48:09,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:48:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:48:09,284 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:48:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:48:09,288 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:48:09,289 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:48:09,668 WARN L193 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2020-11-30 00:48:09,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:48:09,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 00:48:09,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2020-11-30 00:48:09,750 INFO L87 Difference]: Start difference. First operand 140 states and 185 transitions. cyclomatic complexity: 56 Second operand 12 states. [2020-11-30 00:48:10,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:48:10,078 INFO L93 Difference]: Finished difference Result 206 states and 273 transitions. [2020-11-30 00:48:10,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 00:48:10,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 206 states and 273 transitions. [2020-11-30 00:48:10,082 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2020-11-30 00:48:10,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 206 states to 206 states and 273 transitions. [2020-11-30 00:48:10,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2020-11-30 00:48:10,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2020-11-30 00:48:10,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 206 states and 273 transitions. [2020-11-30 00:48:10,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:48:10,085 INFO L691 BuchiCegarLoop]: Abstraction has 206 states and 273 transitions. [2020-11-30 00:48:10,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states and 273 transitions. [2020-11-30 00:48:10,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 160. [2020-11-30 00:48:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-11-30 00:48:10,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 212 transitions. [2020-11-30 00:48:10,090 INFO L714 BuchiCegarLoop]: Abstraction has 160 states and 212 transitions. [2020-11-30 00:48:10,090 INFO L594 BuchiCegarLoop]: Abstraction has 160 states and 212 transitions. [2020-11-30 00:48:10,090 INFO L427 BuchiCegarLoop]: ======== Iteration 17============ [2020-11-30 00:48:10,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 160 states and 212 transitions. [2020-11-30 00:48:10,091 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2020-11-30 00:48:10,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:48:10,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:48:10,106 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:48:10,106 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-30 00:48:10,106 INFO L794 eck$LassoCheckResult]: Stem: 6792#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 6788#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 6783#L565 assume !(main_~array_size~0 < 1); 6784#L565-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;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; 6793#L552-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); 6806#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6807#L552-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); 6804#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6805#L552-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); 6854#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6853#L552-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); 6847#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6848#L552-3 assume !(lis_~i~0 < lis_~N); 6773#L552-4 lis_~i~0 := 1; 6774#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6865#L555-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; 6864#L556 assume !lis_#t~short11; 6863#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 6862#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6861#L555-3 assume !(lis_~j~0 < lis_~i~0); 6860#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 6858#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6857#L555-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; 6855#L556 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; 6856#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6912#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6909#L555-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; 6899#L556 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; 6904#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 6901#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6898#L555-3 assume !(lis_~j~0 < lis_~i~0); 6895#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 6893#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6811#L555-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; 6889#L556 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; 6885#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 6882#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6881#L555-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; 6880#L556 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; 6878#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 6875#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6873#L555-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; 6871#L556 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; 6869#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 6828#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6829#L555-3 assume !(lis_~j~0 < lis_~i~0); 6874#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 6810#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6790#L555-3 [2020-11-30 00:48:10,106 INFO L796 eck$LassoCheckResult]: Loop: 6790#L555-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; 6794#L556 assume !lis_#t~short11; 6931#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 6789#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6790#L555-3 [2020-11-30 00:48:10,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:48:10,107 INFO L82 PathProgramCache]: Analyzing trace with hash 343170648, now seen corresponding path program 6 times [2020-11-30 00:48:10,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:48:10,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791566686] [2020-11-30 00:48:10,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:48:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:10,265 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 34 proven. 50 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-11-30 00:48:10,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791566686] [2020-11-30 00:48:10,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965189777] [2020-11-30 00:48:10,266 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:48:10,402 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2020-11-30 00:48:10,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:48:10,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-30 00:48:10,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:48:10,543 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 68 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-11-30 00:48:10,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:48:10,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2020-11-30 00:48:10,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429221023] [2020-11-30 00:48:10,543 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:48:10,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:48:10,544 INFO L82 PathProgramCache]: Analyzing trace with hash 2129256, now seen corresponding path program 2 times [2020-11-30 00:48:10,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:48:10,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956921822] [2020-11-30 00:48:10,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:48:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:48:10,547 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:48:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:48:10,549 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:48:10,550 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:48:10,669 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2020-11-30 00:48:10,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:48:10,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-30 00:48:10,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2020-11-30 00:48:10,700 INFO L87 Difference]: Start difference. First operand 160 states and 212 transitions. cyclomatic complexity: 63 Second operand 17 states. [2020-11-30 00:48:11,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:48:11,125 INFO L93 Difference]: Finished difference Result 250 states and 333 transitions. [2020-11-30 00:48:11,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 00:48:11,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 250 states and 333 transitions. [2020-11-30 00:48:11,128 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-11-30 00:48:11,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 250 states to 122 states and 165 transitions. [2020-11-30 00:48:11,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-11-30 00:48:11,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-11-30 00:48:11,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 165 transitions. [2020-11-30 00:48:11,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:48:11,130 INFO L691 BuchiCegarLoop]: Abstraction has 122 states and 165 transitions. [2020-11-30 00:48:11,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 165 transitions. [2020-11-30 00:48:11,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 84. [2020-11-30 00:48:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-30 00:48:11,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2020-11-30 00:48:11,132 INFO L714 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2020-11-30 00:48:11,132 INFO L594 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2020-11-30 00:48:11,132 INFO L427 BuchiCegarLoop]: ======== Iteration 18============ [2020-11-30 00:48:11,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 113 transitions. [2020-11-30 00:48:11,133 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-30 00:48:11,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:48:11,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:48:11,134 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 5, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:48:11,134 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-30 00:48:11,134 INFO L794 eck$LassoCheckResult]: Stem: 7372#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 7369#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 7365#L565 assume !(main_~array_size~0 < 1); 7366#L565-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;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; 7373#L552-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); 7382#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7383#L552-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); 7380#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7381#L552-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); 7392#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7391#L552-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); 7390#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7389#L552-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); 7385#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7384#L552-3 assume !(lis_~i~0 < lis_~N); 7354#L552-4 lis_~i~0 := 1; 7355#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7377#L555-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; 7424#L556 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; 7420#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 7418#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7415#L555-3 assume !(lis_~j~0 < lis_~i~0); 7375#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 7376#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7378#L555-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; 7430#L556 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; 7428#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 7427#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7426#L555-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; 7417#L556 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; 7422#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 7419#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7416#L555-3 assume !(lis_~j~0 < lis_~i~0); 7414#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 7413#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7412#L555-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; 7411#L556 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; 7409#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 7408#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7407#L555-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; 7406#L556 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; 7404#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 7403#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7402#L555-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; 7398#L556 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; 7400#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 7399#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7397#L555-3 assume !(lis_~j~0 < lis_~i~0); 7396#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 7395#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7370#L555-3 [2020-11-30 00:48:11,134 INFO L796 eck$LassoCheckResult]: Loop: 7370#L555-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; 7356#L556 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; 7357#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 7367#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7370#L555-3 [2020-11-30 00:48:11,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:48:11,135 INFO L82 PathProgramCache]: Analyzing trace with hash 690929080, now seen corresponding path program 5 times [2020-11-30 00:48:11,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:48:11,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444969791] [2020-11-30 00:48:11,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:48:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:11,963 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 49 proven. 52 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-30 00:48:11,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444969791] [2020-11-30 00:48:11,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99178472] [2020-11-30 00:48:11,964 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:48:12,255 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2020-11-30 00:48:12,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:48:12,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 50 conjunts are in the unsatisfiable core [2020-11-30 00:48:12,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:48:12,313 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:48:12,337 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:48:12,337 INFO L384 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 1 case distinctions, treesize of input 39 treesize of output 43 [2020-11-30 00:48:12,337 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:48:12,401 INFO L625 ElimStorePlain]: treesize reduction 16, result has 72.9 percent of original size [2020-11-30 00:48:12,401 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:48:12,402 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:43 [2020-11-30 00:48:12,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:12,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:12,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:12,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:12,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:12,570 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:48:12,576 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:48:12,596 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:48:12,597 INFO L384 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 66 treesize of output 83 [2020-11-30 00:48:12,597 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:48:12,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:12,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:12,606 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:48:12,611 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 29 [2020-11-30 00:48:12,612 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:48:12,738 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2020-11-30 00:48:12,739 INFO L625 ElimStorePlain]: treesize reduction 39, result has 74.0 percent of original size [2020-11-30 00:48:12,739 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-11-30 00:48:12,739 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:156, output treesize:111 [2020-11-30 00:48:13,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:48:13,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,060 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:48:13,126 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 46 [2020-11-30 00:48:13,126 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:48:13,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,177 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:48:13,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,188 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:48:13,189 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:48:13,227 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:48:13,228 INFO L384 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 5 case distinctions, treesize of input 92 treesize of output 123 [2020-11-30 00:48:13,229 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:48:13,443 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2020-11-30 00:48:13,443 INFO L625 ElimStorePlain]: treesize reduction 56, result has 72.9 percent of original size [2020-11-30 00:48:13,444 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-11-30 00:48:13,444 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:196, output treesize:151 [2020-11-30 00:48:13,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:48:13,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,892 INFO L244 Elim1Store]: Index analysis took 114 ms [2020-11-30 00:48:13,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,942 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:48:13,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,956 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:48:13,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:13,959 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:48:13,960 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:48:13,997 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:48:13,998 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 118 treesize of output 163 [2020-11-30 00:48:13,998 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:48:14,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,024 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:48:14,050 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 63 [2020-11-30 00:48:14,051 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:48:14,245 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2020-11-30 00:48:14,245 INFO L625 ElimStorePlain]: treesize reduction 82, result has 70.0 percent of original size [2020-11-30 00:48:14,246 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-11-30 00:48:14,246 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:236, output treesize:191 [2020-11-30 00:48:14,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 12, 1] term [2020-11-30 00:48:14,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:48:14,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:48:14,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,647 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:48:14,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,719 INFO L244 Elim1Store]: Index analysis took 135 ms [2020-11-30 00:48:14,765 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2020-11-30 00:48:14,766 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:48:14,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,848 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:48:14,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,855 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:48:14,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,858 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:48:14,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:14,860 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:48:14,862 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:48:14,900 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:48:14,901 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 17 case distinctions, treesize of input 108 treesize of output 167 [2020-11-30 00:48:14,902 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:48:15,101 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2020-11-30 00:48:15,102 INFO L625 ElimStorePlain]: treesize reduction 74, result has 69.0 percent of original size [2020-11-30 00:48:15,103 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-11-30 00:48:15,104 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:210, output treesize:165 [2020-11-30 00:48:15,687 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-11-30 00:48:15,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:48:15,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:48:16,363 WARN L193 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 79 [2020-11-30 00:48:16,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:48:16,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,472 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:48:16,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,650 INFO L244 Elim1Store]: Index analysis took 242 ms [2020-11-30 00:48:16,865 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-11-30 00:48:16,865 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:48:16,865 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 99 treesize of output 378 [2020-11-30 00:48:16,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:48:16,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:48:16,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:16,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:16,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:48:16,875 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:48:16,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,939 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:48:16,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,964 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:48:16,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,975 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:48:16,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,986 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:48:16,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:48:16,989 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:48:16,993 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:48:18,988 WARN L193 SmtUtils]: Spent 1.99 s on a formula simplification that was a NOOP. DAG size: 239 [2020-11-30 00:48:18,989 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:48:18,990 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 13 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 67 case distinctions, treesize of input 171 treesize of output 1341 [2020-11-30 00:48:18,995 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-11-30 00:48:18,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-30 00:48:18,997 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-11-30 00:48:18,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-30 00:48:18,998 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-30 00:48:18,999 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-30 00:48:19,000 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-30 00:48:19,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:19,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:19,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:48:19,023 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:48:22,914 WARN L193 SmtUtils]: Spent 3.89 s on a formula simplification. DAG size of input: 309 DAG size of output: 130 [2020-11-30 00:48:22,915 INFO L625 ElimStorePlain]: treesize reduction 5695, result has 9.3 percent of original size [2020-11-30 00:48:22,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:22,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:22,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:22,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:22,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:22,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:22,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:22,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:22,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:22,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:22,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:48:22,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:22,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:22,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:22,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:22,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:22,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:48:22,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:22,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:22,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:22,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:22,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:22,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:48:22,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:22,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:22,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:22,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:22,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:22,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:48:22,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:22,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:22,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:22,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:22,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:22,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:22,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:22,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:22,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:22,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:22,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:22,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:22,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:22,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:22,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:22,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:22,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:22,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:22,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:22,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:48:23,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:48:23,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:48:23,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:48:23,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:48:23,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:48:23,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:48:23,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:48:23,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:48:23,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:48:23,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,262 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2020-11-30 00:48:23,262 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:301, output treesize:584 [2020-11-30 00:48:23,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:48:23,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:48:23,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:48:23,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:48:23,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:48:23,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:48:23,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:48:23,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:48:23,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:48:23,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:48:23,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:48:23,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:48:23,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:48:23,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:48:23,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,800 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-11-30 00:48:23,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:48:23,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:23,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-30 00:48:23,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-30 00:48:23,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-30 00:48:23,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:48:23,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-30 00:48:23,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:48:23,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:48:23,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:48:23,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-30 00:48:23,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-30 00:48:23,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-30 00:48:23,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:48:23,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-30 00:48:23,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-30 00:48:23,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-30 00:48:23,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:23,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:48:24,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-30 00:48:24,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-30 00:48:24,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-30 00:48:24,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:48:24,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-30 00:48:24,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:48:24,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:48:24,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:48:24,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-30 00:48:24,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-30 00:48:24,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-30 00:48:24,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:48:24,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-30 00:48:24,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-30 00:48:24,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-30 00:48:24,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:48:24,183 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 00:48:24,220 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2020-11-30 00:49:12,648 WARN L193 SmtUtils]: Spent 44.75 s on a formula simplification. DAG size of input: 1341 DAG size of output: 139 [2020-11-30 00:49:12,660 INFO L603 QuantifierPusher]: Distributing 12 conjuncts over 2 disjuncts [2020-11-30 00:49:18,535 WARN L193 SmtUtils]: Spent 5.41 s on a formula simplification. DAG size of input: 371 DAG size of output: 305 [2020-11-30 00:49:31,148 WARN L193 SmtUtils]: Spent 12.23 s on a formula simplification that was a NOOP. DAG size: 320 [2020-11-30 00:49:40,847 WARN L193 SmtUtils]: Spent 9.22 s on a formula simplification that was a NOOP. DAG size: 322 [2020-11-30 00:49:52,507 WARN L193 SmtUtils]: Spent 10.27 s on a formula simplification that was a NOOP. DAG size: 322 [2020-11-30 00:50:07,241 WARN L193 SmtUtils]: Spent 14.12 s on a formula simplification. DAG size of input: 323 DAG size of output: 265 [2020-11-30 00:50:07,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 7, 10, 1] term [2020-11-30 00:50:07,339 INFO L603 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-11-30 00:50:21,699 WARN L193 SmtUtils]: Spent 13.59 s on a formula simplification that was a NOOP. DAG size: 265 [2020-11-30 00:50:21,706 INFO L603 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-11-30 00:50:22,516 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 64 [2020-11-30 00:50:23,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:50:23,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:50:23,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-30 00:50:23,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-30 00:50:23,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-30 00:50:23,442 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2020-11-30 00:50:23,767 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 37 proven. 76 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 00:50:23,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:50:23,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 27] total 41 [2020-11-30 00:50:23,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768028267] [2020-11-30 00:50:23,768 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:50:23,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:50:23,769 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 13 times [2020-11-30 00:50:23,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:50:23,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686823717] [2020-11-30 00:50:23,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:50:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:50:23,774 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:50:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:50:23,778 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:50:23,779 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:50:24,072 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2020-11-30 00:50:24,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:50:24,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-11-30 00:50:24,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1524, Unknown=0, NotChecked=0, Total=1640 [2020-11-30 00:50:24,157 INFO L87 Difference]: Start difference. First operand 84 states and 113 transitions. cyclomatic complexity: 35 Second operand 41 states. [2020-11-30 00:50:25,132 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2020-11-30 00:50:25,435 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2020-11-30 00:50:25,828 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2020-11-30 00:50:26,184 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2020-11-30 00:50:26,628 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2020-11-30 00:50:26,973 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2020-11-30 00:50:55,845 WARN L193 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2020-11-30 00:50:56,978 WARN L193 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2020-11-30 00:51:14,645 WARN L193 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2020-11-30 00:51:16,056 WARN L193 SmtUtils]: Spent 841.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 65 [2020-11-30 00:51:17,617 WARN L193 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 66 [2020-11-30 00:51:20,352 WARN L193 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 404 DAG size of output: 133 [2020-11-30 00:51:23,280 WARN L193 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 384 DAG size of output: 106 [2020-11-30 00:51:25,816 WARN L193 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 276 DAG size of output: 72 [2020-11-30 00:51:27,397 WARN L193 SmtUtils]: Spent 722.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 64 [2020-11-30 00:51:40,992 WARN L193 SmtUtils]: Spent 12.97 s on a formula simplification. DAG size of input: 354 DAG size of output: 71 [2020-11-30 00:51:54,629 WARN L193 SmtUtils]: Spent 12.88 s on a formula simplification. DAG size of input: 123 DAG size of output: 60 [2020-11-30 00:52:08,780 WARN L193 SmtUtils]: Spent 12.99 s on a formula simplification. DAG size of input: 355 DAG size of output: 72 [2020-11-30 00:52:22,296 WARN L193 SmtUtils]: Spent 12.78 s on a formula simplification. DAG size of input: 123 DAG size of output: 61 [2020-11-30 00:52:25,172 WARN L193 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 104 [2020-11-30 00:52:26,422 WARN L193 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 276 DAG size of output: 72 [2020-11-30 00:52:28,777 WARN L193 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 174 DAG size of output: 78 [2020-11-30 00:52:31,012 WARN L193 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 121 DAG size of output: 75 [2020-11-30 00:52:32,737 WARN L193 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 59 [2020-11-30 00:52:33,995 WARN L193 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 277 DAG size of output: 73 [2020-11-30 00:52:36,012 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 121 DAG size of output: 72 [2020-11-30 00:52:39,486 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2020-11-30 00:52:45,521 WARN L193 SmtUtils]: Spent 3.00 s on a formula simplification. DAG size of input: 401 DAG size of output: 80 [2020-11-30 00:52:46,639 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2020-11-30 00:52:47,692 WARN L193 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 277 DAG size of output: 73 [2020-11-30 00:52:49,859 WARN L193 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 275 DAG size of output: 68 [2020-11-30 00:52:51,484 WARN L193 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 64 [2020-11-30 00:52:52,412 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2020-11-30 00:52:54,517 WARN L193 SmtUtils]: Spent 973.00 ms on a formula simplification. DAG size of input: 351 DAG size of output: 70 [2020-11-30 00:52:56,749 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 127 DAG size of output: 67 [2020-11-30 00:52:57,655 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2020-11-30 00:52:58,859 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2020-11-30 00:52:59,571 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2020-11-30 00:53:02,380 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 352 DAG size of output: 71 [2020-11-30 00:53:04,448 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 127 DAG size of output: 68 [2020-11-30 00:53:08,877 WARN L193 SmtUtils]: Spent 858.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 109 [2020-11-30 00:53:09,789 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2020-11-30 00:53:11,523 WARN L193 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 275 DAG size of output: 68 [2020-11-30 00:53:26,146 WARN L193 SmtUtils]: Spent 13.33 s on a formula simplification. DAG size of input: 183 DAG size of output: 82 [2020-11-30 00:53:28,542 WARN L193 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 125 DAG size of output: 76 [2020-11-30 00:53:30,401 WARN L193 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 67 [2020-11-30 00:53:31,045 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2020-11-30 00:53:32,839 WARN L193 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 276 DAG size of output: 69 [2020-11-30 00:53:35,074 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 125 DAG size of output: 73 [2020-11-30 00:53:42,679 WARN L193 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 276 DAG size of output: 69 [2020-11-30 00:53:43,957 WARN L193 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 330 DAG size of output: 66 [2020-11-30 00:54:01,379 WARN L193 SmtUtils]: Spent 15.04 s on a formula simplification. DAG size of input: 410 DAG size of output: 117 [2020-11-30 00:54:04,661 WARN L193 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2020-11-30 00:54:07,320 WARN L193 SmtUtils]: Spent 904.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2020-11-30 00:54:51,807 WARN L193 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 151 DAG size of output: 97 [2020-11-30 00:54:55,639 WARN L193 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 149 DAG size of output: 81 [2020-11-30 00:55:35,465 WARN L193 SmtUtils]: Spent 5.08 s on a formula simplification. DAG size of input: 376 DAG size of output: 151 [2020-11-30 00:55:40,191 WARN L193 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 335 DAG size of output: 121 [2020-11-30 00:55:46,591 WARN L193 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 352 DAG size of output: 125 [2020-11-30 00:55:47,962 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2020-11-30 00:55:50,164 WARN L193 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2020-11-30 00:56:36,001 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2020-11-30 00:56:40,397 WARN L193 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 280 DAG size of output: 125 [2020-11-30 00:57:55,283 WARN L193 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 280 DAG size of output: 125 [2020-11-30 00:59:33,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:59:33,840 INFO L93 Difference]: Finished difference Result 455 states and 618 transitions. [2020-11-30 00:59:33,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2020-11-30 00:59:33,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 455 states and 618 transitions. [2020-11-30 00:59:33,859 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 44 [2020-11-30 00:59:33,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 455 states to 454 states and 617 transitions. [2020-11-30 00:59:33,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2020-11-30 00:59:33,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2020-11-30 00:59:33,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 454 states and 617 transitions. [2020-11-30 00:59:33,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:59:33,864 INFO L691 BuchiCegarLoop]: Abstraction has 454 states and 617 transitions. [2020-11-30 00:59:33,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states and 617 transitions. [2020-11-30 00:59:33,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 132. [2020-11-30 00:59:33,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-11-30 00:59:33,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 170 transitions. [2020-11-30 00:59:33,873 INFO L714 BuchiCegarLoop]: Abstraction has 132 states and 170 transitions. [2020-11-30 00:59:33,873 INFO L594 BuchiCegarLoop]: Abstraction has 132 states and 170 transitions. [2020-11-30 00:59:33,873 INFO L427 BuchiCegarLoop]: ======== Iteration 19============ [2020-11-30 00:59:33,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 170 transitions. [2020-11-30 00:59:33,873 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-30 00:59:33,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:59:33,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:59:33,874 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:59:33,874 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-30 00:59:33,874 INFO L794 eck$LassoCheckResult]: Stem: 8244#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8241#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 8236#L565 assume !(main_~array_size~0 < 1); 8237#L565-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;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; 8245#L552-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); 8255#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8256#L552-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); 8252#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8253#L552-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); 8262#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8261#L552-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); 8260#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8259#L552-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); 8258#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8257#L552-3 assume !(lis_~i~0 < lis_~N); 8225#L552-4 lis_~i~0 := 1; 8226#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 8249#L555-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; 8322#L556 assume !lis_#t~short11; 8321#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 8320#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8319#L555-3 assume !(lis_~j~0 < lis_~i~0); 8318#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 8317#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 8316#L555-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; 8315#L556 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; 8239#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 8240#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8243#L555-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; 8246#L556 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; 8330#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 8326#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8324#L555-3 assume !(lis_~j~0 < lis_~i~0); 8247#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 8248#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 8352#L555-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; 8351#L556 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; 8301#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 8349#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8348#L555-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; 8334#L556 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; 8331#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 8327#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8325#L555-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; 8284#L556 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; 8288#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 8285#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8283#L555-3 assume !(lis_~j~0 < lis_~i~0); 8282#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 8281#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 8242#L555-3 [2020-11-30 00:59:33,874 INFO L796 eck$LassoCheckResult]: Loop: 8242#L555-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; 8229#L556 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; 8230#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 8238#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8242#L555-3 [2020-11-30 00:59:33,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:59:33,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1906859208, now seen corresponding path program 7 times [2020-11-30 00:59:33,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:59:33,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410395722] [2020-11-30 00:59:33,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:59:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:59:34,245 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2020-11-30 00:59:34,496 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 20 [2020-11-30 00:59:34,792 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 21 [2020-11-30 00:59:35,027 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2020-11-30 00:59:35,332 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2020-11-30 00:59:35,704 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 22 [2020-11-30 00:59:35,951 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2020-11-30 00:59:36,183 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 19 [2020-11-30 00:59:36,673 WARN L193 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2020-11-30 00:59:36,922 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2020-11-30 00:59:37,215 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2020-11-30 00:59:37,670 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2020-11-30 00:59:38,085 WARN L193 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2020-11-30 00:59:38,417 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2020-11-30 00:59:39,089 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 19 proven. 93 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-30 00:59:39,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410395722] [2020-11-30 00:59:39,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524749679] [2020-11-30 00:59:39,090 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366417aa-0c70-4211-b98a-026ac0c973ff/bin/uautomizer/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:59:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:59:39,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 27 conjunts are in the unsatisfiable core [2020-11-30 00:59:39,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:59:39,219 INFO L384 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 14 treesize of output 12 [2020-11-30 00:59:39,223 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:59:39,260 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:59:39,263 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:59:39,264 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:11, output treesize:4 [2020-11-30 00:59:40,111 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2020-11-30 00:59:40,113 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:59:40,114 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 58 [2020-11-30 00:59:40,114 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:59:40,297 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2020-11-30 00:59:40,300 INFO L625 ElimStorePlain]: treesize reduction 32, result has 52.9 percent of original size [2020-11-30 00:59:40,301 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:59:40,301 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:36 [2020-11-30 00:59:42,922 WARN L193 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2020-11-30 00:59:42,925 INFO L350 Elim1Store]: treesize reduction 10, result has 95.0 percent of original size [2020-11-30 00:59:42,925 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 84 treesize of output 221 [2020-11-30 00:59:42,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-11-30 00:59:42,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:59:42,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-11-30 00:59:42,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:59:42,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-11-30 00:59:42,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:59:42,932 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:59:43,564 WARN L193 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 36 [2020-11-30 00:59:43,567 INFO L625 ElimStorePlain]: treesize reduction 309, result has 17.8 percent of original size [2020-11-30 00:59:43,568 INFO L545 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. [2020-11-30 00:59:43,568 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:94, output treesize:67 [2020-11-30 00:59:44,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:59:44,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:59:44,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:59:44,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:59:44,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:59:44,772 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-11-30 00:59:44,878 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 18 proven. 69 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-11-30 00:59:44,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:59:44,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 30 [2020-11-30 00:59:44,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766955552] [2020-11-30 00:59:44,879 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:59:44,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:59:44,879 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 14 times [2020-11-30 00:59:44,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:59:44,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758608278] [2020-11-30 00:59:44,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:59:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:59:44,884 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:59:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:59:44,889 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:59:44,890 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:59:46,418 WARN L193 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2020-11-30 00:59:46,830 WARN L193 SmtUtils]: Spent 403.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-11-30 00:59:46,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:59:46,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-11-30 00:59:46,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=771, Unknown=0, NotChecked=0, Total=870 [2020-11-30 00:59:46,834 INFO L87 Difference]: Start difference. First operand 132 states and 170 transitions. cyclomatic complexity: 47 Second operand 30 states. [2020-11-30 00:59:49,268 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2020-11-30 00:59:49,803 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2020-11-30 00:59:51,936 WARN L193 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 28 [2020-11-30 00:59:52,799 WARN L193 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 29 [2020-11-30 00:59:53,778 WARN L193 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 36 [2020-11-30 00:59:54,375 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2020-11-30 00:59:56,084 WARN L193 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2020-11-30 00:59:56,938 WARN L193 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2020-11-30 00:59:57,999 WARN L193 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2020-11-30 00:59:59,632 WARN L193 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2020-11-30 01:00:00,326 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2020-11-30 01:00:01,761 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2020-11-30 01:00:02,457 WARN L193 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2020-11-30 01:00:03,239 WARN L193 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2020-11-30 01:00:03,758 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2020-11-30 01:00:04,376 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 32 [2020-11-30 01:00:05,938 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2020-11-30 01:00:07,238 WARN L193 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2020-11-30 01:00:07,937 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2020-11-30 01:00:09,362 WARN L193 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2020-11-30 01:00:10,205 WARN L193 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2020-11-30 01:00:11,252 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2020-11-30 01:00:12,319 WARN L193 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2020-11-30 01:00:13,567 WARN L193 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2020-11-30 01:00:14,065 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2020-11-30 01:00:15,622 WARN L193 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2020-11-30 01:00:16,843 WARN L193 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2020-11-30 01:00:17,606 WARN L193 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-11-30 01:00:20,335 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2020-11-30 01:00:20,740 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2020-11-30 01:00:22,136 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2020-11-30 01:00:24,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:00:24,756 INFO L93 Difference]: Finished difference Result 349 states and 464 transitions. [2020-11-30 01:00:24,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-11-30 01:00:24,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 349 states and 464 transitions. [2020-11-30 01:00:24,771 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 21 [2020-11-30 01:00:24,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 349 states to 349 states and 464 transitions. [2020-11-30 01:00:24,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2020-11-30 01:00:24,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2020-11-30 01:00:24,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 349 states and 464 transitions. [2020-11-30 01:00:24,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 01:00:24,775 INFO L691 BuchiCegarLoop]: Abstraction has 349 states and 464 transitions. [2020-11-30 01:00:24,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states and 464 transitions. [2020-11-30 01:00:24,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 224. [2020-11-30 01:00:24,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2020-11-30 01:00:24,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 300 transitions. [2020-11-30 01:00:24,782 INFO L714 BuchiCegarLoop]: Abstraction has 224 states and 300 transitions. [2020-11-30 01:00:24,782 INFO L594 BuchiCegarLoop]: Abstraction has 224 states and 300 transitions. [2020-11-30 01:00:24,782 INFO L427 BuchiCegarLoop]: ======== Iteration 20============ [2020-11-30 01:00:24,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 224 states and 300 transitions. [2020-11-30 01:00:24,784 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-30 01:00:24,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:00:24,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:00:24,785 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 5, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:00:24,785 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-30 01:00:24,785 INFO L794 eck$LassoCheckResult]: Stem: 8979#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8976#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 8971#L565 assume !(main_~array_size~0 < 1); 8972#L565-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;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; 8980#L552-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); 8989#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8990#L552-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); 8987#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8988#L552-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); 8996#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8995#L552-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); 8994#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8993#L552-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); 8992#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8991#L552-3 assume !(lis_~i~0 < lis_~N); 8960#L552-4 lis_~i~0 := 1; 8961#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 8983#L555-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; 9104#L556 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; 9101#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9102#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9097#L555-3 assume !(lis_~j~0 < lis_~i~0); 9098#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 9093#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9094#L555-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; 9089#L556 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; 9088#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9086#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9083#L555-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; 9084#L556 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; 9090#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9150#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9140#L555-3 assume !(lis_~j~0 < lis_~i~0); 8981#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 8982#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9135#L555-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; 9128#L556 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; 9127#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9126#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9125#L555-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; 9123#L556 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; 9124#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9157#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9115#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9113#L556 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; 9111#L556-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9; 9106#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9107#L555-3 assume !(lis_~j~0 < lis_~i~0); 9077#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 9076#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 8977#L555-3 [2020-11-30 01:00:24,786 INFO L796 eck$LassoCheckResult]: Loop: 8977#L555-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; 8962#L556 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; 8963#L556-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem9;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 8973#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8977#L555-3 [2020-11-30 01:00:24,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:00:24,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1549338680, now seen corresponding path program 6 times [2020-11-30 01:00:24,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:00:24,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268818994] [2020-11-30 01:00:24,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:00:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:00:24,998 ERROR L253 erpolLogProxyWrapper]: Interpolant 30 not inductive [2020-11-30 01:00:25,018 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:219) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:876) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:241) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:928) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkStemFeasibility(LassoCheck.java:883) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:797) 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:461) 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:382) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-30 01:00:25,030 INFO L168 Benchmark]: Toolchain (without parser) took 845839.59 ms. Allocated memory was 86.0 MB in the beginning and 383.8 MB in the end (delta: 297.8 MB). Free memory was 54.2 MB in the beginning and 301.0 MB in the end (delta: -246.8 MB). Peak memory consumption was 50.6 MB. Max. memory is 16.1 GB. [2020-11-30 01:00:25,030 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 86.0 MB. Free memory is still 43.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:00:25,036 INFO L168 Benchmark]: CACSL2BoogieTranslator took 566.95 ms. Allocated memory was 86.0 MB in the beginning and 104.9 MB in the end (delta: 18.9 MB). Free memory was 53.9 MB in the beginning and 71.5 MB in the end (delta: -17.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 01:00:25,037 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.97 ms. Allocated memory is still 104.9 MB. Free memory was 71.5 MB in the beginning and 69.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:00:25,039 INFO L168 Benchmark]: Boogie Preprocessor took 45.86 ms. Allocated memory is still 104.9 MB. Free memory was 69.4 MB in the beginning and 68.2 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:00:25,040 INFO L168 Benchmark]: RCFGBuilder took 502.29 ms. Allocated memory is still 104.9 MB. Free memory was 68.2 MB in the beginning and 49.9 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-30 01:00:25,042 INFO L168 Benchmark]: BuchiAutomizer took 844663.35 ms. Allocated memory was 104.9 MB in the beginning and 383.8 MB in the end (delta: 278.9 MB). Free memory was 49.9 MB in the beginning and 301.0 MB in the end (delta: -251.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:00:25,044 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 86.0 MB. Free memory is still 43.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 566.95 ms. Allocated memory was 86.0 MB in the beginning and 104.9 MB in the end (delta: 18.9 MB). Free memory was 53.9 MB in the beginning and 71.5 MB in the end (delta: -17.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 49.97 ms. Allocated memory is still 104.9 MB. Free memory was 71.5 MB in the beginning and 69.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 45.86 ms. Allocated memory is still 104.9 MB. Free memory was 69.4 MB in the beginning and 68.2 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 502.29 ms. Allocated memory is still 104.9 MB. Free memory was 68.2 MB in the beginning and 49.9 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 844663.35 ms. Allocated memory was 104.9 MB in the beginning and 383.8 MB in the end (delta: 278.9 MB). Free memory was 49.9 MB in the beginning and 301.0 MB in the end (delta: -251.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:219) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forcibly destroying the process Received shutdown request...