./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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: OutOfMemoryError: Java heap space --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 15:08:36,994 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:08:36,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:08:37,003 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:08:37,003 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:08:37,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:08:37,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:08:37,006 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:08:37,007 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:08:37,008 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:08:37,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:08:37,009 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:08:37,009 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:08:37,010 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:08:37,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:08:37,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:08:37,012 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:08:37,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:08:37,014 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:08:37,015 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:08:37,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:08:37,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:08:37,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:08:37,018 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:08:37,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:08:37,020 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:08:37,020 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:08:37,021 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:08:37,021 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:08:37,021 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:08:37,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:08:37,022 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:08:37,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:08:37,023 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:08:37,023 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:08:37,024 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:08:37,024 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:08:37,024 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:08:37,024 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:08:37,025 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:08:37,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:08:37,026 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-12-07 15:08:37,037 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:08:37,037 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:08:37,038 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 15:08:37,038 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 15:08:37,038 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 15:08:37,038 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-12-07 15:08:37,038 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-12-07 15:08:37,038 INFO L138 SettingsManager]: * Use old map elimination=false [2019-12-07 15:08:37,039 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-12-07 15:08:37,039 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-12-07 15:08:37,039 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-12-07 15:08:37,039 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:08:37,039 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 15:08:37,039 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:08:37,039 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:08:37,039 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-12-07 15:08:37,040 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-12-07 15:08:37,040 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-12-07 15:08:37,040 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 15:08:37,040 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-12-07 15:08:37,040 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:08:37,040 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-12-07 15:08:37,040 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:08:37,041 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 15:08:37,041 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-12-07 15:08:37,041 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:08:37,041 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 15:08:37,041 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:08:37,041 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-12-07 15:08:37,042 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-12-07 15:08:37,042 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:08:37,139 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:08:37,147 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:08:37,149 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:08:37,150 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:08:37,150 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:08:37,150 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i [2019-12-07 15:08:37,190 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/data/d1822f522/febe55cc976d426687a50bf2e771c526/FLAGde419b5e2 [2019-12-07 15:08:37,528 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:08:37,528 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i [2019-12-07 15:08:37,536 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/data/d1822f522/febe55cc976d426687a50bf2e771c526/FLAGde419b5e2 [2019-12-07 15:08:37,544 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/data/d1822f522/febe55cc976d426687a50bf2e771c526 [2019-12-07 15:08:37,547 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:08:37,547 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:08:37,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:08:37,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:08:37,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:08:37,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:08:37" (1/1) ... [2019-12-07 15:08:37,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@176d3765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:08:37, skipping insertion in model container [2019-12-07 15:08:37,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:08:37" (1/1) ... [2019-12-07 15:08:37,558 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:08:37,582 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:08:37,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:08:37,795 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:08:37,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:08:37,854 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:08:37,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:08:37 WrapperNode [2019-12-07 15:08:37,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:08:37,855 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:08:37,855 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:08:37,855 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:08:37,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:08:37" (1/1) ... [2019-12-07 15:08:37,871 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:08:37" (1/1) ... [2019-12-07 15:08:37,887 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:08:37,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:08:37,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:08:37,887 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:08:37,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:08:37" (1/1) ... [2019-12-07 15:08:37,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:08:37" (1/1) ... [2019-12-07 15:08:37,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:08:37" (1/1) ... [2019-12-07 15:08:37,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:08:37" (1/1) ... [2019-12-07 15:08:37,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:08:37" (1/1) ... [2019-12-07 15:08:37,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:08:37" (1/1) ... [2019-12-07 15:08:37,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:08:37" (1/1) ... [2019-12-07 15:08:37,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:08:37,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:08:37,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:08:37,908 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:08:37,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:08:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:37,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 15:08:37,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 15:08:37,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 15:08:37,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 15:08:37,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:08:37,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:08:38,138 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:08:38,138 INFO L287 CfgBuilder]: Removed 10 assume(true) statements. [2019-12-07 15:08:38,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:08:38 BoogieIcfgContainer [2019-12-07 15:08:38,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:08:38,140 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-12-07 15:08:38,140 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-12-07 15:08:38,142 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-12-07 15:08:38,142 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 15:08:38,142 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 03:08:37" (1/3) ... [2019-12-07 15:08:38,143 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@246d064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 03:08:38, skipping insertion in model container [2019-12-07 15:08:38,143 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 15:08:38,143 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:08:37" (2/3) ... [2019-12-07 15:08:38,143 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@246d064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 03:08:38, skipping insertion in model container [2019-12-07 15:08:38,144 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 15:08:38,144 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:08:38" (3/3) ... [2019-12-07 15:08:38,145 INFO L371 chiAutomizerObserver]: Analyzing ICFG lis-alloca-2.i [2019-12-07 15:08:38,173 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-12-07 15:08:38,173 INFO L357 BuchiCegarLoop]: Hoare is false [2019-12-07 15:08:38,173 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-12-07 15:08:38,173 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:08:38,173 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:08:38,173 INFO L361 BuchiCegarLoop]: Difference is false [2019-12-07 15:08:38,173 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:08:38,173 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-12-07 15:08:38,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-12-07 15:08:38,197 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-12-07 15:08:38,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 15:08:38,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 15:08:38,201 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-12-07 15:08:38,201 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 15:08:38,201 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-12-07 15:08:38,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-12-07 15:08:38,203 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-12-07 15:08:38,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 15:08:38,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 15:08:38,203 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-12-07 15:08:38,203 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 15:08:38,208 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 [2019-12-07 15:08:38,208 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 [2019-12-07 15:08:38,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:38,212 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-12-07 15:08:38,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:38,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972715679] [2019-12-07 15:08:38,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:38,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:38,312 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:08:38,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:38,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-12-07 15:08:38,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:38,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010939114] [2019-12-07 15:08:38,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:38,327 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:08:38,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:38,329 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-12-07 15:08:38,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:38,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646574093] [2019-12-07 15:08:38,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:38,367 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:08:38,621 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-12-07 15:08:38,714 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 15:08:38,714 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 15:08:38,714 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 15:08:38,714 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 15:08:38,714 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 15:08:38,714 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:38,715 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 15:08:38,715 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 15:08:38,715 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration1_Lasso [2019-12-07 15:08:38,715 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 15:08:38,715 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 15:08:38,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:38,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:38,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:38,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:38,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:38,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:38,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:38,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:38,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:38,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:38,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:38,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:38,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:38,925 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-12-07 15:08:38,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:38,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:38,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:38,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:39,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:39,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:39,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:39,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:39,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:39,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:39,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:39,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:39,335 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 15:08:39,338 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:39,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:39,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:39,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:39,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:39,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:39,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:39,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:39,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:39,348 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:39,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:39,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:39,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:39,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:39,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:39,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:08:39,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:08:39,360 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:39,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:39,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:39,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:39,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:39,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:39,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:39,366 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:39,366 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:39,367 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:39,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:39,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:39,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:39,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:39,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:39,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:08:39,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:08:39,377 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:39,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:39,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:39,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:39,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:39,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:39,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:39,383 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:39,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:39,384 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:39,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:39,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:39,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:39,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:39,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:39,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:39,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:39,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:39,392 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:39,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:39,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:39,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:39,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:39,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:39,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:08:39,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:08:39,402 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:39,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:39,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:39,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:39,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:39,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:39,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:39,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:39,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:39,418 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:39,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:39,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:39,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:39,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:39,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:39,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:39,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:39,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:39,429 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:39,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:39,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:39,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:39,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:39,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:39,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:39,436 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:39,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:39,438 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:39,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:39,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:39,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:39,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:39,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:39,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:39,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:39,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:39,445 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:39,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:39,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:39,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:39,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:39,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:39,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:39,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:39,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:39,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_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:39,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:39,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:39,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:39,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:39,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:39,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:39,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:39,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:39,460 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:39,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:39,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:39,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:39,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:39,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:39,467 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:08:39,467 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:08:39,469 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:39,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:39,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:39,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:39,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:39,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:39,483 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:08:39,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:08:39,504 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 15:08:39,544 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2019-12-07 15:08:39,544 INFO L444 ModelExtractionUtils]: 23 out of 43 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:39,548 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 15:08:39,557 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-12-07 15:08:39,558 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 15:08:39,558 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_lis_~prev~0.base)_1, ULTIMATE.start_lis_~i~0) = 1*v_rep(select #length ULTIMATE.start_lis_~prev~0.base)_1 - 4*ULTIMATE.start_lis_~i~0 Supporting invariants [1*ULTIMATE.start_lis_~best~0.offset >= 0] [2019-12-07 15:08:39,605 INFO L297 tatePredicateManager]: 15 out of 17 supporting invariants were superfluous and have been removed [2019-12-07 15:08:39,615 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 15:08:39,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:08:39,655 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 15:08:39,656 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:08:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:08:39,665 INFO L264 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 15:08:39,665 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:08:39,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:08:39,689 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-12-07 15:08:39,690 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 3 states. [2019-12-07 15:08:39,749 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 3 states. Result 41 states and 64 transitions. Complement of second has 8 states. [2019-12-07 15:08:39,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-12-07 15:08:39,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 15:08:39,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2019-12-07 15:08:39,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 2 letters. [2019-12-07 15:08:39,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 15:08:39,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 6 letters. Loop has 2 letters. [2019-12-07 15:08:39,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 15:08:39,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 4 letters. [2019-12-07 15:08:39,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 15:08:39,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 64 transitions. [2019-12-07 15:08:39,758 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-12-07 15:08:39,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 18 states and 28 transitions. [2019-12-07 15:08:39,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-12-07 15:08:39,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-12-07 15:08:39,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 28 transitions. [2019-12-07 15:08:39,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 15:08:39,764 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2019-12-07 15:08:39,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 28 transitions. [2019-12-07 15:08:39,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-12-07 15:08:39,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-12-07 15:08:39,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2019-12-07 15:08:39,787 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2019-12-07 15:08:39,787 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2019-12-07 15:08:39,787 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-12-07 15:08:39,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2019-12-07 15:08:39,787 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-12-07 15:08:39,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 15:08:39,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 15:08:39,788 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-12-07 15:08:39,788 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 15:08:39,788 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 [2019-12-07 15:08:39,788 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 [2019-12-07 15:08:39,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:39,788 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-12-07 15:08:39,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:39,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971515798] [2019-12-07 15:08:39,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:08:39,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:08:39,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971515798] [2019-12-07 15:08:39,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:08:39,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:08:39,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438428497] [2019-12-07 15:08:39,831 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 15:08:39,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:39,831 INFO L82 PathProgramCache]: Analyzing trace with hash 60785, now seen corresponding path program 1 times [2019-12-07 15:08:39,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:39,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521052355] [2019-12-07 15:08:39,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:39,836 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:08:39,850 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 15:08:39,850 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 15:08:39,850 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 15:08:39,850 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 15:08:39,850 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-12-07 15:08:39,850 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:39,850 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 15:08:39,850 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 15:08:39,850 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration2_Loop [2019-12-07 15:08:39,850 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 15:08:39,850 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 15:08:39,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:39,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:39,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:39,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:39,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:39,893 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 15:08:39,894 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:39,897 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 15:08:39,898 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 15:08:39,902 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 15:08:39,902 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_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:39,907 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 15:08:39,907 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 15:08:39,911 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 15:08:39,911 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_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:39,916 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 15:08:39,916 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:39,923 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-12-07 15:08:39,923 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 15:08:40,022 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-12-07 15:08:40,023 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 15:08:40,023 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 15:08:40,024 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 15:08:40,024 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 15:08:40,024 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 15:08:40,024 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:40,024 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 15:08:40,024 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 15:08:40,024 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration2_Loop [2019-12-07 15:08:40,024 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 15:08:40,024 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 15:08:40,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:40,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:40,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:40,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:40,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:40,070 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 15:08:40,070 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:40,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:40,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:40,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:40,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:40,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:40,075 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:08:40,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:08:40,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:40,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:40,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:40,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:40,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:40,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:40,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:08:40,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:08:40,088 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:40,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:40,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:40,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:40,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:40,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:40,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:40,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:40,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:40,097 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 15:08:40,099 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-12-07 15:08:40,100 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:08:40,102 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 15:08:40,102 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-12-07 15:08:40,102 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 15:08:40,102 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0) = -2*ULTIMATE.start_lis_~i~0 + 1 Supporting invariants [] [2019-12-07 15:08:40,104 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-12-07 15:08:40,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:08:40,133 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 15:08:40,133 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:08:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:08:40,137 WARN L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 15:08:40,137 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:08:40,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:08:40,159 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-12-07 15:08:40,160 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13 Second operand 4 states. [2019-12-07 15:08:40,211 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 49 states and 84 transitions. Complement of second has 10 states. [2019-12-07 15:08:40,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-12-07 15:08:40,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-12-07 15:08:40,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2019-12-07 15:08:40,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 6 letters. Loop has 3 letters. [2019-12-07 15:08:40,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 15:08:40,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 9 letters. Loop has 3 letters. [2019-12-07 15:08:40,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 15:08:40,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 6 letters. Loop has 6 letters. [2019-12-07 15:08:40,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 15:08:40,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 84 transitions. [2019-12-07 15:08:40,217 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-12-07 15:08:40,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 37 states and 57 transitions. [2019-12-07 15:08:40,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-12-07 15:08:40,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-12-07 15:08:40,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 57 transitions. [2019-12-07 15:08:40,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 15:08:40,219 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 57 transitions. [2019-12-07 15:08:40,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 57 transitions. [2019-12-07 15:08:40,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2019-12-07 15:08:40,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 15:08:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2019-12-07 15:08:40,222 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 45 transitions. [2019-12-07 15:08:40,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:08:40,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:08:40,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:08:40,226 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand 4 states. [2019-12-07 15:08:40,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:08:40,260 INFO L93 Difference]: Finished difference Result 30 states and 45 transitions. [2019-12-07 15:08:40,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:08:40,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 45 transitions. [2019-12-07 15:08:40,261 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-12-07 15:08:40,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 45 transitions. [2019-12-07 15:08:40,262 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-12-07 15:08:40,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-12-07 15:08:40,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 45 transitions. [2019-12-07 15:08:40,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 15:08:40,262 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 45 transitions. [2019-12-07 15:08:40,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 45 transitions. [2019-12-07 15:08:40,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-12-07 15:08:40,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 15:08:40,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 44 transitions. [2019-12-07 15:08:40,264 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 44 transitions. [2019-12-07 15:08:40,264 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 44 transitions. [2019-12-07 15:08:40,264 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-12-07 15:08:40,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 44 transitions. [2019-12-07 15:08:40,265 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-12-07 15:08:40,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 15:08:40,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 15:08:40,265 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:08:40,265 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:08:40,266 INFO L794 eck$LassoCheckResult]: Stem: 383#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 380#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 376#L565 assume !(main_~array_size~0 < 1); 377#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; 384#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); 392#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 393#L552-3 assume !(lis_~i~0 < lis_~N); 367#L552-4 lis_~i~0 := 1; 368#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 385#L555-3 [2019-12-07 15:08:40,266 INFO L796 eck$LassoCheckResult]: Loop: 385#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; 369#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; 370#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 378#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 381#L555-3 assume !(lis_~j~0 < lis_~i~0); 387#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 388#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 385#L555-3 [2019-12-07 15:08:40,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:40,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2019-12-07 15:08:40,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:40,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31933274] [2019-12-07 15:08:40,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:08:40,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:08:40,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31933274] [2019-12-07 15:08:40,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878738495] [2019-12-07 15:08:40,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:08:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:08:40,331 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 15:08:40,331 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:08:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:08:40,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:08:40,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-07 15:08:40,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414494178] [2019-12-07 15:08:40,343 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 15:08:40,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:40,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 1 times [2019-12-07 15:08:40,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:40,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568816903] [2019-12-07 15:08:40,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:40,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:40,370 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:08:40,535 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 85 [2019-12-07 15:08:40,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:08:40,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 15:08:40,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 15:08:40,585 INFO L87 Difference]: Start difference. First operand 29 states and 44 transitions. cyclomatic complexity: 19 Second operand 8 states. [2019-12-07 15:08:40,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:08:40,659 INFO L93 Difference]: Finished difference Result 59 states and 84 transitions. [2019-12-07 15:08:40,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:08:40,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 84 transitions. [2019-12-07 15:08:40,661 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-12-07 15:08:40,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 51 states and 74 transitions. [2019-12-07 15:08:40,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-12-07 15:08:40,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-12-07 15:08:40,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 74 transitions. [2019-12-07 15:08:40,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 15:08:40,662 INFO L688 BuchiCegarLoop]: Abstraction has 51 states and 74 transitions. [2019-12-07 15:08:40,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 74 transitions. [2019-12-07 15:08:40,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 31. [2019-12-07 15:08:40,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 15:08:40,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2019-12-07 15:08:40,664 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2019-12-07 15:08:40,664 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2019-12-07 15:08:40,664 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-12-07 15:08:40,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2019-12-07 15:08:40,665 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-12-07 15:08:40,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 15:08:40,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 15:08:40,665 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:08:40,665 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:08:40,665 INFO L794 eck$LassoCheckResult]: Stem: 510#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 507#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; 503#L565 assume !(main_~array_size~0 < 1); 504#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; 511#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); 521#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 522#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); 518#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 519#L552-3 assume !(lis_~i~0 < lis_~N); 494#L552-4 lis_~i~0 := 1; 495#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 512#L555-3 [2019-12-07 15:08:40,665 INFO L796 eck$LassoCheckResult]: Loop: 512#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; 496#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; 497#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 505#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 508#L555-3 assume !(lis_~j~0 < lis_~i~0); 514#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 515#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 512#L555-3 [2019-12-07 15:08:40,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:40,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 2 times [2019-12-07 15:08:40,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:40,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864676709] [2019-12-07 15:08:40,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:40,702 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:08:40,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:40,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 2 times [2019-12-07 15:08:40,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:40,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036863586] [2019-12-07 15:08:40,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:40,724 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:08:40,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:40,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1776402153, now seen corresponding path program 1 times [2019-12-07 15:08:40,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:40,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415280149] [2019-12-07 15:08:40,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:08:40,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:08:40,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415280149] [2019-12-07 15:08:40,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097814703] [2019-12-07 15:08:40,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:08:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:08:40,809 INFO L264 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 15:08:40,810 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:08:40,852 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 15:08:40,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:08:40,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-12-07 15:08:40,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696983605] [2019-12-07 15:08:41,021 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 86 [2019-12-07 15:08:41,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:08:41,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 15:08:41,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-07 15:08:41,078 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. cyclomatic complexity: 18 Second operand 14 states. [2019-12-07 15:08:41,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:08:41,263 INFO L93 Difference]: Finished difference Result 106 states and 151 transitions. [2019-12-07 15:08:41,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 15:08:41,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 151 transitions. [2019-12-07 15:08:41,265 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 25 [2019-12-07 15:08:41,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 87 states and 126 transitions. [2019-12-07 15:08:41,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2019-12-07 15:08:41,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2019-12-07 15:08:41,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 126 transitions. [2019-12-07 15:08:41,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 15:08:41,266 INFO L688 BuchiCegarLoop]: Abstraction has 87 states and 126 transitions. [2019-12-07 15:08:41,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 126 transitions. [2019-12-07 15:08:41,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 39. [2019-12-07 15:08:41,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 15:08:41,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2019-12-07 15:08:41,269 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2019-12-07 15:08:41,269 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2019-12-07 15:08:41,269 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-12-07 15:08:41,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 56 transitions. [2019-12-07 15:08:41,270 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-12-07 15:08:41,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 15:08:41,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 15:08:41,270 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:08:41,271 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 15:08:41,271 INFO L794 eck$LassoCheckResult]: Stem: 734#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 730#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; 726#L565 assume !(main_~array_size~0 < 1); 727#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; 735#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); 745#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 746#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); 747#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 752#L552-3 assume !(lis_~i~0 < lis_~N); 751#L552-4 lis_~i~0 := 1; 743#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 732#L555-3 [2019-12-07 15:08:41,271 INFO L796 eck$LassoCheckResult]: Loop: 732#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; 755#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; 754#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 731#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 732#L555-3 [2019-12-07 15:08:41,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:41,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 3 times [2019-12-07 15:08:41,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:41,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848273645] [2019-12-07 15:08:41,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:41,297 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:08:41,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:41,297 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 1 times [2019-12-07 15:08:41,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:41,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266513992] [2019-12-07 15:08:41,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:41,311 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:08:41,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:41,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1166707861, now seen corresponding path program 1 times [2019-12-07 15:08:41,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:41,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124606777] [2019-12-07 15:08:41,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:41,349 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:08:41,484 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2019-12-07 15:08:41,874 WARN L192 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 117 [2019-12-07 15:08:42,011 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-07 15:08:42,013 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 15:08:42,013 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 15:08:42,013 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 15:08:42,013 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 15:08:42,013 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 15:08:42,013 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:42,013 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 15:08:42,013 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 15:08:42,013 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration5_Lasso [2019-12-07 15:08:42,013 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 15:08:42,013 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 15:08:42,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:42,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:42,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:42,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:42,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:42,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:42,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:42,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:42,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:42,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:42,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:42,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:42,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:42,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:42,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:42,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:42,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:42,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:42,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:42,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:42,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:42,756 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 100 [2019-12-07 15:08:42,963 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 94 [2019-12-07 15:08:42,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:42,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:42,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:43,149 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 72 [2019-12-07 15:08:43,489 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 15:08:43,490 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:43,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:43,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:43,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:43,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:43,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:43,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:08:43,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:08:43,500 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:43,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:43,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:43,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:43,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:43,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:43,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:43,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:43,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:43,508 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:43,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:43,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:43,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:43,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:43,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:43,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:43,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:43,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:43,516 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:43,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:43,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:43,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:43,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:43,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:43,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:43,524 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:43,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:43,525 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:43,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:43,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:43,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:43,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:43,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:43,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:43,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:43,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:43,534 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:43,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:43,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:43,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:43,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:43,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:43,542 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:08:43,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:08:43,545 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:43,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:43,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:43,550 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:43,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:43,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:43,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:43,551 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:43,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:43,552 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:43,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:43,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:43,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:43,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:43,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:43,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:43,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:43,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:43,561 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:43,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:43,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:43,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:43,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:43,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:43,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:08:43,570 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:08:43,574 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:43,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:43,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:43,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:43,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:43,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:43,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:08:43,582 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:08:43,586 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:43,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 [2019-12-07 15:08:43,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:43,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:43,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:43,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:43,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:43,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:43,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:43,594 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:43,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:43,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:43,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:43,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:43,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:43,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:43,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:43,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:43,603 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:43,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:43,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:43,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:43,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:43,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:43,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:08:43,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:08:43,615 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:43,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:43,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:43,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:43,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:43,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:43,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:43,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:43,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:43,623 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:43,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:43,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:43,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:43,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:43,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:43,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:43,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:43,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:43,632 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:43,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:43,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:43,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:43,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:43,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:43,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:43,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:43,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:43,641 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:43,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:43,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:43,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:43,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:43,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:43,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:43,647 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:43,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:43,648 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:43,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:43,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:43,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:43,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:43,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:43,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:43,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:43,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:43,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_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:43,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:43,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:43,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:43,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:43,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:43,661 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:08:43,661 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:08:43,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:43,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:43,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:43,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:43,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:43,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:43,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:43,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:43,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:43,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_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:08:43,673 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:43,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:43,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:43,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:43,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:43,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:08:43,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:08:43,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:08:43,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:43,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:43,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:43,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:43,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:43,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:08:43,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:08:43,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:08:43,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:43,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:43,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:43,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:43,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:43,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:08:43,707 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:08:43,730 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 15:08:43,779 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2019-12-07 15:08:43,779 INFO L444 ModelExtractionUtils]: 46 out of 64 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:43,781 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 15:08:43,784 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 15:08:43,785 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 15:08:43,785 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_~i~0) = -2*ULTIMATE.start_lis_~j~0 + 1*ULTIMATE.start_lis_~i~0 Supporting invariants [] [2019-12-07 15:08:43,948 INFO L297 tatePredicateManager]: 43 out of 45 supporting invariants were superfluous and have been removed [2019-12-07 15:08:43,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:08:43,981 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 15:08:43,982 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:08:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:08:44,007 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 15:08:44,008 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:08:44,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:08:44,022 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-12-07 15:08:44,022 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 56 transitions. cyclomatic complexity: 22 Second operand 5 states. [2019-12-07 15:08:44,068 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 56 transitions. cyclomatic complexity: 22. Second operand 5 states. Result 65 states and 98 transitions. Complement of second has 9 states. [2019-12-07 15:08:44,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2019-12-07 15:08:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-12-07 15:08:44,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2019-12-07 15:08:44,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 11 letters. Loop has 4 letters. [2019-12-07 15:08:44,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 15:08:44,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 15 letters. Loop has 4 letters. [2019-12-07 15:08:44,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 15:08:44,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 11 letters. Loop has 8 letters. [2019-12-07 15:08:44,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 15:08:44,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 98 transitions. [2019-12-07 15:08:44,072 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-12-07 15:08:44,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 46 states and 67 transitions. [2019-12-07 15:08:44,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-12-07 15:08:44,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-12-07 15:08:44,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 67 transitions. [2019-12-07 15:08:44,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 15:08:44,073 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-12-07 15:08:44,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 67 transitions. [2019-12-07 15:08:44,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2019-12-07 15:08:44,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 15:08:44,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2019-12-07 15:08:44,076 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 55 transitions. [2019-12-07 15:08:44,076 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 55 transitions. [2019-12-07 15:08:44,076 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-12-07 15:08:44,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 55 transitions. [2019-12-07 15:08:44,076 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-12-07 15:08:44,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 15:08:44,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 15:08:44,077 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:08:44,077 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:08:44,078 INFO L794 eck$LassoCheckResult]: Stem: 1098#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1094#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; 1090#L565 assume !(main_~array_size~0 < 1); 1091#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; 1099#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); 1109#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1110#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); 1111#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1115#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); 1113#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1112#L552-3 assume !(lis_~i~0 < lis_~N); 1081#L552-4 lis_~i~0 := 1; 1082#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1102#L555-3 assume !(lis_~j~0 < lis_~i~0); 1103#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1116#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1114#L555-3 [2019-12-07 15:08:44,078 INFO L796 eck$LassoCheckResult]: Loop: 1114#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; 1083#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; 1084#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 1092#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1095#L555-3 assume !(lis_~j~0 < lis_~i~0); 1104#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1105#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1114#L555-3 [2019-12-07 15:08:44,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:44,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1270630400, now seen corresponding path program 1 times [2019-12-07 15:08:44,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:44,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455552737] [2019-12-07 15:08:44,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:08:44,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 15:08:44,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455552737] [2019-12-07 15:08:44,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:08:44,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:08:44,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768159894] [2019-12-07 15:08:44,109 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 15:08:44,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:44,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 3 times [2019-12-07 15:08:44,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:44,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782544500] [2019-12-07 15:08:44,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:44,123 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:08:44,274 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-12-07 15:08:44,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:08:44,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:08:44,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:08:44,320 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. cyclomatic complexity: 22 Second operand 4 states. [2019-12-07 15:08:44,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:08:44,345 INFO L93 Difference]: Finished difference Result 51 states and 75 transitions. [2019-12-07 15:08:44,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:08:44,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 75 transitions. [2019-12-07 15:08:44,346 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-12-07 15:08:44,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 75 transitions. [2019-12-07 15:08:44,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-12-07 15:08:44,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-12-07 15:08:44,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 75 transitions. [2019-12-07 15:08:44,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 15:08:44,347 INFO L688 BuchiCegarLoop]: Abstraction has 51 states and 75 transitions. [2019-12-07 15:08:44,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 75 transitions. [2019-12-07 15:08:44,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2019-12-07 15:08:44,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 15:08:44,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2019-12-07 15:08:44,349 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2019-12-07 15:08:44,349 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2019-12-07 15:08:44,349 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-12-07 15:08:44,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 56 transitions. [2019-12-07 15:08:44,349 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-12-07 15:08:44,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 15:08:44,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 15:08:44,350 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:08:44,350 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:08:44,350 INFO L794 eck$LassoCheckResult]: Stem: 1193#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1190#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; 1186#L565 assume !(main_~array_size~0 < 1); 1187#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; 1194#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); 1204#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1205#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); 1206#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1210#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); 1208#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1207#L552-3 assume !(lis_~i~0 < lis_~N); 1177#L552-4 lis_~i~0 := 1; 1178#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1195#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; 1196#L556 assume !lis_#t~short11; 1215#L556-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7; 1214#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1213#L555-3 assume !(lis_~j~0 < lis_~i~0); 1198#L554-2 [2019-12-07 15:08:44,350 INFO L796 eck$LassoCheckResult]: Loop: 1198#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1199#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1209#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; 1179#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; 1180#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 1188#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1191#L555-3 assume !(lis_~j~0 < lis_~i~0); 1198#L554-2 [2019-12-07 15:08:44,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:44,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1306611794, now seen corresponding path program 1 times [2019-12-07 15:08:44,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:44,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884203062] [2019-12-07 15:08:44,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:44,370 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:08:44,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:44,371 INFO L82 PathProgramCache]: Analyzing trace with hash 828228918, now seen corresponding path program 4 times [2019-12-07 15:08:44,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:44,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111587677] [2019-12-07 15:08:44,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:44,379 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:08:44,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:44,380 INFO L82 PathProgramCache]: Analyzing trace with hash -257841211, now seen corresponding path program 1 times [2019-12-07 15:08:44,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:44,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294774442] [2019-12-07 15:08:44,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:08:44,428 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 15:08:44,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294774442] [2019-12-07 15:08:44,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721276416] [2019-12-07 15:08:44,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:08:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:08:44,469 INFO L264 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 15:08:44,471 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:08:44,502 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 15:08:44,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:08:44,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-12-07 15:08:44,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829724368] [2019-12-07 15:08:44,670 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-12-07 15:08:44,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:08:44,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 15:08:44,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-12-07 15:08:44,713 INFO L87 Difference]: Start difference. First operand 39 states and 56 transitions. cyclomatic complexity: 22 Second operand 12 states. [2019-12-07 15:08:44,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:08:44,799 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2019-12-07 15:08:44,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 15:08:44,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 82 transitions. [2019-12-07 15:08:44,799 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-12-07 15:08:44,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 37 states and 51 transitions. [2019-12-07 15:08:44,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-12-07 15:08:44,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-12-07 15:08:44,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 51 transitions. [2019-12-07 15:08:44,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 15:08:44,800 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2019-12-07 15:08:44,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 51 transitions. [2019-12-07 15:08:44,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2019-12-07 15:08:44,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 15:08:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2019-12-07 15:08:44,802 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2019-12-07 15:08:44,802 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2019-12-07 15:08:44,802 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-12-07 15:08:44,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 45 transitions. [2019-12-07 15:08:44,802 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-12-07 15:08:44,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 15:08:44,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 15:08:44,803 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:08:44,803 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2019-12-07 15:08:44,803 INFO L794 eck$LassoCheckResult]: Stem: 1385#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1381#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; 1377#L565 assume !(main_~array_size~0 < 1); 1378#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; 1386#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); 1390#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1391#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); 1393#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1396#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); 1395#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1394#L552-3 assume !(lis_~i~0 < lis_~N); 1368#L552-4 lis_~i~0 := 1; 1369#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1389#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; 1372#L556 assume !lis_#t~short11; 1373#L556-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7; 1380#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1384#L555-3 assume !(lis_~j~0 < lis_~i~0); 1387#L554-2 [2019-12-07 15:08:44,803 INFO L796 eck$LassoCheckResult]: Loop: 1387#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1388#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1397#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; 1400#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; 1399#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 1382#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1383#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; 1370#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; 1371#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 1379#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1398#L555-3 assume !(lis_~j~0 < lis_~i~0); 1387#L554-2 [2019-12-07 15:08:44,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:44,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1306611794, now seen corresponding path program 2 times [2019-12-07 15:08:44,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:44,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765477702] [2019-12-07 15:08:44,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:44,821 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:08:44,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:44,822 INFO L82 PathProgramCache]: Analyzing trace with hash 370948975, now seen corresponding path program 5 times [2019-12-07 15:08:44,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:44,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145656728] [2019-12-07 15:08:44,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:44,835 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:08:44,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:44,836 INFO L82 PathProgramCache]: Analyzing trace with hash -193053058, now seen corresponding path program 2 times [2019-12-07 15:08:44,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:44,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152882656] [2019-12-07 15:08:44,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:08:45,374 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:08:45,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152882656] [2019-12-07 15:08:45,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263110652] [2019-12-07 15:08:45,374 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:08:45,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 15:08:45,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:08:45,413 INFO L264 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-07 15:08:45,414 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:08:45,438 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:08:45,439 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-12-07 15:08:45,439 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:08:45,445 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:08:45,445 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:08:45,445 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2019-12-07 15:08:45,480 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2019-12-07 15:08:45,480 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:08:45,487 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:08:45,487 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:08:45,487 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2019-12-07 15:08:45,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:08:45,542 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 15:08:45,542 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 43 [2019-12-07 15:08:45,543 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:08:45,550 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:08:45,550 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:08:45,550 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:44 [2019-12-07 15:08:45,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:08:45,754 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:08:45,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:08:45,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:08:45,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:08:45,784 INFO L343 Elim1Store]: treesize reduction 12, result has 86.8 percent of original size [2019-12-07 15:08:45,785 INFO L377 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 138 [2019-12-07 15:08:45,785 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:08:45,817 INFO L614 ElimStorePlain]: treesize reduction 69, result has 52.1 percent of original size [2019-12-07 15:08:45,818 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 15:08:45,818 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:128, output treesize:75 [2019-12-07 15:08:45,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:08:45,954 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 15:08:45,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:08:45,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 31 [2019-12-07 15:08:45,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744898416] [2019-12-07 15:08:46,329 WARN L192 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 117 [2019-12-07 15:08:46,448 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-07 15:08:46,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:08:46,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 15:08:46,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2019-12-07 15:08:46,449 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. cyclomatic complexity: 16 Second operand 31 states. [2019-12-07 15:08:48,840 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-12-07 15:08:50,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:08:50,497 INFO L93 Difference]: Finished difference Result 144 states and 197 transitions. [2019-12-07 15:08:50,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-07 15:08:50,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 197 transitions. [2019-12-07 15:08:50,499 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 73 [2019-12-07 15:08:50,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 144 states and 197 transitions. [2019-12-07 15:08:50,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 127 [2019-12-07 15:08:50,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 127 [2019-12-07 15:08:50,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 197 transitions. [2019-12-07 15:08:50,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 15:08:50,502 INFO L688 BuchiCegarLoop]: Abstraction has 144 states and 197 transitions. [2019-12-07 15:08:50,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 197 transitions. [2019-12-07 15:08:50,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 87. [2019-12-07 15:08:50,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-12-07 15:08:50,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 123 transitions. [2019-12-07 15:08:50,507 INFO L711 BuchiCegarLoop]: Abstraction has 87 states and 123 transitions. [2019-12-07 15:08:50,507 INFO L591 BuchiCegarLoop]: Abstraction has 87 states and 123 transitions. [2019-12-07 15:08:50,507 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-12-07 15:08:50,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 123 transitions. [2019-12-07 15:08:50,507 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 45 [2019-12-07 15:08:50,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 15:08:50,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 15:08:50,508 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:08:50,508 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 15:08:50,508 INFO L794 eck$LassoCheckResult]: Stem: 1762#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1757#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; 1751#L565 assume !(main_~array_size~0 < 1); 1752#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; 1763#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); 1775#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1776#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); 1773#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1774#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); 1778#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1777#L552-3 assume !(lis_~i~0 < lis_~N); 1741#L552-4 lis_~i~0 := 1; 1742#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1780#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; 1767#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; 1779#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 1760#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1761#L555-3 assume !(lis_~j~0 < lis_~i~0); 1792#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1770#L554-3 assume !(lis_~i~0 < lis_~N); 1771#L554-4 lis_~i~0 := 0; 1749#L558-3 [2019-12-07 15:08:50,508 INFO L796 eck$LassoCheckResult]: Loop: 1749#L558-3 assume !!(lis_~i~0 < lis_~N);call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4); 1750#L559 assume lis_~max~0 < lis_#t~mem14;havoc lis_#t~mem14;call lis_#t~mem15 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);lis_~max~0 := lis_#t~mem15;havoc lis_#t~mem15; 1748#L558-2 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 1749#L558-3 [2019-12-07 15:08:50,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:50,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1848859483, now seen corresponding path program 1 times [2019-12-07 15:08:50,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:50,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608905478] [2019-12-07 15:08:50,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:08:50,596 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:08:50,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608905478] [2019-12-07 15:08:50,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340179409] [2019-12-07 15:08:50,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:08:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:08:50,628 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 15:08:50,629 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:08:50,671 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 15:08:50,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:08:50,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-12-07 15:08:50,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289447138] [2019-12-07 15:08:50,671 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 15:08:50,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:50,672 INFO L82 PathProgramCache]: Analyzing trace with hash 97415, now seen corresponding path program 1 times [2019-12-07 15:08:50,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:50,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539090335] [2019-12-07 15:08:50,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:50,675 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:08:50,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:08:50,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 15:08:50,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-12-07 15:08:50,697 INFO L87 Difference]: Start difference. First operand 87 states and 123 transitions. cyclomatic complexity: 43 Second operand 16 states. [2019-12-07 15:08:50,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:08:50,978 INFO L93 Difference]: Finished difference Result 109 states and 151 transitions. [2019-12-07 15:08:50,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 15:08:50,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 151 transitions. [2019-12-07 15:08:50,980 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 55 [2019-12-07 15:08:50,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 109 states and 151 transitions. [2019-12-07 15:08:50,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2019-12-07 15:08:50,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2019-12-07 15:08:50,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 151 transitions. [2019-12-07 15:08:50,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 15:08:50,983 INFO L688 BuchiCegarLoop]: Abstraction has 109 states and 151 transitions. [2019-12-07 15:08:50,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 151 transitions. [2019-12-07 15:08:50,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2019-12-07 15:08:50,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-12-07 15:08:50,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2019-12-07 15:08:50,989 INFO L711 BuchiCegarLoop]: Abstraction has 87 states and 121 transitions. [2019-12-07 15:08:50,989 INFO L591 BuchiCegarLoop]: Abstraction has 87 states and 121 transitions. [2019-12-07 15:08:50,989 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-12-07 15:08:50,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 121 transitions. [2019-12-07 15:08:50,990 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 45 [2019-12-07 15:08:50,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 15:08:50,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 15:08:50,991 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:08:50,991 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2019-12-07 15:08:50,992 INFO L794 eck$LassoCheckResult]: Stem: 2050#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2045#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; 2041#L565 assume !(main_~array_size~0 < 1); 2042#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; 2051#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); 2059#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2060#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); 2062#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2067#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); 2064#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2063#L552-3 assume !(lis_~i~0 < lis_~N); 2030#L552-4 lis_~i~0 := 1; 2031#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2070#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; 2035#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; 2036#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 2048#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2049#L555-3 assume !(lis_~j~0 < lis_~i~0); 2055#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2056#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2091#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; 2032#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; 2033#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 2046#L555-2 [2019-12-07 15:08:50,992 INFO L796 eck$LassoCheckResult]: Loop: 2046#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2047#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; 2052#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; 2078#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 2096#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2095#L555-3 assume !(lis_~j~0 < lis_~i~0); 2068#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2069#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2088#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; 2089#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; 2115#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 2046#L555-2 [2019-12-07 15:08:50,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:50,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1362538132, now seen corresponding path program 2 times [2019-12-07 15:08:50,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:50,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388881607] [2019-12-07 15:08:50,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:51,040 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:08:51,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:51,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1272183771, now seen corresponding path program 6 times [2019-12-07 15:08:51,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:51,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033617933] [2019-12-07 15:08:51,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:51,060 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:08:51,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:51,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1715897192, now seen corresponding path program 3 times [2019-12-07 15:08:51,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:51,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572912493] [2019-12-07 15:08:51,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:08:51,139 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 15:08:51,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572912493] [2019-12-07 15:08:51,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613465009] [2019-12-07 15:08:51,140 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:08:51,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 15:08:51,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:08:51,232 INFO L264 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 15:08:51,234 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:08:51,336 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 15:08:51,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:08:51,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2019-12-07 15:08:51,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345449318] [2019-12-07 15:08:52,030 WARN L192 SmtUtils]: Spent 691.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 129 [2019-12-07 15:08:52,237 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-12-07 15:08:52,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:08:52,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 15:08:52,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-12-07 15:08:52,238 INFO L87 Difference]: Start difference. First operand 87 states and 121 transitions. cyclomatic complexity: 41 Second operand 19 states. [2019-12-07 15:08:52,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:08:52,630 INFO L93 Difference]: Finished difference Result 151 states and 204 transitions. [2019-12-07 15:08:52,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 15:08:52,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 204 transitions. [2019-12-07 15:08:52,631 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 60 [2019-12-07 15:08:52,632 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 136 states and 184 transitions. [2019-12-07 15:08:52,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 110 [2019-12-07 15:08:52,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2019-12-07 15:08:52,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 184 transitions. [2019-12-07 15:08:52,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 15:08:52,633 INFO L688 BuchiCegarLoop]: Abstraction has 136 states and 184 transitions. [2019-12-07 15:08:52,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 184 transitions. [2019-12-07 15:08:52,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 114. [2019-12-07 15:08:52,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-07 15:08:52,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 156 transitions. [2019-12-07 15:08:52,637 INFO L711 BuchiCegarLoop]: Abstraction has 114 states and 156 transitions. [2019-12-07 15:08:52,637 INFO L591 BuchiCegarLoop]: Abstraction has 114 states and 156 transitions. [2019-12-07 15:08:52,637 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-12-07 15:08:52,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 156 transitions. [2019-12-07 15:08:52,637 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 50 [2019-12-07 15:08:52,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 15:08:52,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 15:08:52,638 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:08:52,638 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 15:08:52,638 INFO L794 eck$LassoCheckResult]: Stem: 2438#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2434#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; 2429#L565 assume !(main_~array_size~0 < 1); 2430#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; 2439#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); 2448#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2449#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); 2450#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2466#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); 2465#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2464#L552-3 assume !(lis_~i~0 < lis_~N); 2419#L552-4 lis_~i~0 := 1; 2420#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2475#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; 2474#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; 2471#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 2472#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2532#L555-3 assume !(lis_~j~0 < lis_~i~0); 2531#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2446#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2435#L555-3 [2019-12-07 15:08:52,638 INFO L796 eck$LassoCheckResult]: Loop: 2435#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; 2440#L556 assume !lis_#t~short11; 2422#L556-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7; 2431#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2435#L555-3 [2019-12-07 15:08:52,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:52,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1464380025, now seen corresponding path program 4 times [2019-12-07 15:08:52,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:52,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336905170] [2019-12-07 15:08:52,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:52,676 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:08:52,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:52,677 INFO L82 PathProgramCache]: Analyzing trace with hash 2129256, now seen corresponding path program 1 times [2019-12-07 15:08:52,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:52,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326113464] [2019-12-07 15:08:52,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:52,682 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:08:52,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:52,682 INFO L82 PathProgramCache]: Analyzing trace with hash -710988832, now seen corresponding path program 3 times [2019-12-07 15:08:52,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:52,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061460717] [2019-12-07 15:08:52,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:52,719 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:08:54,479 WARN L192 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 251 DAG size of output: 176 [2019-12-07 15:08:55,145 WARN L192 SmtUtils]: Spent 661.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-12-07 15:08:55,148 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 15:08:55,148 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 15:08:55,148 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 15:08:55,149 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 15:08:55,149 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 15:08:55,149 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:55,149 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 15:08:55,149 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 15:08:55,149 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration11_Lasso [2019-12-07 15:08:55,149 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 15:08:55,149 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 15:08:55,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:55,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:55,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:55,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:55,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:55,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:55,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:55,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:55,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:55,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:55,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:55,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:55,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:55,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:55,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:55,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:56,012 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 107 [2019-12-07 15:08:56,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:56,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:56,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:56,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:56,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:56,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:56,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:08:56,293 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-12-07 15:08:56,547 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 15:08:56,547 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:56,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:56,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:56,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:56,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:56,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:56,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:56,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:56,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:56,553 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:56,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:56,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:56,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:56,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:56,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:56,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:56,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:56,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:56,559 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:56,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:56,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:56,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:56,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:56,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:56,565 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:08:56,565 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:08:56,567 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:56,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:56,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:56,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:56,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:56,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:56,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:56,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:56,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:56,574 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:56,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:56,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:56,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:56,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:56,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:56,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:08:56,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:08:56,581 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:56,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:56,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:56,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:56,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:56,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:56,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:56,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:56,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:56,587 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:56,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 [2019-12-07 15:08:56,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:56,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:56,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:56,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:56,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:56,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:56,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:56,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_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:56,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:56,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:56,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:56,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:56,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:56,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:56,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:56,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:56,599 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:56,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:56,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:56,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:56,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:56,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:56,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:56,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:56,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:56,605 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:56,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:56,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:56,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:56,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:56,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:56,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:56,610 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:56,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:56,611 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:56,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:56,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:56,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:56,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:56,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:56,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:56,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:56,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:56,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:08:56,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:56,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:56,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:56,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:56,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:56,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:56,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:56,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:56,623 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:08:56,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:56,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:56,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:56,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:56,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:56,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:08:56,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:08:56,631 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:56,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:56,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:56,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:56,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:56,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:56,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:56,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:56,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:56,641 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:56,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:56,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:56,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:08:56,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:56,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:56,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:56,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:08:56,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:08:56,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:56,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:56,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:56,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:56,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:56,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:56,656 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:08:56,656 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:08:56,660 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:08:56,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:08:56,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:08:56,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:08:56,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:08:56,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:08:56,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:08:56,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:08:56,692 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 15:08:56,760 INFO L443 ModelExtractionUtils]: Simplification made 37 calls to the SMT solver. [2019-12-07 15:08:56,760 INFO L444 ModelExtractionUtils]: 18 out of 61 variables were initially zero. Simplification set additionally 38 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:08:56,762 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 15:08:56,764 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-12-07 15:08:56,764 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 15:08:56,764 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0, v_rep(select #length ULTIMATE.start_lis_#t~malloc3.base)_3) = -2*ULTIMATE.start_lis_~j~0 + 1*v_rep(select #length ULTIMATE.start_lis_#t~malloc3.base)_3 Supporting invariants [1*v_rep(select #length ULTIMATE.start_lis_#t~malloc3.base)_3 - 3 >= 0] [2019-12-07 15:08:57,021 INFO L297 tatePredicateManager]: 61 out of 65 supporting invariants were superfluous and have been removed [2019-12-07 15:08:57,027 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 15:08:57,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:08:57,066 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 15:08:57,067 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:08:57,106 INFO L343 Elim1Store]: treesize reduction 31, result has 52.3 percent of original size [2019-12-07 15:08:57,106 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 41 [2019-12-07 15:08:57,106 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:08:57,132 INFO L614 ElimStorePlain]: treesize reduction 12, result has 77.8 percent of original size [2019-12-07 15:08:57,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:08:57,136 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 15:08:57,136 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:44 [2019-12-07 15:08:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:08:57,264 INFO L264 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 15:08:57,264 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:08:57,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:08:57,285 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2019-12-07 15:08:57,285 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 114 states and 156 transitions. cyclomatic complexity: 50 Second operand 9 states. [2019-12-07 15:08:57,425 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 114 states and 156 transitions. cyclomatic complexity: 50. Second operand 9 states. Result 115 states and 158 transitions. Complement of second has 8 states. [2019-12-07 15:08:57,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 6 stem states 0 non-accepting loop states 1 accepting loop states [2019-12-07 15:08:57,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-12-07 15:08:57,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-12-07 15:08:57,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 20 letters. Loop has 4 letters. [2019-12-07 15:08:57,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 15:08:57,426 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 15:08:57,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:08:57,463 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 15:08:57,464 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:08:57,492 INFO L343 Elim1Store]: treesize reduction 31, result has 52.3 percent of original size [2019-12-07 15:08:57,493 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 41 [2019-12-07 15:08:57,493 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:08:57,520 INFO L614 ElimStorePlain]: treesize reduction 12, result has 77.8 percent of original size [2019-12-07 15:08:57,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:08:57,521 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 15:08:57,522 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:44 [2019-12-07 15:08:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:08:57,661 INFO L264 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 15:08:57,661 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:08:57,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:08:57,681 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 [2019-12-07 15:08:57,681 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 114 states and 156 transitions. cyclomatic complexity: 50 Second operand 9 states. [2019-12-07 15:08:57,826 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 114 states and 156 transitions. cyclomatic complexity: 50. Second operand 9 states. Result 115 states and 158 transitions. Complement of second has 8 states. [2019-12-07 15:08:57,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 6 stem states 0 non-accepting loop states 1 accepting loop states [2019-12-07 15:08:57,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-12-07 15:08:57,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-12-07 15:08:57,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 20 letters. Loop has 4 letters. [2019-12-07 15:08:57,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 15:08:57,827 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 15:08:57,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:08:57,866 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 15:08:57,867 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:08:57,899 INFO L343 Elim1Store]: treesize reduction 31, result has 52.3 percent of original size [2019-12-07 15:08:57,900 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 41 [2019-12-07 15:08:57,900 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:08:57,928 INFO L614 ElimStorePlain]: treesize reduction 12, result has 77.8 percent of original size [2019-12-07 15:08:57,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:08:57,930 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 15:08:57,930 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:44 [2019-12-07 15:08:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:08:58,112 INFO L264 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 15:08:58,113 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:08:58,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:08:58,134 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2019-12-07 15:08:58,135 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 114 states and 156 transitions. cyclomatic complexity: 50 Second operand 11 states. [2019-12-07 15:08:58,687 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 114 states and 156 transitions. cyclomatic complexity: 50. Second operand 11 states. Result 171 states and 243 transitions. Complement of second has 18 states. [2019-12-07 15:08:58,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 12 stem states 2 non-accepting loop states 2 accepting loop states [2019-12-07 15:08:58,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-12-07 15:08:58,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 66 transitions. [2019-12-07 15:08:58,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 66 transitions. Stem has 20 letters. Loop has 4 letters. [2019-12-07 15:08:58,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 15:08:58,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 66 transitions. Stem has 24 letters. Loop has 4 letters. [2019-12-07 15:08:58,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 15:08:58,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 66 transitions. Stem has 20 letters. Loop has 8 letters. [2019-12-07 15:08:58,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 15:08:58,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 243 transitions. [2019-12-07 15:08:58,689 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 40 [2019-12-07 15:08:58,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 112 states and 155 transitions. [2019-12-07 15:08:58,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2019-12-07 15:08:58,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2019-12-07 15:08:58,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 155 transitions. [2019-12-07 15:08:58,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 15:08:58,691 INFO L688 BuchiCegarLoop]: Abstraction has 112 states and 155 transitions. [2019-12-07 15:08:58,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 155 transitions. [2019-12-07 15:08:58,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 103. [2019-12-07 15:08:58,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-12-07 15:08:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 143 transitions. [2019-12-07 15:08:58,693 INFO L711 BuchiCegarLoop]: Abstraction has 103 states and 143 transitions. [2019-12-07 15:08:58,693 INFO L591 BuchiCegarLoop]: Abstraction has 103 states and 143 transitions. [2019-12-07 15:08:58,693 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-12-07 15:08:58,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 143 transitions. [2019-12-07 15:08:58,694 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 40 [2019-12-07 15:08:58,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 15:08:58,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 15:08:58,695 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:08:58,695 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2019-12-07 15:08:58,695 INFO L794 eck$LassoCheckResult]: Stem: 3548#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3543#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; 3538#L565 assume !(main_~array_size~0 < 1); 3539#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; 3549#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); 3555#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3556#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); 3558#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3565#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); 3564#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3563#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); 3560#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3559#L552-3 assume !(lis_~i~0 < lis_~N); 3527#L552-4 lis_~i~0 := 1; 3528#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3576#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; 3577#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; 3609#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 3574#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3568#L555-3 assume !(lis_~j~0 < lis_~i~0); 3569#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3554#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3550#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; 3532#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; 3533#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 3597#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3598#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; 3612#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; 3617#L556-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7; 3614#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3611#L555-3 assume !(lis_~j~0 < lis_~i~0); 3606#L554-2 [2019-12-07 15:08:58,695 INFO L796 eck$LassoCheckResult]: Loop: 3606#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3561#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3562#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; 3529#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; 3530#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 3540#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3595#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; 3590#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; 3591#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 3615#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3613#L555-3 assume !(lis_~j~0 < lis_~i~0); 3606#L554-2 [2019-12-07 15:08:58,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:58,695 INFO L82 PathProgramCache]: Analyzing trace with hash 209134494, now seen corresponding path program 1 times [2019-12-07 15:08:58,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:58,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003321926] [2019-12-07 15:08:58,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:08:59,303 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 15:08:59,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003321926] [2019-12-07 15:08:59,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917166158] [2019-12-07 15:08:59,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:08:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:08:59,342 INFO L264 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 15:08:59,343 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:08:59,349 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:08:59,349 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-12-07 15:08:59,349 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:08:59,353 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:08:59,354 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:08:59,354 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:8 [2019-12-07 15:08:59,420 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:08:59,420 INFO L377 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 [2019-12-07 15:08:59,420 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:08:59,434 INFO L614 ElimStorePlain]: treesize reduction 32, result has 52.9 percent of original size [2019-12-07 15:08:59,434 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:08:59,434 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:36 [2019-12-07 15:08:59,599 INFO L343 Elim1Store]: treesize reduction 10, result has 95.0 percent of original size [2019-12-07 15:08:59,600 INFO L377 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 [2019-12-07 15:08:59,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:08:59,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:08:59,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:08:59,602 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:08:59,648 INFO L614 ElimStorePlain]: treesize reduction 308, result has 17.9 percent of original size [2019-12-07 15:08:59,649 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 15:08:59,649 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:94, output treesize:67 [2019-12-07 15:08:59,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:08:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 15:08:59,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:08:59,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 25 [2019-12-07 15:08:59,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420474796] [2019-12-07 15:08:59,734 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 15:08:59,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:08:59,734 INFO L82 PathProgramCache]: Analyzing trace with hash 370948975, now seen corresponding path program 7 times [2019-12-07 15:08:59,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:08:59,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813560861] [2019-12-07 15:08:59,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:08:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:08:59,755 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:09:00,148 WARN L192 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 117 [2019-12-07 15:09:00,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:09:00,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 15:09:00,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2019-12-07 15:09:00,249 INFO L87 Difference]: Start difference. First operand 103 states and 143 transitions. cyclomatic complexity: 49 Second operand 25 states. [2019-12-07 15:09:00,926 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-12-07 15:09:02,004 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-12-07 15:09:02,201 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-12-07 15:09:02,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:09:02,728 INFO L93 Difference]: Finished difference Result 169 states and 230 transitions. [2019-12-07 15:09:02,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 15:09:02,728 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 230 transitions. [2019-12-07 15:09:02,729 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 85 [2019-12-07 15:09:02,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 169 states and 230 transitions. [2019-12-07 15:09:02,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2019-12-07 15:09:02,730 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2019-12-07 15:09:02,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 230 transitions. [2019-12-07 15:09:02,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 15:09:02,731 INFO L688 BuchiCegarLoop]: Abstraction has 169 states and 230 transitions. [2019-12-07 15:09:02,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 230 transitions. [2019-12-07 15:09:02,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 145. [2019-12-07 15:09:02,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-12-07 15:09:02,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 201 transitions. [2019-12-07 15:09:02,734 INFO L711 BuchiCegarLoop]: Abstraction has 145 states and 201 transitions. [2019-12-07 15:09:02,734 INFO L591 BuchiCegarLoop]: Abstraction has 145 states and 201 transitions. [2019-12-07 15:09:02,734 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-12-07 15:09:02,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 145 states and 201 transitions. [2019-12-07 15:09:02,734 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 81 [2019-12-07 15:09:02,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 15:09:02,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 15:09:02,735 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:09:02,735 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2019-12-07 15:09:02,735 INFO L794 eck$LassoCheckResult]: Stem: 3984#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3979#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; 3973#L565 assume !(main_~array_size~0 < 1); 3974#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; 3985#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); 3994#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3995#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); 3996#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4001#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); 4000#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3999#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); 3998#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3997#L552-3 assume !(lis_~i~0 < lis_~N); 3963#L552-4 lis_~i~0 := 1; 3964#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4014#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; 4012#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; 4010#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 4008#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4004#L555-3 assume !(lis_~j~0 < lis_~i~0); 4005#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3991#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3992#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; 4026#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; 4027#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 4035#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4034#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; 4033#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; 4030#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 3978#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4056#L555-3 assume !(lis_~j~0 < lis_~i~0); 4055#L554-2 [2019-12-07 15:09:02,736 INFO L796 eck$LassoCheckResult]: Loop: 4055#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 4054#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4053#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; 4051#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; 4049#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 4048#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4047#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; 4045#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; 4040#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 4041#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4057#L555-3 assume !(lis_~j~0 < lis_~i~0); 4055#L554-2 [2019-12-07 15:09:02,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:09:02,736 INFO L82 PathProgramCache]: Analyzing trace with hash 209132572, now seen corresponding path program 5 times [2019-12-07 15:09:02,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:09:02,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949647907] [2019-12-07 15:09:02,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:09:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:09:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:09:02,782 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:09:02,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:09:02,782 INFO L82 PathProgramCache]: Analyzing trace with hash 370948975, now seen corresponding path program 8 times [2019-12-07 15:09:02,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:09:02,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932471076] [2019-12-07 15:09:02,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:09:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:09:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:09:02,791 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:09:02,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:09:02,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1491595148, now seen corresponding path program 6 times [2019-12-07 15:09:02,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:09:02,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856704734] [2019-12-07 15:09:02,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:09:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:09:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 32 proven. 24 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 15:09:02,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856704734] [2019-12-07 15:09:02,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615574533] [2019-12-07 15:09:02,864 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:09:02,934 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-07 15:09:02,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:09:02,935 INFO L264 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 15:09:02,936 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:09:02,974 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 49 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-07 15:09:02,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:09:02,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2019-12-07 15:09:02,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744119448] [2019-12-07 15:09:03,383 WARN L192 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 117 [2019-12-07 15:09:03,513 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-07 15:09:03,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:09:03,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 15:09:03,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-12-07 15:09:03,514 INFO L87 Difference]: Start difference. First operand 145 states and 201 transitions. cyclomatic complexity: 66 Second operand 16 states. [2019-12-07 15:09:03,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:09:03,685 INFO L93 Difference]: Finished difference Result 198 states and 274 transitions. [2019-12-07 15:09:03,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 15:09:03,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 274 transitions. [2019-12-07 15:09:03,686 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 131 [2019-12-07 15:09:03,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 198 states and 274 transitions. [2019-12-07 15:09:03,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 152 [2019-12-07 15:09:03,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2019-12-07 15:09:03,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 274 transitions. [2019-12-07 15:09:03,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 15:09:03,688 INFO L688 BuchiCegarLoop]: Abstraction has 198 states and 274 transitions. [2019-12-07 15:09:03,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 274 transitions. [2019-12-07 15:09:03,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 102. [2019-12-07 15:09:03,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 15:09:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 138 transitions. [2019-12-07 15:09:03,690 INFO L711 BuchiCegarLoop]: Abstraction has 102 states and 138 transitions. [2019-12-07 15:09:03,690 INFO L591 BuchiCegarLoop]: Abstraction has 102 states and 138 transitions. [2019-12-07 15:09:03,690 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-12-07 15:09:03,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 138 transitions. [2019-12-07 15:09:03,690 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 43 [2019-12-07 15:09:03,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 15:09:03,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 15:09:03,691 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:09:03,691 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 1, 1, 1] [2019-12-07 15:09:03,691 INFO L794 eck$LassoCheckResult]: Stem: 4482#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 4478#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; 4473#L565 assume !(main_~array_size~0 < 1); 4474#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; 4483#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); 4495#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4496#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); 4492#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4493#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); 4502#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4499#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); 4498#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4497#L552-3 assume !(lis_~i~0 < lis_~N); 4462#L552-4 lis_~i~0 := 1; 4463#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4515#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; 4514#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; 4512#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 4509#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4505#L555-3 assume !(lis_~j~0 < lis_~i~0); 4503#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 4504#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4516#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; 4517#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; 4520#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 4521#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4531#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; 4529#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; 4518#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 4519#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4524#L555-3 assume !(lis_~j~0 < lis_~i~0); 4523#L554-2 [2019-12-07 15:09:03,691 INFO L796 eck$LassoCheckResult]: Loop: 4523#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 4500#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4501#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; 4540#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; 4541#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 4550#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4549#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; 4547#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; 4545#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 4546#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4484#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; 4485#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; 4534#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 4533#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4522#L555-3 assume !(lis_~j~0 < lis_~i~0); 4523#L554-2 [2019-12-07 15:09:03,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:09:03,692 INFO L82 PathProgramCache]: Analyzing trace with hash 209132572, now seen corresponding path program 7 times [2019-12-07 15:09:03,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:09:03,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754609285] [2019-12-07 15:09:03,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:09:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:09:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:09:03,737 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:09:03,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:09:03,737 INFO L82 PathProgramCache]: Analyzing trace with hash -304943832, now seen corresponding path program 9 times [2019-12-07 15:09:03,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:09:03,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642159566] [2019-12-07 15:09:03,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:09:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:09:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:09:03,757 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:09:03,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:09:03,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1126348717, now seen corresponding path program 8 times [2019-12-07 15:09:03,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:09:03,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408306227] [2019-12-07 15:09:03,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:09:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:09:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:09:03,834 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:09:04,960 WARN L192 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 208 DAG size of output: 150 [2019-12-07 15:09:05,168 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-12-07 15:09:13,235 WARN L192 SmtUtils]: Spent 8.06 s on a formula simplification. DAG size of input: 406 DAG size of output: 252 [2019-12-07 15:09:18,011 WARN L192 SmtUtils]: Spent 4.77 s on a formula simplification that was a NOOP. DAG size: 164 [2019-12-07 15:09:18,014 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 15:09:18,014 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 15:09:18,015 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 15:09:18,015 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 15:09:18,015 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 15:09:18,015 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:09:18,015 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 15:09:18,015 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 15:09:18,015 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration14_Lasso [2019-12-07 15:09:18,015 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 15:09:18,015 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 15:09:18,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:18,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:18,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:18,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:18,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:18,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:18,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:18,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:18,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:18,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:18,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:18,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:18,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:18,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:18,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:18,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:18,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:18,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:18,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:18,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:25,265 WARN L192 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 130 [2019-12-07 15:09:26,243 WARN L192 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 288 DAG size of output: 144 [2019-12-07 15:09:26,362 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-12-07 15:09:26,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:26,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:26,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:26,630 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-12-07 15:09:26,976 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-12-07 15:09:27,056 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 15:09:27,056 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:09:27,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:09:27,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,061 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:09:27,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:09:27,062 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:09:27,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:09:27,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:09:27,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:09:27,074 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:09:27,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:09:27,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:09:27,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:09:27,080 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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) Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:09:27,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,086 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:09:27,086 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:09:27,088 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:09:27,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:09:27,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:09:27,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:09:27,094 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:09:27,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:09:27,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:09:27,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:09:27,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_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:09:27,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:09:27,105 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:09:27,107 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:09:27,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:09:27,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:09:27,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:09:27,113 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:09:27,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:09:27,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:09:27,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:09:27,120 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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) Waiting until toolchain timeout for monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:09:27,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:09:27,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:09:27,128 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:09:27,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:09:27,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:09:27,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:09:27,133 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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) Waiting until toolchain timeout for monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:09:27,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,138 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:09:27,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,138 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:09:27,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:09:27,139 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:09:27,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,144 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:09:27,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:09:27,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:09:27,145 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:09:27,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:09:27,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:09:27,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:09:27,152 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:09:27,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,157 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:09:27,157 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:09:27,159 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:09:27,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:09:27,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:09:27,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:09:27,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_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:09:27,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:09:27,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,171 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:09:27,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:09:27,172 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:09:27,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:09:27,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:09: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_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:09:27,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:09:27,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:09:27,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:09:27,188 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:09:27,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,196 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:09:27,196 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:09:27,203 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:09:27,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,210 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:09:27,210 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:09: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_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:09:27,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,220 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:09:27,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:09:27,224 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:09:27,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,229 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:09:27,229 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:09:27,232 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:09: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 [2019-12-07 15:09:27,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,237 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:09:27,238 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:09: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_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:09:27,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:09:27,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:09:27,257 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:09:27,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,263 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:09:27,263 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:09:27,267 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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 [2019-12-07 15:09:27,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,273 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:09:27,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:09:27,277 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/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) Waiting until toolchain timeout for monitored process 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:09:27,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,285 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:09:27,285 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:09:27,289 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 104 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 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:09:27,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:09:27,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:09:27,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:09:27,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:09:27,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:09:27,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:09:27,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:09:27,314 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 15:09:27,402 INFO L443 ModelExtractionUtils]: Simplification made 36 calls to the SMT solver. [2019-12-07 15:09:27,402 INFO L444 ModelExtractionUtils]: 1 out of 28 variables were initially zero. Simplification set additionally 20 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 105 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 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:09:27,405 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 15:09:27,407 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-12-07 15:09:27,407 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 15:09:27,407 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ (* ULTIMATE.start_lis_~i~0 4) ULTIMATE.start_lis_~best~0.offset))_1, v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ (* ULTIMATE.start_lis_~i~0 4) ULTIMATE.start_lis_~best~0.offset (- 4)))_2) = 5*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ (* ULTIMATE.start_lis_~i~0 4) ULTIMATE.start_lis_~best~0.offset))_1 - 7*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ (* ULTIMATE.start_lis_~i~0 4) ULTIMATE.start_lis_~best~0.offset (- 4)))_2 Supporting invariants [-3*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset (* ULTIMATE.start_lis_~j~0 4) (- 8)))_1 - 3*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ (* ULTIMATE.start_lis_~i~0 4) ULTIMATE.start_lis_~best~0.offset (- 4)))_2 + 2*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 8))_2 + 3*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 12))_1 >= 0] [2019-12-07 15:09:28,914 INFO L297 tatePredicateManager]: 108 out of 111 supporting invariants were superfluous and have been removed [2019-12-07 15:09:28,924 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 15:09:28,924 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 15:09:28,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:09:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:09:28,976 INFO L264 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 15:09:28,977 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:09:28,981 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-12-07 15:09:28,981 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:28,985 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:09:28,985 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:09:28,985 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2019-12-07 15:09:29,000 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2019-12-07 15:09:29,000 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:29,006 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:09:29,006 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:09:29,006 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:31 [2019-12-07 15:09:29,057 INFO L343 Elim1Store]: treesize reduction 78, result has 24.3 percent of original size [2019-12-07 15:09:29,057 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 55 [2019-12-07 15:09:29,058 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:29,066 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:09:29,066 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:09:29,067 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:57 [2019-12-07 15:09:29,173 INFO L343 Elim1Store]: treesize reduction 20, result has 87.6 percent of original size [2019-12-07 15:09:29,173 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 175 [2019-12-07 15:09:29,173 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:29,211 INFO L614 ElimStorePlain]: treesize reduction 108, result has 36.8 percent of original size [2019-12-07 15:09:29,212 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:09:29,212 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:63 [2019-12-07 15:09:29,321 INFO L343 Elim1Store]: treesize reduction 208, result has 19.7 percent of original size [2019-12-07 15:09:29,322 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 84 treesize of output 87 [2019-12-07 15:09:29,322 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:29,334 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:09:29,334 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:09:29,334 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:89, output treesize:74 [2019-12-07 15:09:29,614 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 88 [2019-12-07 15:09:29,614 INFO L343 Elim1Store]: treesize reduction 132, result has 69.8 percent of original size [2019-12-07 15:09:29,614 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 120 treesize of output 353 [2019-12-07 15:09:29,615 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:29,673 INFO L614 ElimStorePlain]: treesize reduction 280, result has 24.1 percent of original size [2019-12-07 15:09:29,673 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:09:29,673 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:128, output treesize:89 [2019-12-07 15:09:30,075 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 114 [2019-12-07 15:09:30,076 INFO L343 Elim1Store]: treesize reduction 132, result has 75.6 percent of original size [2019-12-07 15:09:30,076 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 25 case distinctions, treesize of input 136 treesize of output 458 [2019-12-07 15:09:30,077 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:30,157 INFO L614 ElimStorePlain]: treesize reduction 412, result has 19.2 percent of original size [2019-12-07 15:09:30,157 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:09:30,157 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:147, output treesize:98 [2019-12-07 15:09:30,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:30,522 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 98 [2019-12-07 15:09:30,522 INFO L343 Elim1Store]: treesize reduction 138, result has 72.8 percent of original size [2019-12-07 15:09:30,522 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 24 case distinctions, treesize of input 140 treesize of output 419 [2019-12-07 15:09:30,524 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:30,594 INFO L614 ElimStorePlain]: treesize reduction 315, result has 22.6 percent of original size [2019-12-07 15:09:30,594 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:09:30,595 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:151, output treesize:92 [2019-12-07 15:09:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:09:30,736 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 15:09:30,737 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:09:30,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,062 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 64 [2019-12-07 15:09:31,062 INFO L343 Elim1Store]: treesize reduction 409, result has 34.1 percent of original size [2019-12-07 15:09:31,063 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 151 treesize of output 263 [2019-12-07 15:09:31,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,075 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:31,196 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 83 [2019-12-07 15:09:31,197 INFO L614 ElimStorePlain]: treesize reduction 706, result has 27.2 percent of original size [2019-12-07 15:09:31,197 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:09:31,197 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:158, output treesize:264 [2019-12-07 15:09:31,532 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-12-07 15:09:31,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:31,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:31,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:31,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:31,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:31,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:31,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:31,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:31,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:31,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:31,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:31,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:31,820 INFO L237 Elim1Store]: Index analysis took 264 ms [2019-12-07 15:09:32,285 WARN L192 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-12-07 15:09:32,286 INFO L343 Elim1Store]: treesize reduction 12, result has 94.9 percent of original size [2019-12-07 15:09:32,287 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 13 case distinctions, treesize of input 188 treesize of output 339 [2019-12-07 15:09:32,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:32,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:32,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:32,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:32,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:32,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:32,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:32,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:32,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:32,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:32,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:32,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:32,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:32,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:32,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:32,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:32,313 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:09:32,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,448 INFO L237 Elim1Store]: Index analysis took 115 ms [2019-12-07 15:09:32,494 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:09:32,494 INFO L377 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 6 case distinctions, treesize of input 174 treesize of output 240 [2019-12-07 15:09:32,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:32,496 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:32,504 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:32,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,517 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:32,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,613 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:09:32,613 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 174 treesize of output 217 [2019-12-07 15:09:32,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:32,614 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:32,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:32,790 INFO L237 Elim1Store]: Index analysis took 166 ms [2019-12-07 15:09:33,001 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 111 [2019-12-07 15:09:33,001 INFO L343 Elim1Store]: treesize reduction 12, result has 96.4 percent of original size [2019-12-07 15:09:33,002 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 12 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 20 case distinctions, treesize of input 185 treesize of output 446 [2019-12-07 15:09:33,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,009 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:33,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:33,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:33,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:33,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:33,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:33,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:33,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:33,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:33,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:33,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:33,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:33,130 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:09:33,130 INFO L377 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 11 case distinctions, treesize of input 171 treesize of output 321 [2019-12-07 15:09:33,132 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:33,139 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:33,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:33,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:33,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:33,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:33,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:33,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:33,247 INFO L343 Elim1Store]: treesize reduction 12, result has 94.4 percent of original size [2019-12-07 15:09:33,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 13 case distinctions, treesize of input 188 treesize of output 306 [2019-12-07 15:09:33,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:33,258 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:09:33,732 WARN L192 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 280 DAG size of output: 96 [2019-12-07 15:09:33,733 INFO L614 ElimStorePlain]: treesize reduction 3150, result has 12.5 percent of original size [2019-12-07 15:09:33,734 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-07 15:09:33,734 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:1161, output treesize:412 [2019-12-07 15:09:34,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:34,306 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 [2019-12-07 15:09:34,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:34,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:34,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:34,315 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 15:09:34,315 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:34,318 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 15:09:34,318 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:34,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:34,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:34,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:34,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:34,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:34,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:34,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:34,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:34,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:34,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:34,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:34,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:34,334 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:34,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:34,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:34,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:34,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:34,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:34,366 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:34,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:34,555 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-12-07 15:09:34,555 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:09:34,556 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 17 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 186 treesize of output 227 [2019-12-07 15:09:34,560 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:34,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:34,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:34,583 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:34,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:34,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:34,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:34,594 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:34,611 INFO L377 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 78 [2019-12-07 15:09:34,613 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:35,056 WARN L192 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 73 [2019-12-07 15:09:35,057 INFO L614 ElimStorePlain]: treesize reduction 197, result has 57.5 percent of original size [2019-12-07 15:09:35,058 INFO L534 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. [2019-12-07 15:09:35,059 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:741, output treesize:267 [2019-12-07 15:09:35,407 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:09:35,408 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.18 stem predicates 12 loop predicates [2019-12-07 15:09:35,408 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 102 states and 138 transitions. cyclomatic complexity: 43 Second operand 30 states. [2019-12-07 15:09:36,002 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 102 states and 138 transitions. cyclomatic complexity: 43. Second operand 30 states. Result 107 states and 143 transitions. Complement of second has 15 states. [2019-12-07 15:09:36,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 13 stem states 0 non-accepting loop states 1 accepting loop states [2019-12-07 15:09:36,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 15:09:36,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2019-12-07 15:09:36,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 35 transitions. Stem has 31 letters. Loop has 15 letters. [2019-12-07 15:09:36,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 15:09:36,003 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 15:09:36,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:09:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:09:36,064 INFO L264 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 15:09:36,065 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:09:36,068 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-12-07 15:09:36,069 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:36,073 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:09:36,073 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:09:36,073 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2019-12-07 15:09:36,085 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2019-12-07 15:09:36,086 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:36,091 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:09:36,091 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:09:36,092 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:31 [2019-12-07 15:09:36,137 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:09:36,137 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 91 [2019-12-07 15:09:36,137 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:36,160 INFO L614 ElimStorePlain]: treesize reduction 48, result has 48.4 percent of original size [2019-12-07 15:09:36,160 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:09:36,160 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:62, output treesize:45 [2019-12-07 15:09:36,271 INFO L343 Elim1Store]: treesize reduction 20, result has 87.6 percent of original size [2019-12-07 15:09:36,272 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 175 [2019-12-07 15:09:36,272 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:36,309 INFO L614 ElimStorePlain]: treesize reduction 108, result has 36.8 percent of original size [2019-12-07 15:09:36,310 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:09:36,310 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:63 [2019-12-07 15:09:36,407 INFO L343 Elim1Store]: treesize reduction 208, result has 19.7 percent of original size [2019-12-07 15:09:36,407 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 84 treesize of output 87 [2019-12-07 15:09:36,407 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:36,420 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:09:36,421 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:09:36,421 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:89, output treesize:74 [2019-12-07 15:09:36,692 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 88 [2019-12-07 15:09:36,693 INFO L343 Elim1Store]: treesize reduction 132, result has 69.8 percent of original size [2019-12-07 15:09:36,693 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 120 treesize of output 353 [2019-12-07 15:09:36,694 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:36,757 INFO L614 ElimStorePlain]: treesize reduction 250, result has 23.5 percent of original size [2019-12-07 15:09:36,757 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:09:36,757 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:128, output treesize:77 [2019-12-07 15:09:37,161 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 114 [2019-12-07 15:09:37,161 INFO L343 Elim1Store]: treesize reduction 132, result has 75.6 percent of original size [2019-12-07 15:09:37,162 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 25 case distinctions, treesize of input 128 treesize of output 456 [2019-12-07 15:09:37,163 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:37,250 INFO L614 ElimStorePlain]: treesize reduction 412, result has 19.2 percent of original size [2019-12-07 15:09:37,250 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:09:37,250 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:139, output treesize:98 [2019-12-07 15:09:37,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:37,599 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 98 [2019-12-07 15:09:37,600 INFO L343 Elim1Store]: treesize reduction 138, result has 72.8 percent of original size [2019-12-07 15:09:37,600 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 24 case distinctions, treesize of input 140 treesize of output 419 [2019-12-07 15:09:37,601 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:37,668 INFO L614 ElimStorePlain]: treesize reduction 315, result has 22.6 percent of original size [2019-12-07 15:09:37,668 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:09:37,669 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:151, output treesize:92 [2019-12-07 15:09:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:09:37,787 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-07 15:09:37,787 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:09:37,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,061 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 64 [2019-12-07 15:09:38,062 INFO L343 Elim1Store]: treesize reduction 409, result has 34.1 percent of original size [2019-12-07 15:09:38,062 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 151 treesize of output 263 [2019-12-07 15:09:38,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,072 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:38,196 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 77 [2019-12-07 15:09:38,197 INFO L614 ElimStorePlain]: treesize reduction 789, result has 24.9 percent of original size [2019-12-07 15:09:38,197 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:09:38,197 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:158, output treesize:262 [2019-12-07 15:09:38,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:09:38,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:09:38,590 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 15:09:38,590 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:38,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,811 INFO L237 Elim1Store]: Index analysis took 208 ms [2019-12-07 15:09:38,881 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:09:38,881 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 21 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 167 treesize of output 358 [2019-12-07 15:09:38,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:38,885 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:38,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,895 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:38,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,906 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:38,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,918 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:38,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:38,963 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:39,001 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 105 [2019-12-07 15:09:39,002 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:39,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,072 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 23 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 119 [2019-12-07 15:09:39,073 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:39,083 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:39,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,099 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:39,099 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:39,100 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:39,156 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:39,191 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:39,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:39,207 INFO L237 Elim1Store]: Index analysis took 124 ms [2019-12-07 15:09:39,237 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 8 disjoint index pairs (out of 28 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 95 [2019-12-07 15:09:39,238 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:39,254 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 15:09:39,254 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:40,291 WARN L192 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 140 DAG size of output: 87 [2019-12-07 15:09:40,293 INFO L614 ElimStorePlain]: treesize reduction 500, result has 47.5 percent of original size [2019-12-07 15:09:40,294 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-07 15:09:40,294 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:1062, output treesize:452 [2019-12-07 15:09:40,781 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-07 15:09:41,287 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-07 15:09:41,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:41,697 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2019-12-07 15:09:41,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:41,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:41,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:41,704 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:41,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:41,707 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:41,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:41,721 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 78 [2019-12-07 15:09:41,721 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:41,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:41,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:41,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:41,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:41,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:41,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:41,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:41,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:41,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:41,730 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:41,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:41,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:41,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:41,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:41,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:41,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:41,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:41,762 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:09:41,762 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 16 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 186 treesize of output 227 [2019-12-07 15:09:41,764 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:41,856 INFO L614 ElimStorePlain]: treesize reduction 197, result has 57.5 percent of original size [2019-12-07 15:09:41,857 INFO L534 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. [2019-12-07 15:09:41,857 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:384, output treesize:267 [2019-12-07 15:09:41,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:09:42,113 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.18 stem predicates 12 loop predicates [2019-12-07 15:09:42,113 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 102 states and 138 transitions. cyclomatic complexity: 43 Second operand 30 states. [2019-12-07 15:09:42,895 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 102 states and 138 transitions. cyclomatic complexity: 43. Second operand 30 states. Result 107 states and 143 transitions. Complement of second has 15 states. [2019-12-07 15:09:42,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 13 stem states 0 non-accepting loop states 1 accepting loop states [2019-12-07 15:09:42,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 15:09:42,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2019-12-07 15:09:42,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 35 transitions. Stem has 31 letters. Loop has 15 letters. [2019-12-07 15:09:42,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 15:09:42,896 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 15:09:42,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:09:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:09:42,947 INFO L264 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 15:09:42,948 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:09:42,954 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-12-07 15:09:42,955 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:42,959 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:09:42,959 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:09:42,959 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2019-12-07 15:09:42,973 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2019-12-07 15:09:42,973 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:42,979 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:09:42,979 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:09:42,979 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:31 [2019-12-07 15:09:43,025 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:09:43,026 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 91 [2019-12-07 15:09:43,026 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:43,050 INFO L614 ElimStorePlain]: treesize reduction 48, result has 48.4 percent of original size [2019-12-07 15:09:43,050 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:09:43,050 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:62, output treesize:45 [2019-12-07 15:09:43,156 INFO L343 Elim1Store]: treesize reduction 20, result has 87.6 percent of original size [2019-12-07 15:09:43,156 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 175 [2019-12-07 15:09:43,156 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:43,195 INFO L614 ElimStorePlain]: treesize reduction 108, result has 36.8 percent of original size [2019-12-07 15:09:43,195 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:09:43,195 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:63 [2019-12-07 15:09:43,375 INFO L343 Elim1Store]: treesize reduction 208, result has 19.7 percent of original size [2019-12-07 15:09:43,375 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 84 treesize of output 87 [2019-12-07 15:09:43,376 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:43,410 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:09:43,410 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:09:43,411 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:89, output treesize:74 [2019-12-07 15:09:43,819 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 88 [2019-12-07 15:09:43,819 INFO L343 Elim1Store]: treesize reduction 132, result has 69.8 percent of original size [2019-12-07 15:09:43,819 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 120 treesize of output 353 [2019-12-07 15:09:43,820 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:43,878 INFO L614 ElimStorePlain]: treesize reduction 250, result has 23.5 percent of original size [2019-12-07 15:09:43,878 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:09:43,878 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:128, output treesize:77 [2019-12-07 15:09:44,294 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 114 [2019-12-07 15:09:44,294 INFO L343 Elim1Store]: treesize reduction 132, result has 75.6 percent of original size [2019-12-07 15:09:44,294 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 25 case distinctions, treesize of input 128 treesize of output 456 [2019-12-07 15:09:44,295 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:44,373 INFO L614 ElimStorePlain]: treesize reduction 412, result has 19.2 percent of original size [2019-12-07 15:09:44,373 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:09:44,373 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:139, output treesize:98 [2019-12-07 15:09:44,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:44,752 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 100 [2019-12-07 15:09:44,753 INFO L343 Elim1Store]: treesize reduction 153, result has 72.0 percent of original size [2019-12-07 15:09:44,753 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 24 case distinctions, treesize of input 147 treesize of output 446 [2019-12-07 15:09:44,754 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:44,824 INFO L614 ElimStorePlain]: treesize reduction 336, result has 22.4 percent of original size [2019-12-07 15:09:44,824 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:09:44,824 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:158, output treesize:97 [2019-12-07 15:09:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:09:44,970 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 15:09:44,970 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:09:45,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:45,253 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 64 [2019-12-07 15:09:45,253 INFO L343 Elim1Store]: treesize reduction 409, result has 34.1 percent of original size [2019-12-07 15:09:45,253 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 151 treesize of output 263 [2019-12-07 15:09:45,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:45,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:45,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:45,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:45,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:45,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:45,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:45,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:45,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:45,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:45,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:45,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:45,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:45,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:45,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:45,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:45,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:45,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:45,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:45,262 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:45,653 WARN L192 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 83 [2019-12-07 15:09:45,653 INFO L614 ElimStorePlain]: treesize reduction 684, result has 27.8 percent of original size [2019-12-07 15:09:45,654 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:09:45,654 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:158, output treesize:264 [2019-12-07 15:09:45,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:45,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:45,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:45,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:45,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:46,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,211 INFO L237 Elim1Store]: Index analysis took 212 ms [2019-12-07 15:09:46,291 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:09:46,291 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 21 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 160 treesize of output 326 [2019-12-07 15:09:46,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:46,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:46,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:46,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:46,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:46,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:46,295 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:46,300 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:46,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,306 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:46,306 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:46,307 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:46,321 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:46,326 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:46,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,332 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 8 disjoint index pairs (out of 28 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 93 [2019-12-07 15:09:46,332 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:46,337 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 15:09:46,337 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:46,341 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 15:09:46,341 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:46,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,350 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:46,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,359 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:46,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,368 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:46,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,398 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:46,425 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 103 [2019-12-07 15:09:46,426 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:46,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:46,447 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 117 [2019-12-07 15:09:46,448 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:46,692 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 94 [2019-12-07 15:09:46,693 INFO L614 ElimStorePlain]: treesize reduction 455, result has 46.2 percent of original size [2019-12-07 15:09:46,693 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-07 15:09:46,693 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:1035, output treesize:391 [2019-12-07 15:09:47,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:47,273 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 [2019-12-07 15:09:47,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:09:47,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:47,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:47,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:47,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:47,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:47,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:47,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:47,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:47,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:47,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:47,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:47,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:47,290 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:47,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:47,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:47,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:47,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:47,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:47,314 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:47,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:47,364 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:09:47,365 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 17 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 186 treesize of output 227 [2019-12-07 15:09:47,366 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:47,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:47,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:47,371 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:09:47,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:47,376 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 82 [2019-12-07 15:09:47,376 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:09:47,477 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 73 [2019-12-07 15:09:47,477 INFO L614 ElimStorePlain]: treesize reduction 201, result has 57.1 percent of original size [2019-12-07 15:09:47,478 INFO L534 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. [2019-12-07 15:09:47,478 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:386, output treesize:268 [2019-12-07 15:09:47,729 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:09:47,729 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.18 stem predicates 12 loop predicates [2019-12-07 15:09:47,729 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 102 states and 138 transitions. cyclomatic complexity: 43 Second operand 30 states. [2019-12-07 15:09:51,268 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2019-12-07 15:09:51,421 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 102 states and 138 transitions. cyclomatic complexity: 43. Second operand 30 states. Result 282 states and 380 transitions. Complement of second has 59 states. [2019-12-07 15:09:51,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 35 states 21 stem states 12 non-accepting loop states 2 accepting loop states [2019-12-07 15:09:51,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 15:09:51,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 198 transitions. [2019-12-07 15:09:51,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 198 transitions. Stem has 31 letters. Loop has 15 letters. [2019-12-07 15:09:51,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 15:09:51,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 198 transitions. Stem has 46 letters. Loop has 15 letters. [2019-12-07 15:09:51,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 15:09:51,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 198 transitions. Stem has 31 letters. Loop has 30 letters. [2019-12-07 15:09:51,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 15:09:51,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 282 states and 380 transitions. [2019-12-07 15:09:51,425 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 79 [2019-12-07 15:09:51,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 282 states to 259 states and 348 transitions. [2019-12-07 15:09:51,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 165 [2019-12-07 15:09:51,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 173 [2019-12-07 15:09:51,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 259 states and 348 transitions. [2019-12-07 15:09:51,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 15:09:51,427 INFO L688 BuchiCegarLoop]: Abstraction has 259 states and 348 transitions. [2019-12-07 15:09:51,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states and 348 transitions. [2019-12-07 15:09:51,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 143. [2019-12-07 15:09:51,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 15:09:51,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 191 transitions. [2019-12-07 15:09:51,430 INFO L711 BuchiCegarLoop]: Abstraction has 143 states and 191 transitions. [2019-12-07 15:09:51,430 INFO L591 BuchiCegarLoop]: Abstraction has 143 states and 191 transitions. [2019-12-07 15:09:51,430 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-12-07 15:09:51,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states and 191 transitions. [2019-12-07 15:09:51,431 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 43 [2019-12-07 15:09:51,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 15:09:51,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 15:09:51,431 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:09:51,431 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 15:09:51,431 INFO L794 eck$LassoCheckResult]: Stem: 6196#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 6193#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; 6188#L565 assume !(main_~array_size~0 < 1); 6189#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; 6197#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); 6212#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6213#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); 6210#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6211#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); 6250#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6249#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); 6215#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6214#L552-3 assume !(lis_~i~0 < lis_~N); 6178#L552-4 lis_~i~0 := 1; 6179#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6247#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; 6244#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; 6241#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 6239#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6237#L555-3 assume !(lis_~j~0 < lis_~i~0); 6235#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 6233#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6231#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; 6228#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; 6225#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 6223#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6221#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; 6220#L556 assume !lis_#t~short11; 6191#L556-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7; 6192#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6195#L555-3 assume !(lis_~j~0 < lis_~i~0); 6307#L554-2 [2019-12-07 15:09:51,431 INFO L796 eck$LassoCheckResult]: Loop: 6307#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 6305#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6303#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; 6300#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; 6297#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 6295#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; 6291#L556 assume !lis_#t~short11; 6288#L556-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7; 6286#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 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; 6311#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; 6278#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 6279#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6310#L555-3 assume !(lis_~j~0 < lis_~i~0); 6307#L554-2 [2019-12-07 15:09:51,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:09:51,432 INFO L82 PathProgramCache]: Analyzing trace with hash 209194076, now seen corresponding path program 4 times [2019-12-07 15:09:51,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:09:51,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271858914] [2019-12-07 15:09:51,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:09:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:09:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:09:51,484 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:09:51,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:09:51,485 INFO L82 PathProgramCache]: Analyzing trace with hash 660716904, now seen corresponding path program 1 times [2019-12-07 15:09:51,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:09:51,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044062053] [2019-12-07 15:09:51,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:09:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:09:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:09:51,494 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:09:51,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:09:51,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1591078995, now seen corresponding path program 5 times [2019-12-07 15:09:51,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:09:51,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897636348] [2019-12-07 15:09:51,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:09:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:09:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:09:51,560 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:09:52,109 WARN L192 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 131 [2019-12-07 15:09:52,217 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-12-07 15:09:56,315 WARN L192 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 372 DAG size of output: 237 [2019-12-07 15:09:57,940 WARN L192 SmtUtils]: Spent 1.62 s on a formula simplification that was a NOOP. DAG size: 159 [2019-12-07 15:09:57,943 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 15:09:57,943 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 15:09:57,943 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 15:09:57,943 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 15:09:57,944 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 15:09:57,944 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:09:57,944 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 15:09:57,944 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 15:09:57,944 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration15_Lasso [2019-12-07 15:09:57,944 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 15:09:57,944 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 15:09:57,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:57,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:57,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:57,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:57,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:57,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:57,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:57,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:57,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:57,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:57,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:57,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:57,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:57,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:57,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:57,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:57,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:57,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:57,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:09:57,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:10:00,116 WARN L192 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 127 [2019-12-07 15:10:00,538 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 116 [2019-12-07 15:10:00,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:10:00,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:10:00,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:10:00,915 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 82 [2019-12-07 15:10:01,241 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 15:10:01,241 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 106 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 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:10:01,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:10:01,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:10:01,246 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 107 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 107 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:10:01,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,250 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:10:01,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:10:01,251 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 108 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 108 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:10:01,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,256 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:10:01,256 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:10:01,257 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 109 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 109 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,264 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:10:01,264 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:10:01,266 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 110 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 110 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,271 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:10:01,271 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:10:01,274 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 111 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 111 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:10:01,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,278 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:10:01,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:10:01,279 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 112 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 112 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,283 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,284 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:10:01,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,285 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:10:01,285 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:10:01,285 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 113 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 113 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:10:01,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,290 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:10:01,290 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:10:01,291 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 114 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 114 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:10:01,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:10:01,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:10:01,297 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 115 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 115 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:10:01,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:10:01,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:10:01,303 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 116 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 116 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,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 [2019-12-07 15:10:01,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:10:01,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:10:01,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:10:01,310 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 117 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 117 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:10:01,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:10:01,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:10:01,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_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 118 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 118 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,321 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:10:01,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:10:01,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:10:01,324 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 119 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 119 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,330 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:10:01,330 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:10:01,332 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 120 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 120 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,338 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:10:01,338 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:10:01,340 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 121 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 121 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:10:01,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:10:01,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:10:01,345 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 122 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 122 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:10:01,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:10:01,352 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 123 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 123 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:10:01,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,357 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:10:01,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:10:01,359 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 124 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 124 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 15:10:01,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 15:10:01,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 15:10:01,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 125 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 125 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,370 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:10:01,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:10:01,374 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 126 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 126 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,380 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:10:01,380 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:10:01,383 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 127 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 127 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:10:01,392 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:10:01,396 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 128 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 128 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,401 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:10:01,401 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:10:01,403 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 129 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 129 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,409 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:10:01,409 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:10:01,412 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 130 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 130 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,420 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:10:01,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:10:01,427 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 131 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 131 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,434 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:10:01,434 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:10:01,436 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 132 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 132 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:10:01,442 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:10:01,445 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 133 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 133 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,451 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:10:01,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:10:01,453 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 134 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 134 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:01,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:01,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:01,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:01,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:01,462 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:10:01,462 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:10:01,474 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 15:10:01,495 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2019-12-07 15:10:01,495 INFO L444 ModelExtractionUtils]: 5 out of 25 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 135 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 135 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:01,498 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 15:10:01,501 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 15:10:01,501 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 15:10:01,501 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 8))_3, v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset (* ULTIMATE.start_lis_~i~0 4)))_3) = 2*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 8))_3 - 2*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset (* ULTIMATE.start_lis_~i~0 4)))_3 + 1 Supporting invariants [] [2019-12-07 15:10:01,890 INFO L297 tatePredicateManager]: 79 out of 80 supporting invariants were superfluous and have been removed [2019-12-07 15:10:01,892 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 15:10:01,892 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 15:10:01,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:01,929 INFO L264 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 15:10:01,930 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:10:01,936 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:01,936 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-12-07 15:10:01,936 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:10:01,940 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:01,940 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:10:01,940 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-12-07 15:10:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:01,953 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 15:10:01,954 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:10:01,959 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:01,959 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2019-12-07 15:10:01,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:01,960 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 15:10:01,964 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:01,964 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:10:01,964 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:20 [2019-12-07 15:10:02,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:02,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:02,050 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2019-12-07 15:10:02,050 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:10:02,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:02,057 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2019-12-07 15:10:02,058 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:10:02,081 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:02,081 INFO L534 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. [2019-12-07 15:10:02,081 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:150, output treesize:96 [2019-12-07 15:10:02,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:02,206 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:10:02,206 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2019-12-07 15:10:02,207 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 143 states and 191 transitions. cyclomatic complexity: 56 Second operand 10 states. [2019-12-07 15:10:02,570 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 143 states and 191 transitions. cyclomatic complexity: 56. Second operand 10 states. Result 379 states and 526 transitions. Complement of second has 18 states. [2019-12-07 15:10:02,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2019-12-07 15:10:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-12-07 15:10:02,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 58 transitions. [2019-12-07 15:10:02,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 58 transitions. Stem has 31 letters. Loop has 15 letters. [2019-12-07 15:10:02,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 15:10:02,571 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 15:10:02,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:02,611 INFO L264 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 15:10:02,612 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:10:02,617 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:02,617 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-12-07 15:10:02,617 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:10:02,621 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:02,622 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:10:02,622 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-12-07 15:10:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:02,634 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 15:10:02,635 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:10:02,640 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:02,640 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2019-12-07 15:10:02,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:02,640 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 15:10:02,645 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:02,645 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:10:02,645 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:20 [2019-12-07 15:10:02,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:02,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:02,724 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2019-12-07 15:10:02,725 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:10:02,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:02,730 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2019-12-07 15:10:02,730 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:10:02,752 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:02,752 INFO L534 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. [2019-12-07 15:10:02,752 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:150, output treesize:96 [2019-12-07 15:10:02,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:02,840 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:10:02,840 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2019-12-07 15:10:02,840 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 143 states and 191 transitions. cyclomatic complexity: 56 Second operand 10 states. [2019-12-07 15:10:03,047 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 143 states and 191 transitions. cyclomatic complexity: 56. Second operand 10 states. Result 379 states and 526 transitions. Complement of second has 18 states. [2019-12-07 15:10:03,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2019-12-07 15:10:03,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-12-07 15:10:03,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 58 transitions. [2019-12-07 15:10:03,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 58 transitions. Stem has 31 letters. Loop has 15 letters. [2019-12-07 15:10:03,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 15:10:03,048 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 15:10:03,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:03,089 INFO L264 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 15:10:03,089 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:10:03,094 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:03,095 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-12-07 15:10:03,095 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:10:03,099 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:03,099 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:10:03,099 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-12-07 15:10:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:03,112 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 15:10:03,112 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:10:03,117 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:03,117 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2019-12-07 15:10:03,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:03,117 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 15:10:03,121 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:03,121 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:10:03,122 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:20 [2019-12-07 15:10:03,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:03,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:03,195 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2019-12-07 15:10:03,195 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:10:03,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:03,201 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2019-12-07 15:10:03,201 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:10:03,224 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:03,224 INFO L534 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. [2019-12-07 15:10:03,225 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:150, output treesize:96 [2019-12-07 15:10:03,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:03,468 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:10:03,468 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2019-12-07 15:10:03,468 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 143 states and 191 transitions. cyclomatic complexity: 56 Second operand 10 states. [2019-12-07 15:10:04,116 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 143 states and 191 transitions. cyclomatic complexity: 56. Second operand 10 states. Result 368 states and 511 transitions. Complement of second has 21 states. [2019-12-07 15:10:04,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2019-12-07 15:10:04,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-12-07 15:10:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2019-12-07 15:10:04,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 66 transitions. Stem has 31 letters. Loop has 15 letters. [2019-12-07 15:10:04,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 15:10:04,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 66 transitions. Stem has 46 letters. Loop has 15 letters. [2019-12-07 15:10:04,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 15:10:04,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 66 transitions. Stem has 31 letters. Loop has 30 letters. [2019-12-07 15:10:04,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 15:10:04,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 368 states and 511 transitions. [2019-12-07 15:10:04,119 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 101 [2019-12-07 15:10:04,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 368 states to 294 states and 400 transitions. [2019-12-07 15:10:04,121 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2019-12-07 15:10:04,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2019-12-07 15:10:04,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 294 states and 400 transitions. [2019-12-07 15:10:04,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 15:10:04,122 INFO L688 BuchiCegarLoop]: Abstraction has 294 states and 400 transitions. [2019-12-07 15:10:04,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states and 400 transitions. [2019-12-07 15:10:04,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 209. [2019-12-07 15:10:04,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-07 15:10:04,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 288 transitions. [2019-12-07 15:10:04,126 INFO L711 BuchiCegarLoop]: Abstraction has 209 states and 288 transitions. [2019-12-07 15:10:04,126 INFO L591 BuchiCegarLoop]: Abstraction has 209 states and 288 transitions. [2019-12-07 15:10:04,126 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-12-07 15:10:04,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 209 states and 288 transitions. [2019-12-07 15:10:04,126 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 89 [2019-12-07 15:10:04,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 15:10:04,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 15:10:04,127 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:10:04,127 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 1, 1, 1, 1] [2019-12-07 15:10:04,127 INFO L794 eck$LassoCheckResult]: Stem: 8325#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8320#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; 8315#L565 assume !(main_~array_size~0 < 1); 8316#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; 8326#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); 8337#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8338#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); 8340#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8346#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); 8345#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8344#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); 8342#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8341#L552-3 assume !(lis_~i~0 < lis_~N); 8304#L552-4 lis_~i~0 := 1; 8305#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 8361#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; 8358#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; 8359#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 8356#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8357#L555-3 assume !(lis_~j~0 < lis_~i~0); 8501#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 8335#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 8336#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; 8497#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; 8495#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 8477#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8478#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; 8472#L556 assume !lis_#t~short11; 8474#L556-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7; 8468#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8363#L555-3 assume !(lis_~j~0 < lis_~i~0); 8349#L554-2 [2019-12-07 15:10:04,127 INFO L796 eck$LassoCheckResult]: Loop: 8349#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 8334#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 8343#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; 8306#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; 8307#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 8391#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8396#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; 8395#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; 8388#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 8387#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8386#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; 8383#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; 8384#L556-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7; 8415#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8365#L555-3 assume !(lis_~j~0 < lis_~i~0); 8349#L554-2 [2019-12-07 15:10:04,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:04,128 INFO L82 PathProgramCache]: Analyzing trace with hash 209194076, now seen corresponding path program 6 times [2019-12-07 15:10:04,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:04,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438552639] [2019-12-07 15:10:04,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:04,176 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:10:04,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:04,177 INFO L82 PathProgramCache]: Analyzing trace with hash -304941910, now seen corresponding path program 1 times [2019-12-07 15:10:04,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:04,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790607563] [2019-12-07 15:10:04,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:04,195 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:10:04,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:04,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1738229487, now seen corresponding path program 7 times [2019-12-07 15:10:04,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:04,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755957500] [2019-12-07 15:10:04,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:04,274 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:10:05,046 WARN L192 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 144 [2019-12-07 15:10:05,188 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-12-07 15:10:12,353 WARN L192 SmtUtils]: Spent 7.16 s on a formula simplification. DAG size of input: 378 DAG size of output: 242 [2019-12-07 15:10:14,170 WARN L192 SmtUtils]: Spent 1.81 s on a formula simplification that was a NOOP. DAG size: 161 [2019-12-07 15:10:14,173 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 15:10:14,173 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 15:10:14,173 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 15:10:14,173 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 15:10:14,173 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 15:10:14,173 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:14,173 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 15:10:14,173 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 15:10:14,173 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration16_Lasso [2019-12-07 15:10:14,174 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 15:10:14,174 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 15:10:14,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:10:17,325 WARN L192 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 129 [2019-12-07 15:10:17,731 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 122 [2019-12-07 15:10:17,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:10:17,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:10:17,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:10:17,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:10:17,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:10:17,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:10:17,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:10:17,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:10:17,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:10:17,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:10:17,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:10:17,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:10:17,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:10:17,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:10:17,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:10:17,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:10:17,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:10:17,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:10:17,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:10:17,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:10:17,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:10:17,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:10:18,094 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-12-07 15:10:18,417 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 15:10:18,417 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 136 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 136 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:18,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:18,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:18,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:18,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:18,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:18,423 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:10:18,423 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:10:18,428 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 137 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 137 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:18,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:18,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:18,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:18,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:18,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:18,435 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:10:18,435 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:10:18,439 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 138 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 138 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:18,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:18,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:18,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:18,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:18,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:18,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:10:18,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:10:18,447 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 139 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 139 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:18,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:18,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:18,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:18,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:18,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:18,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:10:18,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:10:18,458 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 140 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 140 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:18,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 15:10:18,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 15:10:18,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 15:10:18,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 15:10:18,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 15:10:18,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 15:10:18,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 15:10:18,480 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 15:10:18,499 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-12-07 15:10:18,499 INFO L444 ModelExtractionUtils]: 5 out of 22 variables were initially zero. Simplification set additionally 14 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 141 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 141 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:10:18,501 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 15:10:18,504 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 15:10:18,504 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 15:10:18,504 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 4))_5, v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 12))_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 4))_5 - 1*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 12))_3 Supporting invariants [] [2019-12-07 15:10:19,024 INFO L297 tatePredicateManager]: 86 out of 87 supporting invariants were superfluous and have been removed [2019-12-07 15:10:19,026 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 15:10:19,026 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 15:10:19,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:19,063 INFO L264 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 15:10:19,063 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:10:19,068 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:19,068 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-12-07 15:10:19,069 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:10:19,073 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:19,073 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:10:19,073 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-12-07 15:10:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:19,086 INFO L264 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 15:10:19,086 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:10:19,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:19,205 INFO L343 Elim1Store]: treesize reduction 40, result has 81.5 percent of original size [2019-12-07 15:10:19,205 INFO L377 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 9 case distinctions, treesize of input 96 treesize of output 208 [2019-12-07 15:10:19,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:19,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:19,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:19,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:19,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:19,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:19,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:19,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:19,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:19,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:19,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:19,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:19,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:19,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:19,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:19,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:19,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:19,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:19,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:19,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:19,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:19,214 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:10:19,404 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 48 [2019-12-07 15:10:19,405 INFO L614 ElimStorePlain]: treesize reduction 502, result has 19.4 percent of original size [2019-12-07 15:10:19,406 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:10:19,406 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:103, output treesize:121 [2019-12-07 15:10:19,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:19,959 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-12-07 15:10:19,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:19,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:10:19,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:10:19,978 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 15:10:19,978 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:10:19,984 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 15:10:19,984 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:10:19,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:19,992 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:10:19,997 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:10:19,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:20,015 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 47 [2019-12-07 15:10:20,015 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 15:10:20,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:20,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:20,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:20,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:20,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:20,025 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:10:20,050 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:10:20,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:20,062 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 58 [2019-12-07 15:10:20,062 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 15:10:20,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:20,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:20,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:20,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:20,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:20,069 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:10:20,080 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:10:20,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:20,086 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 68 [2019-12-07 15:10:20,086 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 15:10:20,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:20,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:20,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:20,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:20,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:20,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:20,096 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:10:20,123 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:20,123 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 187 [2019-12-07 15:10:20,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:20,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:20,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:20,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:20,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:20,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:20,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:20,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:20,126 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:10:20,240 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-12-07 15:10:20,240 INFO L614 ElimStorePlain]: treesize reduction 142, result has 67.7 percent of original size [2019-12-07 15:10:20,240 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-12-07 15:10:20,241 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:796, output treesize:293 [2019-12-07 15:10:20,659 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-12-07 15:10:20,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:20,796 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:10:20,796 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2019-12-07 15:10:20,796 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 209 states and 288 transitions. cyclomatic complexity: 87 Second operand 13 states. [2019-12-07 15:10:21,557 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-12-07 15:10:22,072 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 209 states and 288 transitions. cyclomatic complexity: 87. Second operand 13 states. Result 580 states and 792 transitions. Complement of second has 26 states. [2019-12-07 15:10:22,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2019-12-07 15:10:22,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-12-07 15:10:22,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2019-12-07 15:10:22,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 58 transitions. Stem has 31 letters. Loop has 15 letters. [2019-12-07 15:10:22,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 15:10:22,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 58 transitions. Stem has 46 letters. Loop has 15 letters. [2019-12-07 15:10:22,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 15:10:22,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 58 transitions. Stem has 31 letters. Loop has 30 letters. [2019-12-07 15:10:22,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 15:10:22,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 580 states and 792 transitions. [2019-12-07 15:10:22,077 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 166 [2019-12-07 15:10:22,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 580 states to 519 states and 713 transitions. [2019-12-07 15:10:22,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 151 [2019-12-07 15:10:22,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 156 [2019-12-07 15:10:22,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 519 states and 713 transitions. [2019-12-07 15:10:22,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 15:10:22,080 INFO L688 BuchiCegarLoop]: Abstraction has 519 states and 713 transitions. [2019-12-07 15:10:22,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states and 713 transitions. [2019-12-07 15:10:22,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 361. [2019-12-07 15:10:22,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-12-07 15:10:22,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 513 transitions. [2019-12-07 15:10:22,086 INFO L711 BuchiCegarLoop]: Abstraction has 361 states and 513 transitions. [2019-12-07 15:10:22,086 INFO L591 BuchiCegarLoop]: Abstraction has 361 states and 513 transitions. [2019-12-07 15:10:22,086 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2019-12-07 15:10:22,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 361 states and 513 transitions. [2019-12-07 15:10:22,088 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 151 [2019-12-07 15:10:22,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 15:10:22,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 15:10:22,088 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:10:22,088 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 15:10:22,089 INFO L794 eck$LassoCheckResult]: Stem: 9666#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9663#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; 9657#L565 assume !(main_~array_size~0 < 1); 9658#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; 9667#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); 9681#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9682#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); 9683#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9688#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); 9687#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9686#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); 9685#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9684#L552-3 assume !(lis_~i~0 < lis_~N); 9647#L552-4 lis_~i~0 := 1; 9648#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9705#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; 9702#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; 9703#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 9706#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9694#L555-3 assume !(lis_~j~0 < lis_~i~0); 9695#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 9676#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9677#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; 9938#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; 9939#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 9934#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9935#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; 9928#L556 assume !lis_#t~short11; 9925#L556-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7; 9892#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9893#L555-3 assume !(lis_~j~0 < lis_~i~0); 9671#L554-2 [2019-12-07 15:10:22,089 INFO L796 eck$LassoCheckResult]: Loop: 9671#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 9673#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9835#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; 9833#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; 9831#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 9830#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9829#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; 9828#L556 assume !lis_#t~short11; 9651#L556-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7; 9841#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9839#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; 9836#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; 9754#L556-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7; 9726#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9856#L555-3 assume !(lis_~j~0 < lis_~i~0); 9671#L554-2 [2019-12-07 15:10:22,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:22,089 INFO L82 PathProgramCache]: Analyzing trace with hash 209194076, now seen corresponding path program 8 times [2019-12-07 15:10:22,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:22,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174256207] [2019-12-07 15:10:22,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:22,149 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:10:22,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:22,149 INFO L82 PathProgramCache]: Analyzing trace with hash 660718826, now seen corresponding path program 2 times [2019-12-07 15:10:22,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:22,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570620021] [2019-12-07 15:10:22,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:22,161 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:10:22,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:22,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1591077073, now seen corresponding path program 9 times [2019-12-07 15:10:22,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:22,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934903364] [2019-12-07 15:10:22,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:22,779 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 8 proven. 90 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 15:10:22,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934903364] [2019-12-07 15:10:22,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986460157] [2019-12-07 15:10:22,780 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:10:22,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 15:10:22,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:10:22,837 INFO L264 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 15:10:22,838 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:10:22,843 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:22,843 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-12-07 15:10:22,843 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:10:22,847 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:22,848 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:10:22,848 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:8 [2019-12-07 15:10:22,868 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:22,869 INFO L377 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 59 treesize of output 74 [2019-12-07 15:10:22,869 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:10:22,888 INFO L614 ElimStorePlain]: treesize reduction 32, result has 61.9 percent of original size [2019-12-07 15:10:22,888 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:10:22,888 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:52 [2019-12-07 15:10:23,187 INFO L343 Elim1Store]: treesize reduction 110, result has 52.0 percent of original size [2019-12-07 15:10:23,187 INFO L377 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 5 new quantified variables, introduced 7 case distinctions, treesize of input 119 treesize of output 165 [2019-12-07 15:10:23,188 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:10:23,230 INFO L614 ElimStorePlain]: treesize reduction 149, result has 43.3 percent of original size [2019-12-07 15:10:23,230 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 15:10:23,230 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:129, output treesize:114 [2019-12-07 15:10:23,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,688 INFO L430 ElimStorePlain]: Different costs {30=[v_prenex_24], 42=[|#memory_int|]} [2019-12-07 15:10:23,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:23,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:23,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:23,714 INFO L343 Elim1Store]: treesize reduction 17, result has 67.3 percent of original size [2019-12-07 15:10:23,714 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 65 [2019-12-07 15:10:23,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,720 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:10:23,746 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:23,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:23,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:23,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:23,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:23,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:23,783 INFO L343 Elim1Store]: treesize reduction 17, result has 77.6 percent of original size [2019-12-07 15:10:23,783 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 94 [2019-12-07 15:10:23,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:23,807 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-12-07 15:10:23,850 INFO L614 ElimStorePlain]: treesize reduction 225, result has 13.8 percent of original size [2019-12-07 15:10:23,851 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 15:10:23,851 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:219, output treesize:28 [2019-12-07 15:10:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 22 proven. 57 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 15:10:23,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:10:23,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 34 [2019-12-07 15:10:23,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551234099] [2019-12-07 15:10:24,356 WARN L192 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 125 [2019-12-07 15:10:24,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:10:24,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-07 15:10:24,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1035, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 15:10:24,425 INFO L87 Difference]: Start difference. First operand 361 states and 513 transitions. cyclomatic complexity: 166 Second operand 35 states. [2019-12-07 15:10:30,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:30,431 INFO L93 Difference]: Finished difference Result 1349 states and 1864 transitions. [2019-12-07 15:10:30,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-12-07 15:10:30,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1349 states and 1864 transitions. [2019-12-07 15:10:30,434 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 671 [2019-12-07 15:10:30,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1349 states to 1340 states and 1854 transitions. [2019-12-07 15:10:30,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 669 [2019-12-07 15:10:30,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 678 [2019-12-07 15:10:30,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1340 states and 1854 transitions. [2019-12-07 15:10:30,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 15:10:30,441 INFO L688 BuchiCegarLoop]: Abstraction has 1340 states and 1854 transitions. [2019-12-07 15:10:30,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states and 1854 transitions. [2019-12-07 15:10:30,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 885. [2019-12-07 15:10:30,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2019-12-07 15:10:30,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1263 transitions. [2019-12-07 15:10:30,455 INFO L711 BuchiCegarLoop]: Abstraction has 885 states and 1263 transitions. [2019-12-07 15:10:30,455 INFO L591 BuchiCegarLoop]: Abstraction has 885 states and 1263 transitions. [2019-12-07 15:10:30,455 INFO L424 BuchiCegarLoop]: ======== Iteration 18============ [2019-12-07 15:10:30,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 885 states and 1263 transitions. [2019-12-07 15:10:30,457 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 471 [2019-12-07 15:10:30,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 15:10:30,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 15:10:30,457 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:10:30,457 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 1, 1, 1, 1, 1] [2019-12-07 15:10:30,457 INFO L794 eck$LassoCheckResult]: Stem: 11670#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11667#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; 11661#L565 assume !(main_~array_size~0 < 1); 11662#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; 11671#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); 11686#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 11687#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); 11684#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 11685#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); 11691#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 11690#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); 11689#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 11688#L552-3 assume !(lis_~i~0 < lis_~N); 11650#L552-4 lis_~i~0 := 1; 11651#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 11708#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; 11705#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; 11706#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 11703#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11704#L555-3 assume !(lis_~j~0 < lis_~i~0); 11837#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 11835#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 11833#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; 11830#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; 11827#L556-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7; 11828#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12022#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; 12021#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; 12018#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 12019#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12014#L555-3 assume !(lis_~j~0 < lis_~i~0); 12003#L554-2 [2019-12-07 15:10:30,458 INFO L796 eck$LassoCheckResult]: Loop: 12003#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 11692#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 11693#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; 12521#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; 12519#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 12517#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12514#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; 12515#L556 assume !lis_#t~short11; 12490#L556-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7; 12510#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12508#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; 12503#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; 12500#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 12384#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12385#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; 12378#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; 12379#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 12386#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12387#L555-3 assume !(lis_~j~0 < lis_~i~0); 12003#L554-2 [2019-12-07 15:10:30,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:30,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1984139934, now seen corresponding path program 2 times [2019-12-07 15:10:30,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:30,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129696189] [2019-12-07 15:10:30,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:30,979 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 15:10:30,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129696189] [2019-12-07 15:10:30,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355446134] [2019-12-07 15:10:30,979 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:10:31,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 15:10:31,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:10:31,018 INFO L264 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 15:10:31,019 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:10:31,025 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:31,025 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-12-07 15:10:31,025 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:10:31,032 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:31,032 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:10:31,032 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2019-12-07 15:10:31,067 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2019-12-07 15:10:31,067 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:10:31,075 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:31,075 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:10:31,075 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2019-12-07 15:10:31,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:31,133 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:31,133 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 77 [2019-12-07 15:10:31,133 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:10:31,153 INFO L614 ElimStorePlain]: treesize reduction 30, result has 63.0 percent of original size [2019-12-07 15:10:31,153 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:10:31,153 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:51 [2019-12-07 15:10:31,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:31,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:31,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:31,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:31,236 INFO L343 Elim1Store]: treesize reduction 12, result has 86.8 percent of original size [2019-12-07 15:10:31,237 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 131 [2019-12-07 15:10:31,237 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:10:31,267 INFO L614 ElimStorePlain]: treesize reduction 60, result has 53.5 percent of original size [2019-12-07 15:10:31,268 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:10:31,268 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:86, output treesize:69 [2019-12-07 15:10:31,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:31,713 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-12-07 15:10:31,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:31,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:31,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:31,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:31,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:31,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:31,755 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:10:31,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:10:32,088 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-12-07 15:10:32,089 INFO L343 Elim1Store]: treesize reduction 12, result has 92.8 percent of original size [2019-12-07 15:10:32,090 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 226 [2019-12-07 15:10:32,092 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:10:32,295 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2019-12-07 15:10:32,295 INFO L614 ElimStorePlain]: treesize reduction 135, result has 40.3 percent of original size [2019-12-07 15:10:32,295 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 15:10:32,296 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:138, output treesize:91 [2019-12-07 15:10:32,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:32,479 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 15:10:32,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:10:32,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2019-12-07 15:10:32,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370316300] [2019-12-07 15:10:32,479 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 15:10:32,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:32,480 INFO L82 PathProgramCache]: Analyzing trace with hash -64697695, now seen corresponding path program 3 times [2019-12-07 15:10:32,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:32,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564413305] [2019-12-07 15:10:32,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:32,494 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:10:33,945 WARN L192 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 231 DAG size of output: 164 [2019-12-07 15:10:34,243 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-12-07 15:10:34,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:10:34,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 15:10:34,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=771, Unknown=0, NotChecked=0, Total=870 [2019-12-07 15:10:34,244 INFO L87 Difference]: Start difference. First operand 885 states and 1263 transitions. cyclomatic complexity: 402 Second operand 30 states. [2019-12-07 15:10:35,257 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-12-07 15:10:35,626 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-12-07 15:10:36,466 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-12-07 15:10:36,751 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-12-07 15:10:38,372 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-12-07 15:10:38,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:38,800 INFO L93 Difference]: Finished difference Result 1588 states and 2243 transitions. [2019-12-07 15:10:38,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 15:10:38,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1588 states and 2243 transitions. [2019-12-07 15:10:38,806 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 768 [2019-12-07 15:10:38,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1588 states to 1586 states and 2241 transitions. [2019-12-07 15:10:38,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 919 [2019-12-07 15:10:38,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 921 [2019-12-07 15:10:38,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1586 states and 2241 transitions. [2019-12-07 15:10:38,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 15:10:38,817 INFO L688 BuchiCegarLoop]: Abstraction has 1586 states and 2241 transitions. [2019-12-07 15:10:38,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states and 2241 transitions. [2019-12-07 15:10:38,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 894. [2019-12-07 15:10:38,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2019-12-07 15:10:38,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1263 transitions. [2019-12-07 15:10:38,836 INFO L711 BuchiCegarLoop]: Abstraction has 894 states and 1263 transitions. [2019-12-07 15:10:38,837 INFO L591 BuchiCegarLoop]: Abstraction has 894 states and 1263 transitions. [2019-12-07 15:10:38,837 INFO L424 BuchiCegarLoop]: ======== Iteration 19============ [2019-12-07 15:10:38,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 894 states and 1263 transitions. [2019-12-07 15:10:38,838 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 471 [2019-12-07 15:10:38,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 15:10:38,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 15:10:38,839 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:10:38,839 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 1, 1, 1, 1, 1] [2019-12-07 15:10:38,839 INFO L794 eck$LassoCheckResult]: Stem: 14306#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 14303#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; 14297#L565 assume !(main_~array_size~0 < 1); 14298#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; 14307#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); 14322#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 14323#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); 14319#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 14320#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); 14327#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 14326#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); 14325#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 14324#L552-3 assume !(lis_~i~0 < lis_~N); 14286#L552-4 lis_~i~0 := 1; 14287#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 14343#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; 14339#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; 14340#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 14344#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14335#L555-3 assume !(lis_~j~0 < lis_~i~0); 14336#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 14567#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 14565#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; 14562#L556 assume !lis_#t~short11; 14563#L556-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7; 14671#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14670#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; 14669#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; 14666#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 14667#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14768#L555-3 assume !(lis_~j~0 < lis_~i~0); 14540#L554-2 [2019-12-07 15:10:38,839 INFO L796 eck$LassoCheckResult]: Loop: 14540#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 14539#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 14912#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; 14911#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; 14909#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 14907#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14904#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; 14901#L556 assume !lis_#t~short11; 14897#L556-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7; 14895#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14893#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; 14889#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; 14884#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 14784#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14778#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; 14777#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; 14771#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 14679#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14776#L555-3 assume !(lis_~j~0 < lis_~i~0); 14540#L554-2 [2019-12-07 15:10:38,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:38,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1174793308, now seen corresponding path program 10 times [2019-12-07 15:10:38,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:38,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935554835] [2019-12-07 15:10:38,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:39,475 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 15:10:39,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935554835] [2019-12-07 15:10:39,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811121545] [2019-12-07 15:10:39,475 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:10:39,516 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 15:10:39,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:10:39,517 INFO L264 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 15:10:39,518 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:10:39,522 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:39,523 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-12-07 15:10:39,523 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:10:39,526 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:39,526 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:10:39,526 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2019-12-07 15:10:39,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:39,657 INFO L343 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2019-12-07 15:10:39,657 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 49 [2019-12-07 15:10:39,658 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:10:39,666 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:10:39,666 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 15:10:39,666 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:73, output treesize:52 [2019-12-07 15:10:39,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:39,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:39,973 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 15:10:39,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:10:39,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 31 [2019-12-07 15:10:39,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570665527] [2019-12-07 15:10:39,974 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 15:10:39,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:39,974 INFO L82 PathProgramCache]: Analyzing trace with hash -64697695, now seen corresponding path program 4 times [2019-12-07 15:10:39,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:39,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538904148] [2019-12-07 15:10:39,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:39,986 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:10:41,333 WARN L192 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 231 DAG size of output: 164 [2019-12-07 15:10:41,613 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-12-07 15:10:41,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:10:41,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 15:10:41,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2019-12-07 15:10:41,614 INFO L87 Difference]: Start difference. First operand 894 states and 1263 transitions. cyclomatic complexity: 394 Second operand 31 states. [2019-12-07 15:10:42,691 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-12-07 15:10:44,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:44,939 INFO L93 Difference]: Finished difference Result 1128 states and 1556 transitions. [2019-12-07 15:10:44,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-07 15:10:44,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1128 states and 1556 transitions. [2019-12-07 15:10:44,942 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 558 [2019-12-07 15:10:44,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1128 states to 1128 states and 1556 transitions. [2019-12-07 15:10:44,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 643 [2019-12-07 15:10:44,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 643 [2019-12-07 15:10:44,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1128 states and 1556 transitions. [2019-12-07 15:10:44,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 15:10:44,949 INFO L688 BuchiCegarLoop]: Abstraction has 1128 states and 1556 transitions. [2019-12-07 15:10:44,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states and 1556 transitions. [2019-12-07 15:10:44,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 980. [2019-12-07 15:10:44,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-12-07 15:10:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1380 transitions. [2019-12-07 15:10:44,961 INFO L711 BuchiCegarLoop]: Abstraction has 980 states and 1380 transitions. [2019-12-07 15:10:44,961 INFO L591 BuchiCegarLoop]: Abstraction has 980 states and 1380 transitions. [2019-12-07 15:10:44,961 INFO L424 BuchiCegarLoop]: ======== Iteration 20============ [2019-12-07 15:10:44,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 980 states and 1380 transitions. [2019-12-07 15:10:44,963 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 499 [2019-12-07 15:10:44,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 15:10:44,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 15:10:44,964 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:10:44,964 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 2, 2, 1, 1, 1, 1] [2019-12-07 15:10:44,964 INFO L794 eck$LassoCheckResult]: Stem: 16531#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 16526#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; 16520#L565 assume !(main_~array_size~0 < 1); 16521#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; 16532#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); 16546#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 16547#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); 16543#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 16544#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); 16551#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 16550#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); 16549#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 16548#L552-3 assume !(lis_~i~0 < lis_~N); 16510#L552-4 lis_~i~0 := 1; 16511#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 16567#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; 16563#L556 assume !lis_#t~short11; 16562#L556-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7; 16561#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 16559#L555-3 assume !(lis_~j~0 < lis_~i~0); 16554#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 16555#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 16769#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; 16766#L556 assume !lis_#t~short11; 16763#L556-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7; 16761#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 16759#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; 16750#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; 16751#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 16775#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 16712#L555-3 assume !(lis_~j~0 < lis_~i~0); 16534#L554-2 [2019-12-07 15:10:44,964 INFO L796 eck$LassoCheckResult]: Loop: 16534#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 16536#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 17225#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; 17224#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; 17222#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 17221#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 17220#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; 17185#L556 assume !lis_#t~short11; 17186#L556-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7; 17113#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 17110#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; 17111#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; 17158#L556-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7; 16979#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 16980#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; 17143#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; 17156#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 17084#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 17083#L555-3 assume !(lis_~j~0 < lis_~i~0); 16534#L554-2 [2019-12-07 15:10:44,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:44,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1116187620, now seen corresponding path program 11 times [2019-12-07 15:10:44,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:44,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485376661] [2019-12-07 15:10:44,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:44,997 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:10:44,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:44,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1710309667, now seen corresponding path program 5 times [2019-12-07 15:10:44,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:44,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474842074] [2019-12-07 15:10:44,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:45,007 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:10:45,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:45,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1914566360, now seen corresponding path program 12 times [2019-12-07 15:10:45,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:45,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245498882] [2019-12-07 15:10:45,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:45,077 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 39 proven. 66 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-07 15:10:45,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245498882] [2019-12-07 15:10:45,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795738515] [2019-12-07 15:10:45,078 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:10:45,167 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-12-07 15:10:45,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:10:45,169 INFO L264 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 15:10:45,170 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:10:45,218 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 42 proven. 63 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-07 15:10:45,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:10:45,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-12-07 15:10:45,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355761970] [2019-12-07 15:10:46,061 WARN L192 SmtUtils]: Spent 840.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 154 [2019-12-07 15:10:46,220 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-07 15:10:46,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:10:46,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 15:10:46,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-12-07 15:10:46,221 INFO L87 Difference]: Start difference. First operand 980 states and 1380 transitions. cyclomatic complexity: 430 Second operand 17 states. [2019-12-07 15:10:46,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:46,478 INFO L93 Difference]: Finished difference Result 1240 states and 1663 transitions. [2019-12-07 15:10:46,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 15:10:46,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1240 states and 1663 transitions. [2019-12-07 15:10:46,481 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 442 [2019-12-07 15:10:46,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1240 states to 1161 states and 1565 transitions. [2019-12-07 15:10:46,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 667 [2019-12-07 15:10:46,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 697 [2019-12-07 15:10:46,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1161 states and 1565 transitions. [2019-12-07 15:10:46,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 15:10:46,486 INFO L688 BuchiCegarLoop]: Abstraction has 1161 states and 1565 transitions. [2019-12-07 15:10:46,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states and 1565 transitions. [2019-12-07 15:10:46,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 972. [2019-12-07 15:10:46,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-12-07 15:10:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1324 transitions. [2019-12-07 15:10:46,496 INFO L711 BuchiCegarLoop]: Abstraction has 972 states and 1324 transitions. [2019-12-07 15:10:46,496 INFO L591 BuchiCegarLoop]: Abstraction has 972 states and 1324 transitions. [2019-12-07 15:10:46,496 INFO L424 BuchiCegarLoop]: ======== Iteration 21============ [2019-12-07 15:10:46,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 972 states and 1324 transitions. [2019-12-07 15:10:46,498 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 442 [2019-12-07 15:10:46,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 15:10:46,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 15:10:46,498 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:10:46,498 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 15:10:46,498 INFO L794 eck$LassoCheckResult]: Stem: 18942#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 18937#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; 18932#L565 assume !(main_~array_size~0 < 1); 18933#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; 18943#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); 18959#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 18960#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); 18956#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 18957#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); 18964#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 18963#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); 18962#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 18961#L552-3 assume !(lis_~i~0 < lis_~N); 18922#L552-4 lis_~i~0 := 1; 18923#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 18977#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; 18976#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; 18973#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 18971#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 18972#L555-3 assume !(lis_~j~0 < lis_~i~0); 18966#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 18967#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 19258#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; 19256#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; 19255#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 19254#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 19253#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; 19251#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; 19250#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 19249#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 19248#L555-3 assume !(lis_~j~0 < lis_~i~0); 19246#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 19247#L554-3 assume !(lis_~i~0 < lis_~N); 18958#L554-4 lis_~i~0 := 0; 18930#L558-3 [2019-12-07 15:10:46,498 INFO L796 eck$LassoCheckResult]: Loop: 18930#L558-3 assume !!(lis_~i~0 < lis_~N);call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4); 18931#L559 assume lis_~max~0 < lis_#t~mem14;havoc lis_#t~mem14;call lis_#t~mem15 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);lis_~max~0 := lis_#t~mem15;havoc lis_#t~mem15; 18929#L558-2 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 18930#L558-3 [2019-12-07 15:10:46,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:46,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1729039269, now seen corresponding path program 2 times [2019-12-07 15:10:46,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:46,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016406022] [2019-12-07 15:10:46,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 15:10:46,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016406022] [2019-12-07 15:10:46,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419534625] [2019-12-07 15:10:46,611 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:10:46,649 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 15:10:46,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:10:46,649 INFO L264 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 15:10:46,650 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:10:46,706 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 15:10:46,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:10:46,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2019-12-07 15:10:46,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444054873] [2019-12-07 15:10:46,706 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 15:10:46,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:46,706 INFO L82 PathProgramCache]: Analyzing trace with hash 97415, now seen corresponding path program 2 times [2019-12-07 15:10:46,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:46,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134547895] [2019-12-07 15:10:46,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:46,709 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:10:46,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:10:46,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 15:10:46,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-12-07 15:10:46,730 INFO L87 Difference]: Start difference. First operand 972 states and 1324 transitions. cyclomatic complexity: 367 Second operand 21 states. [2019-12-07 15:10:47,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:47,710 INFO L93 Difference]: Finished difference Result 1088 states and 1473 transitions. [2019-12-07 15:10:47,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 15:10:47,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1088 states and 1473 transitions. [2019-12-07 15:10:47,718 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 442 [2019-12-07 15:10:47,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1088 states to 1088 states and 1473 transitions. [2019-12-07 15:10:47,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 637 [2019-12-07 15:10:47,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 637 [2019-12-07 15:10:47,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1088 states and 1473 transitions. [2019-12-07 15:10:47,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 15:10:47,734 INFO L688 BuchiCegarLoop]: Abstraction has 1088 states and 1473 transitions. [2019-12-07 15:10:47,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states and 1473 transitions. [2019-12-07 15:10:47,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 972. [2019-12-07 15:10:47,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-12-07 15:10:47,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1318 transitions. [2019-12-07 15:10:47,757 INFO L711 BuchiCegarLoop]: Abstraction has 972 states and 1318 transitions. [2019-12-07 15:10:47,757 INFO L591 BuchiCegarLoop]: Abstraction has 972 states and 1318 transitions. [2019-12-07 15:10:47,757 INFO L424 BuchiCegarLoop]: ======== Iteration 22============ [2019-12-07 15:10:47,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 972 states and 1318 transitions. [2019-12-07 15:10:47,759 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 442 [2019-12-07 15:10:47,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 15:10:47,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 15:10:47,760 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:10:47,760 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 1, 1, 1, 1] [2019-12-07 15:10:47,760 INFO L794 eck$LassoCheckResult]: Stem: 21145#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 21141#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; 21135#L565 assume !(main_~array_size~0 < 1); 21136#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; 21146#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); 21162#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 21163#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); 21160#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 21161#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); 21169#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 21168#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); 21165#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 21164#L552-3 assume !(lis_~i~0 < lis_~N); 21125#L552-4 lis_~i~0 := 1; 21126#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 21188#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; 21209#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; 21207#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 21205#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 21203#L555-3 assume !(lis_~j~0 < lis_~i~0); 21200#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 21198#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 21196#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; 21192#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; 21189#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 21190#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 21184#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; 21185#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; 21177#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 21178#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 21405#L555-3 assume !(lis_~j~0 < lis_~i~0); 21402#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 21155#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 21156#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; 22071#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; 22068#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 22067#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 22066#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; 21958#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; 21956#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 21955#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 21954#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; 21953#L556 assume !lis_#t~short11; 21924#L556-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7; 21921#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 21915#L555-3 assume !(lis_~j~0 < lis_~i~0); 21850#L554-2 [2019-12-07 15:10:47,761 INFO L796 eck$LassoCheckResult]: Loop: 21850#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 21912#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 21911#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; 21909#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; 21907#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 21906#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 21905#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; 21904#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; 21874#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 21872#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 21870#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; 21868#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; 21861#L556-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7; 21853#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 21849#L555-3 assume !(lis_~j~0 < lis_~i~0); 21850#L554-2 [2019-12-07 15:10:47,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:47,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1126410221, now seen corresponding path program 13 times [2019-12-07 15:10:47,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:47,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372700204] [2019-12-07 15:10:47,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:47,832 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:10:47,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:47,832 INFO L82 PathProgramCache]: Analyzing trace with hash -304941910, now seen corresponding path program 2 times [2019-12-07 15:10:47,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:47,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642836864] [2019-12-07 15:10:47,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:47,844 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:10:47,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:47,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1165691074, now seen corresponding path program 14 times [2019-12-07 15:10:47,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:47,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186543888] [2019-12-07 15:10:47,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:47,943 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 148 proven. 27 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 15:10:47,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186543888] [2019-12-07 15:10:47,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887315442] [2019-12-07 15:10:47,944 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:10:48,009 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 15:10:48,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:10:48,010 INFO L264 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 15:10:48,011 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:10:48,105 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 158 proven. 16 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-12-07 15:10:48,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:10:48,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-12-07 15:10:48,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607583060] [2019-12-07 15:10:48,876 WARN L192 SmtUtils]: Spent 768.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 144 [2019-12-07 15:10:49,003 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-12-07 15:10:49,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:10:49,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 15:10:49,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-12-07 15:10:49,003 INFO L87 Difference]: Start difference. First operand 972 states and 1318 transitions. cyclomatic complexity: 361 Second operand 22 states. [2019-12-07 15:10:49,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:49,303 INFO L93 Difference]: Finished difference Result 2210 states and 2972 transitions. [2019-12-07 15:10:49,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 15:10:49,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2210 states and 2972 transitions. [2019-12-07 15:10:49,308 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 560 [2019-12-07 15:10:49,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2210 states to 1756 states and 2417 transitions. [2019-12-07 15:10:49,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1088 [2019-12-07 15:10:49,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1088 [2019-12-07 15:10:49,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1756 states and 2417 transitions. [2019-12-07 15:10:49,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 15:10:49,316 INFO L688 BuchiCegarLoop]: Abstraction has 1756 states and 2417 transitions. [2019-12-07 15:10:49,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states and 2417 transitions. [2019-12-07 15:10:49,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 974. [2019-12-07 15:10:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-12-07 15:10:49,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1320 transitions. [2019-12-07 15:10:49,327 INFO L711 BuchiCegarLoop]: Abstraction has 974 states and 1320 transitions. [2019-12-07 15:10:49,327 INFO L591 BuchiCegarLoop]: Abstraction has 974 states and 1320 transitions. [2019-12-07 15:10:49,327 INFO L424 BuchiCegarLoop]: ======== Iteration 23============ [2019-12-07 15:10:49,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 974 states and 1320 transitions. [2019-12-07 15:10:49,328 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 442 [2019-12-07 15:10:49,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 15:10:49,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 15:10:49,329 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:10:49,329 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 15:10:49,329 INFO L794 eck$LassoCheckResult]: Stem: 24557#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 24553#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; 24547#L565 assume !(main_~array_size~0 < 1); 24548#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; 24558#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); 24572#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 24573#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); 24569#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 24570#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); 24581#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 24580#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); 24579#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 24578#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); 24575#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 24574#L552-3 assume !(lis_~i~0 < lis_~N); 24536#L552-4 lis_~i~0 := 1; 24537#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 24599#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; 24621#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; 24619#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 24617#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 24615#L555-3 assume !(lis_~j~0 < lis_~i~0); 24611#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 24609#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 24607#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; 24603#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; 24600#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 24597#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 24598#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; 24592#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; 24593#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 24889#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 24888#L555-3 assume !(lis_~j~0 < lis_~i~0); 24884#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 24885#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 25370#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; 25369#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; 25366#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 25367#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 25363#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; 25362#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; 25361#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 25360#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 25359#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; 25357#L556 assume !lis_#t~short11; 25358#L556-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7; 25465#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 25323#L555-3 assume !(lis_~j~0 < lis_~i~0); 25260#L554-2 [2019-12-07 15:10:49,329 INFO L796 eck$LassoCheckResult]: Loop: 25260#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 25322#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 25321#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; 25319#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; 25317#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 25316#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 25315#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; 25314#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; 25284#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 25282#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 25280#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; 25278#L556 assume !lis_#t~short11; 25265#L556-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7; 25263#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 25259#L555-3 assume !(lis_~j~0 < lis_~i~0); 25260#L554-2 [2019-12-07 15:10:49,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:49,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1768158641, now seen corresponding path program 15 times [2019-12-07 15:10:49,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:49,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081094491] [2019-12-07 15:10:49,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:49,392 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:10:49,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:49,392 INFO L82 PathProgramCache]: Analyzing trace with hash -304882328, now seen corresponding path program 6 times [2019-12-07 15:10:49,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:49,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178546817] [2019-12-07 15:10:49,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:49,401 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:10:49,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:49,401 INFO L82 PathProgramCache]: Analyzing trace with hash 953429338, now seen corresponding path program 16 times [2019-12-07 15:10:49,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:49,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594288735] [2019-12-07 15:10:49,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:49,515 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 98 proven. 76 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 15:10:49,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594288735] [2019-12-07 15:10:49,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241840832] [2019-12-07 15:10:49,516 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_291a5ed5-b7e9-49f1-8c54-4c27706f259d/bin/uautomizer/z3 Starting monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:10:49,571 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 15:10:49,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:10:49,573 INFO L264 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 15:10:49,573 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:10:49,626 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 158 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-12-07 15:10:49,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:10:49,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2019-12-07 15:10:49,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840887376] [2019-12-07 15:10:50,158 WARN L192 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 133 [2019-12-07 15:10:50,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:10:50,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 15:10:50,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2019-12-07 15:10:50,258 INFO L87 Difference]: Start difference. First operand 974 states and 1320 transitions. cyclomatic complexity: 361 Second operand 20 states. [2019-12-07 15:10:50,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:50,520 INFO L93 Difference]: Finished difference Result 1256 states and 1669 transitions. [2019-12-07 15:10:50,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 15:10:50,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1256 states and 1669 transitions. [2019-12-07 15:10:50,523 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 495 [2019-12-07 15:10:50,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1256 states to 967 states and 1279 transitions. [2019-12-07 15:10:50,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 775 [2019-12-07 15:10:50,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 957 [2019-12-07 15:10:50,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 967 states and 1279 transitions. [2019-12-07 15:10:50,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 15:10:50,528 INFO L688 BuchiCegarLoop]: Abstraction has 967 states and 1279 transitions. [2019-12-07 15:10:50,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states and 1279 transitions. [2019-12-07 15:10:50,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 448. [2019-12-07 15:10:50,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-12-07 15:10:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 583 transitions. [2019-12-07 15:10:50,534 INFO L711 BuchiCegarLoop]: Abstraction has 448 states and 583 transitions. [2019-12-07 15:10:50,534 INFO L591 BuchiCegarLoop]: Abstraction has 448 states and 583 transitions. [2019-12-07 15:10:50,534 INFO L424 BuchiCegarLoop]: ======== Iteration 24============ [2019-12-07 15:10:50,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 448 states and 583 transitions. [2019-12-07 15:10:50,536 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 183 [2019-12-07 15:10:50,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 15:10:50,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 15:10:50,536 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 6, 5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 15:10:50,537 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 1, 1, 1] [2019-12-07 15:10:50,537 INFO L794 eck$LassoCheckResult]: Stem: 27010#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 27008#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; 27004#L565 assume !(main_~array_size~0 < 1); 27005#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; 27011#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); 27021#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 27022#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); 27018#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 27019#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); 27030#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 27029#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); 27028#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 27027#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); 27024#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 27023#L552-3 assume !(lis_~i~0 < lis_~N); 26997#L552-4 lis_~i~0 := 1; 26998#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 27047#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; 27069#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; 27067#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 27065#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 27063#L555-3 assume !(lis_~j~0 < lis_~i~0); 27059#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 27057#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 27055#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; 27051#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; 27048#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 27049#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 27043#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; 27044#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; 27036#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 27037#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 27183#L555-3 assume !(lis_~j~0 < lis_~i~0); 27180#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 27179#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 27178#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; 27177#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; 27174#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 27175#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 27202#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; 27170#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; 27143#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 27129#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 27128#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; 27127#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; 27090#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 27089#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 27088#L555-3 assume !(lis_~j~0 < lis_~i~0); 27031#L554-2 [2019-12-07 15:10:50,537 INFO L796 eck$LassoCheckResult]: Loop: 27031#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 27025#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 27026#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; 27387#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; 27380#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 27379#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 27378#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; 27377#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; 27374#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 27373#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 27372#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; 27332#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; 27265#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 27264#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 27262#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; 27261#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; 27259#L556-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem7;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); 27260#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 27263#L555-3 assume !(lis_~j~0 < lis_~i~0); 27031#L554-2 [2019-12-07 15:10:50,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:50,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1768220145, now seen corresponding path program 9 times [2019-12-07 15:10:50,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:50,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048971199] [2019-12-07 15:10:50,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:50,605 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:10:50,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:50,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1023927711, now seen corresponding path program 10 times [2019-12-07 15:10:50,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:50,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391359433] [2019-12-07 15:10:50,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:50,627 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:10:50,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:50,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1394375059, now seen corresponding path program 10 times [2019-12-07 15:10:50,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:50,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894453318] [2019-12-07 15:10:50,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:10:50,737 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:10:53,353 WARN L192 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 261 DAG size of output: 183 [2019-12-07 15:10:54,196 WARN L192 SmtUtils]: Spent 834.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2019-12-07 15:11:45,060 WARN L192 SmtUtils]: Spent 50.86 s on a formula simplification. DAG size of input: 613 DAG size of output: 379 [2019-12-07 15:11:59,582 WARN L192 SmtUtils]: Spent 14.48 s on a formula simplification that was a NOOP. DAG size: 232 [2019-12-07 15:11:59,586 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 15:11:59,586 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 15:11:59,586 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 15:11:59,586 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 15:11:59,587 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 15:11:59,587 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 15:11:59,587 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 15:11:59,587 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 15:11:59,587 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration24_Lasso [2019-12-07 15:11:59,587 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 15:11:59,587 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 15:11:59,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:11:59,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:11:59,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:11:59,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:11:59,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:11:59,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:11:59,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:11:59,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:11:59,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:11:59,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:11:59,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:11:59,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:11:59,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:11:59,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:11:59,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:11:59,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:11:59,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:11:59,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:11:59,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 15:15:34,776 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.OutOfMemoryError: Java heap space at java.util.Arrays.copyOf(Arrays.java:3332) at java.lang.AbstractStringBuilder.ensureCapacityInternal(AbstractStringBuilder.java:124) at java.lang.AbstractStringBuilder.append(AbstractStringBuilder.java:448) at java.lang.StringBuilder.append(StringBuilder.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.niceTermString(MapEliminatorUtils.java:194) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.niceTermString(MapEliminatorUtils.java:194) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.niceTermString(MapEliminatorUtils.java:177) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.niceTermString(MapEliminatorUtils.java:194) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.niceTermString(MapEliminatorUtils.java:194) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.niceTermString(MapEliminatorUtils.java:177) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getAndAddAuxVar(MapEliminatorUtils.java:276) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:585) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) [2019-12-07 15:15:34,778 INFO L168 Benchmark]: Toolchain (without parser) took 417230.77 ms. Allocated memory was 1.0 GB in the beginning and 11.5 GB in the end (delta: 10.4 GB). Free memory was 943.3 MB in the beginning and 4.5 GB in the end (delta: -3.6 GB). Peak memory consumption was 13.8 GB. Max. memory is 11.5 GB. [2019-12-07 15:15:34,778 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:15:34,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -144.9 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2019-12-07 15:15:34,779 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:15:34,779 INFO L168 Benchmark]: Boogie Preprocessor took 21.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-12-07 15:15:34,779 INFO L168 Benchmark]: RCFGBuilder took 231.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2019-12-07 15:15:34,779 INFO L168 Benchmark]: BuchiAutomizer took 416637.70 ms. Allocated memory was 1.1 GB in the beginning and 11.5 GB in the end (delta: 10.3 GB). Free memory was 1.1 GB in the beginning and 4.5 GB in the end (delta: -3.4 GB). Peak memory consumption was 13.8 GB. Max. memory is 11.5 GB. [2019-12-07 15:15:34,780 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 306.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -144.9 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 231.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 416637.70 ms. Allocated memory was 1.1 GB in the beginning and 11.5 GB in the end (delta: 10.3 GB). Free memory was 1.1 GB in the beginning and 4.5 GB in the end (delta: -3.4 GB). Peak memory consumption was 13.8 GB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: OutOfMemoryError: Java heap space de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: OutOfMemoryError: Java heap space: java.util.Arrays.copyOf(Arrays.java:3332) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...