./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/lis-alloca-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/lis-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 111460b358d4c09612932eb239746dbb8202adb9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 03:25:52,027 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:25:52,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:25:52,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:25:52,048 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:25:52,049 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:25:52,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:25:52,052 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:25:52,054 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:25:52,056 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:25:52,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:25:52,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:25:52,059 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:25:52,060 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:25:52,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:25:52,062 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:25:52,063 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:25:52,064 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:25:52,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:25:52,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:25:52,070 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:25:52,071 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:25:52,072 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:25:52,073 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:25:52,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:25:52,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:25:52,076 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:25:52,077 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:25:52,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:25:52,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:25:52,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:25:52,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:25:52,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:25:52,082 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:25:52,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:25:52,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:25:52,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:25:52,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:25:52,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:25:52,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:25:52,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:25:52,088 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:25:52,105 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:25:52,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:25:52,107 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:25:52,107 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:25:52,108 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:25:52,108 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:25:52,108 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:25:52,109 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:25:52,109 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:25:52,109 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:25:52,109 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:25:52,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:25:52,110 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:25:52,110 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:25:52,111 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:25:52,111 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:25:52,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:25:52,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:25:52,112 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:25:52,112 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:25:52,112 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:25:52,112 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:25:52,113 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:25:52,113 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:25:52,113 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:25:52,114 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:25:52,114 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:25:52,114 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:25:52,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:25:52,114 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:25:52,115 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:25:52,115 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:25:52,116 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:25:52,116 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 111460b358d4c09612932eb239746dbb8202adb9 [2020-07-29 03:25:52,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:25:52,422 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:25:52,425 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:25:52,427 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:25:52,427 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:25:52,428 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2020-07-29 03:25:52,504 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d73cd02c/a4a0b34bcaf74d78aff85fafffa6c16c/FLAGb36a81b77 [2020-07-29 03:25:53,063 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:25:53,064 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2020-07-29 03:25:53,077 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d73cd02c/a4a0b34bcaf74d78aff85fafffa6c16c/FLAGb36a81b77 [2020-07-29 03:25:53,370 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d73cd02c/a4a0b34bcaf74d78aff85fafffa6c16c [2020-07-29 03:25:53,374 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:25:53,377 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:25:53,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:25:53,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:25:53,382 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:25:53,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:25:53" (1/1) ... [2020-07-29 03:25:53,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fdac70f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:53, skipping insertion in model container [2020-07-29 03:25:53,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:25:53" (1/1) ... [2020-07-29 03:25:53,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:25:53,438 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:25:53,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:25:53,908 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:25:53,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:25:54,034 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:25:54,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:54 WrapperNode [2020-07-29 03:25:54,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:25:54,038 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:25:54,038 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:25:54,038 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:25:54,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:54" (1/1) ... [2020-07-29 03:25:54,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:54" (1/1) ... [2020-07-29 03:25:54,120 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:25:54,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:25:54,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:25:54,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:25:54,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:54" (1/1) ... [2020-07-29 03:25:54,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:54" (1/1) ... [2020-07-29 03:25:54,135 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:54" (1/1) ... [2020-07-29 03:25:54,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:54" (1/1) ... [2020-07-29 03:25:54,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:54" (1/1) ... [2020-07-29 03:25:54,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:54" (1/1) ... [2020-07-29 03:25:54,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:54" (1/1) ... [2020-07-29 03:25:54,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:25:54,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:25:54,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:25:54,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:25:54,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:54,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 03:25:54,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 03:25:54,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 03:25:54,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:25:54,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:25:54,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:25:54,814 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:25:54,814 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-07-29 03:25:54,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:54 BoogieIcfgContainer [2020-07-29 03:25:54,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:25:54,822 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:25:54,822 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:25:54,826 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:25:54,827 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:54,828 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:25:53" (1/3) ... [2020-07-29 03:25:54,829 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2374c028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:25:54, skipping insertion in model container [2020-07-29 03:25:54,829 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:54,830 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:54" (2/3) ... [2020-07-29 03:25:54,831 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2374c028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:25:54, skipping insertion in model container [2020-07-29 03:25:54,832 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:54,832 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:54" (3/3) ... [2020-07-29 03:25:54,835 INFO L371 chiAutomizerObserver]: Analyzing ICFG lis-alloca-1.i [2020-07-29 03:25:54,892 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:25:54,892 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:25:54,892 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:25:54,892 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:25:54,893 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:25:54,893 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:25:54,893 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:25:54,894 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:25:54,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-07-29 03:25:54,941 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2020-07-29 03:25:54,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:54,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:54,947 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 03:25:54,947 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:54,947 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:25:54,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-07-29 03:25:54,953 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2020-07-29 03:25:54,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:54,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:54,954 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 03:25:54,954 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:54,961 INFO L794 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11#L-1true havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 15#L530true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 20#L530-2true call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 23#L535-3true [2020-07-29 03:25:54,961 INFO L796 eck$LassoCheckResult]: Loop: 23#L535-3true assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 10#L535-2true main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 23#L535-3true [2020-07-29 03:25:54,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:54,967 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-07-29 03:25:54,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:54,977 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904733818] [2020-07-29 03:25:54,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:55,077 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:55,089 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:55,110 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:55,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:55,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2020-07-29 03:25:55,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:55,113 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819811792] [2020-07-29 03:25:55,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:55,123 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:55,131 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:55,134 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:55,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:55,136 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2020-07-29 03:25:55,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:55,137 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606294477] [2020-07-29 03:25:55,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:55,162 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:55,178 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:55,183 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:55,402 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-07-29 03:25:55,491 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:55,491 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:55,492 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:55,492 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:55,492 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:55,492 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:55,492 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:55,493 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:55,493 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration1_Lasso [2020-07-29 03:25:55,493 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:55,493 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:55,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:55,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:55,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:55,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:55,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:55,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:55,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:55,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:55,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:55,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:56,358 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:56,362 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:56,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 [2020-07-29 03:25:56,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:56,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:56,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:56,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:56,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:56,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:56,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:56,381 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:56,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:56,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:56,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:56,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:56,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:56,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:56,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:56,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:56,426 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:56,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:56,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:56,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:56,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:56,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:56,469 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:56,469 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:56,474 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:56,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:56,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:56,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:56,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:56,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:56,516 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:56,516 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:56,520 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 03:25:56,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:56,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:56,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:56,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:56,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:56,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:56,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:56,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:56,564 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 03:25:56,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:56,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:56,596 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:56,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:56,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:56,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:56,597 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:56,597 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:56,599 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 03:25:56,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:56,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:56,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:56,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:56,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:56,646 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:56,646 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:56,663 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:56,828 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-07-29 03:25:56,828 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:56,837 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:56,841 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:25:56,841 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:56,842 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~array_size~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~array_size~0 Supporting invariants [] [2020-07-29 03:25:56,890 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 03:25:56,894 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19;" "main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18;" [2020-07-29 03:25:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:56,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:56,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:25:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:56,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:56,977 INFO L280 TraceCheckUtils]: 0: Hoare triple {35#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {35#unseeded} is VALID [2020-07-29 03:25:56,978 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#unseeded} havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; {35#unseeded} is VALID [2020-07-29 03:25:56,979 INFO L280 TraceCheckUtils]: 2: Hoare triple {35#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {35#unseeded} is VALID [2020-07-29 03:25:56,980 INFO L280 TraceCheckUtils]: 3: Hoare triple {35#unseeded} call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; {35#unseeded} is VALID [2020-07-29 03:25:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:56,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:25:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:56,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:57,016 INFO L280 TraceCheckUtils]: 0: Hoare triple {38#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~1) ULTIMATE.start_main_~array_size~0))} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {77#(and (<= ULTIMATE.start_main_~array_size~0 (+ oldRank0 ULTIMATE.start_main_~i~1)) (< ULTIMATE.start_main_~i~1 ULTIMATE.start_main_~array_size~0))} is VALID [2020-07-29 03:25:57,017 INFO L280 TraceCheckUtils]: 1: Hoare triple {77#(and (<= ULTIMATE.start_main_~array_size~0 (+ oldRank0 ULTIMATE.start_main_~i~1)) (< ULTIMATE.start_main_~i~1 ULTIMATE.start_main_~array_size~0))} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {63#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~1) ULTIMATE.start_main_~array_size~0)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:25:57,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:57,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:57,039 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:57,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:57,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,050 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:25:57,051 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 3 states. [2020-07-29 03:25:57,262 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 3 states. Result 65 states and 99 transitions. Complement of second has 7 states. [2020-07-29 03:25:57,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:25:57,263 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:57,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-07-29 03:25:57,267 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2020-07-29 03:25:57,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:57,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:57,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:57,275 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:25:57,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:57,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:57,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 99 transitions. [2020-07-29 03:25:57,279 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-07-29 03:25:57,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:57,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:57,282 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states. [2020-07-29 03:25:57,285 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2020-07-29 03:25:57,290 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2020-07-29 03:25:57,290 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:57,298 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:25:57,299 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:57,299 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 65 states and 99 transitions. cyclomatic complexity: 44 [2020-07-29 03:25:57,302 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 11 examples of accepted words. [2020-07-29 03:25:57,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:57,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:57,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:57,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:57,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:57,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:57,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:57,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:57,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:57,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 65 letters. Loop has 65 letters. [2020-07-29 03:25:57,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 65 letters. [2020-07-29 03:25:57,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 65 letters. Loop has 65 letters. [2020-07-29 03:25:57,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 03:25:57,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 03:25:57,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 25 letters. Loop has 25 letters. [2020-07-29 03:25:57,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:57,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:57,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:57,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:57,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:57,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:57,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:25:57,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:25:57,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:25:57,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:25:57,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:25:57,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:25:57,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:57,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:57,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:57,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:57,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:57,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:57,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:25:57,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:25:57,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:25:57,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:25:57,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:25:57,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:25:57,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:57,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:57,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:57,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:25:57,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:25:57,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:25:57,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:57,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:57,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:57,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:57,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:57,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:57,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:57,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:57,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:57,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:57,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:57,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:57,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:57,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:57,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:57,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:57,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:57,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:57,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:25:57,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:25:57,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:25:57,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:57,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:57,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:57,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:25:57,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:25:57,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:25:57,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:25:57,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:25:57,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:25:57,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:57,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:57,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:57,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:25:57,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:25:57,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:25:57,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:57,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:57,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:57,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:57,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:57,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:57,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:25:57,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:25:57,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:25:57,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:57,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:57,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:57,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:57,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:57,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 99 transitions. cyclomatic complexity: 44 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:57,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,392 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:57,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:57,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2020-07-29 03:25:57,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:57,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:57,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:57,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 99 transitions. cyclomatic complexity: 44 [2020-07-29 03:25:57,421 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-07-29 03:25:57,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 21 states and 30 transitions. [2020-07-29 03:25:57,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-07-29 03:25:57,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-07-29 03:25:57,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2020-07-29 03:25:57,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:57,438 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-07-29 03:25:57,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2020-07-29 03:25:57,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-29 03:25:57,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:57,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 30 transitions. Second operand 21 states. [2020-07-29 03:25:57,474 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 30 transitions. Second operand 21 states. [2020-07-29 03:25:57,476 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. Second operand 21 states. [2020-07-29 03:25:57,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:57,481 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. [2020-07-29 03:25:57,481 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 30 transitions. [2020-07-29 03:25:57,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:57,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:57,483 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states and 30 transitions. [2020-07-29 03:25:57,483 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states and 30 transitions. [2020-07-29 03:25:57,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:57,484 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. [2020-07-29 03:25:57,484 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 30 transitions. [2020-07-29 03:25:57,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:57,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:57,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:57,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:57,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-29 03:25:57,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2020-07-29 03:25:57,488 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-07-29 03:25:57,488 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-07-29 03:25:57,488 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:25:57,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2020-07-29 03:25:57,489 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-07-29 03:25:57,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:57,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:57,490 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:25:57,490 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:57,491 INFO L794 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 169#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 170#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 174#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 167#L535-3 assume !(main_~i~1 < main_~array_size~0); 168#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 160#L517-3 [2020-07-29 03:25:57,491 INFO L796 eck$LassoCheckResult]: Loop: 160#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 159#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 160#L517-3 [2020-07-29 03:25:57,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:57,492 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2020-07-29 03:25:57,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:57,493 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197798764] [2020-07-29 03:25:57,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:57,564 INFO L280 TraceCheckUtils]: 0: Hoare triple {222#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {222#true} is VALID [2020-07-29 03:25:57,565 INFO L280 TraceCheckUtils]: 1: Hoare triple {222#true} havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; {222#true} is VALID [2020-07-29 03:25:57,566 INFO L280 TraceCheckUtils]: 2: Hoare triple {222#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {224#(<= 1 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:25:57,567 INFO L280 TraceCheckUtils]: 3: Hoare triple {224#(<= 1 ULTIMATE.start_main_~array_size~0)} call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; {225#(and (<= 1 ULTIMATE.start_main_~array_size~0) (= 0 ULTIMATE.start_main_~i~1))} is VALID [2020-07-29 03:25:57,568 INFO L280 TraceCheckUtils]: 4: Hoare triple {225#(and (<= 1 ULTIMATE.start_main_~array_size~0) (= 0 ULTIMATE.start_main_~i~1))} assume !(main_~i~1 < main_~array_size~0); {223#false} is VALID [2020-07-29 03:25:57,568 INFO L280 TraceCheckUtils]: 5: Hoare triple {223#false} 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; {223#false} is VALID [2020-07-29 03:25:57,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:57,569 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197798764] [2020-07-29 03:25:57,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:25:57,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 03:25:57,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158347336] [2020-07-29 03:25:57,574 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:57,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:57,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2020-07-29 03:25:57,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:57,575 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429887643] [2020-07-29 03:25:57,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:57,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:57,584 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:57,593 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:57,595 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:57,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:57,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 03:25:57,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 03:25:57,665 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 4 states. [2020-07-29 03:25:57,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:57,778 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2020-07-29 03:25:57,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 03:25:57,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:25:57,790 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:57,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2020-07-29 03:25:57,793 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-07-29 03:25:57,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2020-07-29 03:25:57,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-07-29 03:25:57,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-07-29 03:25:57,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2020-07-29 03:25:57,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:57,795 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-07-29 03:25:57,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2020-07-29 03:25:57,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-07-29 03:25:57,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:57,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 30 transitions. Second operand 21 states. [2020-07-29 03:25:57,798 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 30 transitions. Second operand 21 states. [2020-07-29 03:25:57,798 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand 21 states. [2020-07-29 03:25:57,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:57,800 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2020-07-29 03:25:57,800 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2020-07-29 03:25:57,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:57,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:57,801 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states and 30 transitions. [2020-07-29 03:25:57,801 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states and 30 transitions. [2020-07-29 03:25:57,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:57,803 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2020-07-29 03:25:57,803 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2020-07-29 03:25:57,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:57,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:57,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:57,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:57,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-29 03:25:57,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2020-07-29 03:25:57,806 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-07-29 03:25:57,806 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-07-29 03:25:57,806 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:25:57,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2020-07-29 03:25:57,807 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-07-29 03:25:57,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:57,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:57,808 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:57,808 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:57,809 INFO L794 eck$LassoCheckResult]: Stem: 267#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 261#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 262#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 268#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 263#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 259#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 260#L535-3 assume !(main_~i~1 < main_~array_size~0); 264#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 254#L517-3 [2020-07-29 03:25:57,809 INFO L796 eck$LassoCheckResult]: Loop: 254#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 253#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 254#L517-3 [2020-07-29 03:25:57,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:57,809 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2020-07-29 03:25:57,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:57,810 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237558702] [2020-07-29 03:25:57,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:57,833 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:57,854 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:57,861 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:57,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:57,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2020-07-29 03:25:57,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:57,862 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270555020] [2020-07-29 03:25:57,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:57,871 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:57,878 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:57,880 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:57,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:57,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1899811567, now seen corresponding path program 1 times [2020-07-29 03:25:57,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:57,882 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432908476] [2020-07-29 03:25:57,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:57,912 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:57,954 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:57,965 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:58,482 WARN L193 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 100 [2020-07-29 03:25:58,709 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-07-29 03:25:58,713 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:58,713 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:58,713 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:58,713 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:58,713 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:58,713 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:58,714 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:58,714 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:58,714 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration3_Lasso [2020-07-29 03:25:58,714 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:58,714 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:58,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,271 WARN L193 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2020-07-29 03:25:59,393 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:25:59,394 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:25:59,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:00,102 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2020-07-29 03:26:00,515 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-07-29 03:26:00,814 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:00,815 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 03:26:00,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:00,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:00,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:00,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:00,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:00,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:00,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:00,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:00,838 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:00,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:00,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:00,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:00,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:00,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:00,887 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:00,887 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:00,900 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 03:26:00,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:00,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:00,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:00,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:00,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:00,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:00,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:00,938 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 03:26:00,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:00,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:00,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:00,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:00,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:00,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:00,995 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:01,024 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:01,100 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2020-07-29 03:26:01,100 INFO L444 ModelExtractionUtils]: 28 out of 58 variables were initially zero. Simplification set additionally 26 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:01,116 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:01,122 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 03:26:01,122 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:01,122 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_lis_#t~malloc3.base)_1, ULTIMATE.start_lis_~i~0) = 1*v_rep(select #length ULTIMATE.start_lis_#t~malloc3.base)_1 - 4*ULTIMATE.start_lis_~i~0 Supporting invariants [1*ULTIMATE.start_lis_~best~0.offset >= 0] [2020-07-29 03:26:01,263 INFO L297 tatePredicateManager]: 19 out of 22 supporting invariants were superfluous and have been removed [2020-07-29 03:26:01,274 INFO L393 LassoCheck]: Loop: "assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4);" "lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4;" [2020-07-29 03:26:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:01,281 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:26:01,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:01,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 03:26:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:01,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:01,352 INFO L280 TraceCheckUtils]: 0: Hoare triple {324#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {324#unseeded} is VALID [2020-07-29 03:26:01,353 INFO L280 TraceCheckUtils]: 1: Hoare triple {324#unseeded} havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; {324#unseeded} is VALID [2020-07-29 03:26:01,353 INFO L280 TraceCheckUtils]: 2: Hoare triple {324#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {324#unseeded} is VALID [2020-07-29 03:26:01,354 INFO L280 TraceCheckUtils]: 3: Hoare triple {324#unseeded} call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; {324#unseeded} is VALID [2020-07-29 03:26:01,355 INFO L280 TraceCheckUtils]: 4: Hoare triple {324#unseeded} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {324#unseeded} is VALID [2020-07-29 03:26:01,355 INFO L280 TraceCheckUtils]: 5: Hoare triple {324#unseeded} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {324#unseeded} is VALID [2020-07-29 03:26:01,356 INFO L280 TraceCheckUtils]: 6: Hoare triple {324#unseeded} assume !(main_~i~1 < main_~array_size~0); {324#unseeded} is VALID [2020-07-29 03:26:01,357 INFO L280 TraceCheckUtils]: 7: Hoare triple {324#unseeded} 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; {450#(and (= |ULTIMATE.start_lis_#t~malloc3.base| ULTIMATE.start_lis_~prev~0.base) (>= ULTIMATE.start_lis_~best~0.offset 0) (= (+ ULTIMATE.start_lis_~best~0.offset (* ULTIMATE.start_lis_~i~0 4)) (+ ULTIMATE.start_lis_~prev~0.offset (* ULTIMATE.start_lis_~i~0 4))) unseeded)} is VALID [2020-07-29 03:26:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:01,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 03:26:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:01,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:01,420 INFO L280 TraceCheckUtils]: 0: Hoare triple {451#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_lis_#t~malloc3.base|) (* (- 4) ULTIMATE.start_lis_~i~0))) (= |ULTIMATE.start_lis_#t~malloc3.base| ULTIMATE.start_lis_~prev~0.base) (>= ULTIMATE.start_lis_~best~0.offset 0) (= (+ ULTIMATE.start_lis_~best~0.offset (* ULTIMATE.start_lis_~i~0 4)) (+ ULTIMATE.start_lis_~prev~0.offset (* ULTIMATE.start_lis_~i~0 4))))} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {480#(and (<= (+ (* 4 ULTIMATE.start_lis_~i~0) ULTIMATE.start_lis_~prev~0.offset 4) (select |#length| ULTIMATE.start_lis_~prev~0.base)) (= |ULTIMATE.start_lis_#t~malloc3.base| ULTIMATE.start_lis_~prev~0.base) (<= 0 ULTIMATE.start_lis_~best~0.offset) (= ULTIMATE.start_lis_~best~0.offset ULTIMATE.start_lis_~prev~0.offset) (<= (select |#length| |ULTIMATE.start_lis_#t~malloc3.base|) (+ (* 4 ULTIMATE.start_lis_~i~0) oldRank0)))} is VALID [2020-07-29 03:26:01,422 INFO L280 TraceCheckUtils]: 1: Hoare triple {480#(and (<= (+ (* 4 ULTIMATE.start_lis_~i~0) ULTIMATE.start_lis_~prev~0.offset 4) (select |#length| ULTIMATE.start_lis_~prev~0.base)) (= |ULTIMATE.start_lis_#t~malloc3.base| ULTIMATE.start_lis_~prev~0.base) (<= 0 ULTIMATE.start_lis_~best~0.offset) (= ULTIMATE.start_lis_~best~0.offset ULTIMATE.start_lis_~prev~0.offset) (<= (select |#length| |ULTIMATE.start_lis_#t~malloc3.base|) (+ (* 4 ULTIMATE.start_lis_~i~0) oldRank0)))} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {453#(and (or (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_lis_#t~malloc3.base|) (* (- 4) ULTIMATE.start_lis_~i~0))) (>= oldRank0 0)) unseeded) (= |ULTIMATE.start_lis_#t~malloc3.base| ULTIMATE.start_lis_~prev~0.base) (>= ULTIMATE.start_lis_~best~0.offset 0) (= (+ ULTIMATE.start_lis_~best~0.offset (* ULTIMATE.start_lis_~i~0 4)) (+ ULTIMATE.start_lis_~prev~0.offset (* ULTIMATE.start_lis_~i~0 4))))} is VALID [2020-07-29 03:26:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:01,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:26:01,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:01,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:01,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,438 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:26:01,438 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-07-29 03:26:01,546 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 24 states and 35 transitions. Complement of second has 7 states. [2020-07-29 03:26:01,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:01,546 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:01,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. cyclomatic complexity: 12 [2020-07-29 03:26:01,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:01,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:01,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:26:01,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:01,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:01,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:01,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. [2020-07-29 03:26:01,548 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-29 03:26:01,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:01,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:01,549 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 29 transitions. cyclomatic complexity: 12 [2020-07-29 03:26:01,552 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 11 examples of accepted words. [2020-07-29 03:26:01,552 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:26:01,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:01,553 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:01,553 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 35 transitions. cyclomatic complexity: 15 [2020-07-29 03:26:01,555 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2020-07-29 03:26:01,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:01,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:01,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:01,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:01,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:01,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:01,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:01,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:01,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:01,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 12 Stem has 24 letters. Loop has 24 letters. [2020-07-29 03:26:01,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 03:26:01,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 24 letters. Loop has 24 letters. [2020-07-29 03:26:01,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 12 Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:26:01,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:26:01,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:26:01,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:01,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:01,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:01,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:01,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:01,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:01,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:01,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:01,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:01,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:01,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:01,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:01,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:26:01,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:26:01,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:26:01,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:26:01,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:26:01,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:26:01,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:01,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:01,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:01,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 12 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:01,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:01,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:01,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:26:01,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:26:01,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:26:01,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:01,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:01,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:01,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:26:01,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:26:01,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:26:01,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:01,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:01,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:01,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:01,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:01,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:01,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:01,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:01,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:01,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:01,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:01,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:01,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:01,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:01,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:01,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:01,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:01,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:01,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:26:01,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:26:01,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:26:01,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:26:01,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:26:01,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:26:01,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:26:01,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:26:01,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:26:01,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:01,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:01,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:01,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 12 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:01,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:01,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:01,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,576 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:01,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:26:01,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-07-29 03:26:01,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:01,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:26:01,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:01,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. cyclomatic complexity: 15 [2020-07-29 03:26:01,579 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-29 03:26:01,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 31 transitions. [2020-07-29 03:26:01,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 03:26:01,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-07-29 03:26:01,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2020-07-29 03:26:01,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:01,581 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-07-29 03:26:01,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2020-07-29 03:26:01,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-29 03:26:01,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:01,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 31 transitions. Second operand 22 states. [2020-07-29 03:26:01,583 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 31 transitions. Second operand 22 states. [2020-07-29 03:26:01,583 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 22 states. [2020-07-29 03:26:01,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:01,584 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2020-07-29 03:26:01,585 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2020-07-29 03:26:01,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:01,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:01,585 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states and 31 transitions. [2020-07-29 03:26:01,585 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states and 31 transitions. [2020-07-29 03:26:01,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:01,587 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2020-07-29 03:26:01,587 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2020-07-29 03:26:01,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:01,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:01,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:01,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:01,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 03:26:01,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2020-07-29 03:26:01,589 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-07-29 03:26:01,589 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-07-29 03:26:01,589 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:26:01,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2020-07-29 03:26:01,589 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-29 03:26:01,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:01,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:01,590 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:01,590 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:26:01,590 INFO L794 eck$LassoCheckResult]: Stem: 537#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 531#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 532#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 538#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 533#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 529#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 530#L535-3 assume !(main_~i~1 < main_~array_size~0); 534#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 525#L517-3 assume !(lis_~i~0 < lis_~N); 526#L517-4 lis_~i~0 := 1; 519#L519-3 [2020-07-29 03:26:01,590 INFO L796 eck$LassoCheckResult]: Loop: 519#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 521#L520-3 assume !(lis_~j~0 < lis_~i~0); 540#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 519#L519-3 [2020-07-29 03:26:01,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:01,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1899811625, now seen corresponding path program 1 times [2020-07-29 03:26:01,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:01,591 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945470942] [2020-07-29 03:26:01,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:01,645 INFO L280 TraceCheckUtils]: 0: Hoare triple {588#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {588#true} is VALID [2020-07-29 03:26:01,645 INFO L280 TraceCheckUtils]: 1: Hoare triple {588#true} havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; {588#true} is VALID [2020-07-29 03:26:01,646 INFO L280 TraceCheckUtils]: 2: Hoare triple {588#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {590#(<= 1 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:26:01,646 INFO L280 TraceCheckUtils]: 3: Hoare triple {590#(<= 1 ULTIMATE.start_main_~array_size~0)} call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; {590#(<= 1 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:26:01,647 INFO L280 TraceCheckUtils]: 4: Hoare triple {590#(<= 1 ULTIMATE.start_main_~array_size~0)} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {590#(<= 1 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:26:01,648 INFO L280 TraceCheckUtils]: 5: Hoare triple {590#(<= 1 ULTIMATE.start_main_~array_size~0)} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {590#(<= 1 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:26:01,648 INFO L280 TraceCheckUtils]: 6: Hoare triple {590#(<= 1 ULTIMATE.start_main_~array_size~0)} assume !(main_~i~1 < main_~array_size~0); {590#(<= 1 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:26:01,649 INFO L280 TraceCheckUtils]: 7: Hoare triple {590#(<= 1 ULTIMATE.start_main_~array_size~0)} 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; {591#(and (<= 1 ULTIMATE.start_lis_~N) (= 0 ULTIMATE.start_lis_~i~0))} is VALID [2020-07-29 03:26:01,650 INFO L280 TraceCheckUtils]: 8: Hoare triple {591#(and (<= 1 ULTIMATE.start_lis_~N) (= 0 ULTIMATE.start_lis_~i~0))} assume !(lis_~i~0 < lis_~N); {589#false} is VALID [2020-07-29 03:26:01,650 INFO L280 TraceCheckUtils]: 9: Hoare triple {589#false} lis_~i~0 := 1; {589#false} is VALID [2020-07-29 03:26:01,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:26:01,651 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945470942] [2020-07-29 03:26:01,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:26:01,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 03:26:01,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873502174] [2020-07-29 03:26:01,652 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:26:01,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:01,652 INFO L82 PathProgramCache]: Analyzing trace with hash 74687, now seen corresponding path program 1 times [2020-07-29 03:26:01,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:01,653 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655692039] [2020-07-29 03:26:01,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:01,656 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:01,658 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:01,660 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:01,679 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:01,680 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:01,680 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:01,680 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:01,680 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:26:01,680 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:01,680 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:01,680 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:01,680 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2020-07-29 03:26:01,680 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:01,681 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:01,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:01,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:01,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:01,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:01,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:01,855 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:01,856 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:01,868 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:26:01,868 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:01,874 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:26:01,874 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_3=1} Honda state: {v_rep~unnamed0~0~P_PID_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:01,921 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:26:01,921 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:01,925 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:26:01,925 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_3=2} Honda state: {v_rep~unnamed0~0~P_PGID_3=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:01,962 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:26:01,962 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:02,003 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:26:02,003 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:02,193 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:26:02,195 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:02,196 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:02,196 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:02,196 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:02,196 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:02,196 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:02,196 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:02,196 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:02,196 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2020-07-29 03:26:02,196 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:02,197 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:02,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,350 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:02,350 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:02,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:02,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:02,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:02,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:02,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:02,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:02,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:02,368 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:02,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:02,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:02,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:02,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:02,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:02,401 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:02,401 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:02,406 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:02,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:02,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:02,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:02,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:02,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:02,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:02,433 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:02,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:02,436 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:02,439 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:26:02,439 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:02,447 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:26:02,447 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:26:02,447 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:02,447 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0) = -2*ULTIMATE.start_lis_~i~0 + 1 Supporting invariants [] [2020-07-29 03:26:02,470 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:26:02,473 INFO L393 LassoCheck]: Loop: "assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0;" "assume !(lis_~j~0 < lis_~i~0);" "lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5;" [2020-07-29 03:26:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:02,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:02,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:26:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:02,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:02,532 INFO L280 TraceCheckUtils]: 0: Hoare triple {594#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {594#unseeded} is VALID [2020-07-29 03:26:02,533 INFO L280 TraceCheckUtils]: 1: Hoare triple {594#unseeded} havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; {594#unseeded} is VALID [2020-07-29 03:26:02,533 INFO L280 TraceCheckUtils]: 2: Hoare triple {594#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {594#unseeded} is VALID [2020-07-29 03:26:02,534 INFO L280 TraceCheckUtils]: 3: Hoare triple {594#unseeded} call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; {594#unseeded} is VALID [2020-07-29 03:26:02,534 INFO L280 TraceCheckUtils]: 4: Hoare triple {594#unseeded} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {594#unseeded} is VALID [2020-07-29 03:26:02,535 INFO L280 TraceCheckUtils]: 5: Hoare triple {594#unseeded} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {594#unseeded} is VALID [2020-07-29 03:26:02,535 INFO L280 TraceCheckUtils]: 6: Hoare triple {594#unseeded} assume !(main_~i~1 < main_~array_size~0); {594#unseeded} is VALID [2020-07-29 03:26:02,536 INFO L280 TraceCheckUtils]: 7: Hoare triple {594#unseeded} 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; {594#unseeded} is VALID [2020-07-29 03:26:02,536 INFO L280 TraceCheckUtils]: 8: Hoare triple {594#unseeded} assume !(lis_~i~0 < lis_~N); {594#unseeded} is VALID [2020-07-29 03:26:02,537 INFO L280 TraceCheckUtils]: 9: Hoare triple {594#unseeded} lis_~i~0 := 1; {594#unseeded} is VALID [2020-07-29 03:26:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:02,540 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:26:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:02,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:02,622 INFO L280 TraceCheckUtils]: 0: Hoare triple {597#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_lis_~i~0) 1))} assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; {639#(and (<= ULTIMATE.start_lis_~j~0 0) (<= 1 (+ (* 2 ULTIMATE.start_lis_~i~0) oldRank0)))} is VALID [2020-07-29 03:26:02,623 INFO L280 TraceCheckUtils]: 1: Hoare triple {639#(and (<= ULTIMATE.start_lis_~j~0 0) (<= 1 (+ (* 2 ULTIMATE.start_lis_~i~0) oldRank0)))} assume !(lis_~j~0 < lis_~i~0); {643#(and (<= ULTIMATE.start_lis_~i~0 0) (<= 1 (+ (* 2 ULTIMATE.start_lis_~i~0) oldRank0)))} is VALID [2020-07-29 03:26:02,624 INFO L280 TraceCheckUtils]: 2: Hoare triple {643#(and (<= ULTIMATE.start_lis_~i~0 0) (<= 1 (+ (* 2 ULTIMATE.start_lis_~i~0) oldRank0)))} lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; {607#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_lis_~i~0) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:26:02,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:02,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:26:02,636 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:02,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:02,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,637 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 [2020-07-29 03:26:02,638 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13 Second operand 4 states. [2020-07-29 03:26:02,829 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 43 states and 67 transitions. Complement of second has 9 states. [2020-07-29 03:26:02,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:02,829 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:02,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. cyclomatic complexity: 13 [2020-07-29 03:26:02,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:02,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:02,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 03:26:02,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:02,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:02,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:02,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 67 transitions. [2020-07-29 03:26:02,832 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2020-07-29 03:26:02,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:02,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:02,833 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 31 transitions. cyclomatic complexity: 13 [2020-07-29 03:26:02,835 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2020-07-29 03:26:02,835 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 03:26:02,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:02,836 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:02,836 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 67 transitions. cyclomatic complexity: 29 [2020-07-29 03:26:02,839 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2020-07-29 03:26:02,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:02,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:02,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:02,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:26:02,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:26:02,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:26:02,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:02,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:02,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:02,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 43 letters. Loop has 43 letters. [2020-07-29 03:26:02,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 43 letters. Loop has 43 letters. [2020-07-29 03:26:02,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 43 letters. Loop has 43 letters. [2020-07-29 03:26:02,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 22 letters. [2020-07-29 03:26:02,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 22 letters. Loop has 22 letters. [2020-07-29 03:26:02,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 22 letters. Loop has 22 letters. [2020-07-29 03:26:02,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:02,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:02,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:02,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:02,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:02,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:02,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:02,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:02,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:02,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:02,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:02,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:02,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:26:02,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:26:02,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:26:02,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:02,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:02,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:02,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:26:02,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:26:02,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:26:02,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:02,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:02,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:02,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:26:02,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:26:02,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:26:02,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:02,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:02,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:02,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:26:02,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:26:02,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:26:02,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:02,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:02,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:02,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:02,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:02,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:02,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:02,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:02,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:02,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 7 letters. [2020-07-29 03:26:02,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 7 letters. [2020-07-29 03:26:02,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 14 letters. Loop has 7 letters. [2020-07-29 03:26:02,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:26:02,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:26:02,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:26:02,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 7 letters. [2020-07-29 03:26:02,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 7 letters. [2020-07-29 03:26:02,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 16 letters. Loop has 7 letters. [2020-07-29 03:26:02,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 4 letters. [2020-07-29 03:26:02,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 03:26:02,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 16 letters. Loop has 4 letters. [2020-07-29 03:26:02,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 7 letters. [2020-07-29 03:26:02,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 7 letters. [2020-07-29 03:26:02,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 17 letters. Loop has 7 letters. [2020-07-29 03:26:02,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 7 letters. [2020-07-29 03:26:02,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 7 letters. [2020-07-29 03:26:02,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 12 letters. Loop has 7 letters. [2020-07-29 03:26:02,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:26:02,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:26:02,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:26:02,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 18 letters. Loop has 7 letters. [2020-07-29 03:26:02,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 7 letters. [2020-07-29 03:26:02,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 18 letters. Loop has 7 letters. [2020-07-29 03:26:02,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 7 letters. [2020-07-29 03:26:02,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 7 letters. [2020-07-29 03:26:02,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 13 letters. Loop has 7 letters. [2020-07-29 03:26:02,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 18 letters. Loop has 4 letters. [2020-07-29 03:26:02,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 03:26:02,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 67 transitions. cyclomatic complexity: 29 Stem has 18 letters. Loop has 4 letters. [2020-07-29 03:26:02,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,869 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 03:26:02,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-29 03:26:02,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:02,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:02,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 6 letters. [2020-07-29 03:26:02,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:02,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 67 transitions. cyclomatic complexity: 29 [2020-07-29 03:26:02,874 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2020-07-29 03:26:02,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 62 transitions. [2020-07-29 03:26:02,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-07-29 03:26:02,877 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-07-29 03:26:02,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 62 transitions. [2020-07-29 03:26:02,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:02,877 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 62 transitions. [2020-07-29 03:26:02,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 62 transitions. [2020-07-29 03:26:02,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2020-07-29 03:26:02,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:02,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states and 62 transitions. Second operand 33 states. [2020-07-29 03:26:02,880 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states and 62 transitions. Second operand 33 states. [2020-07-29 03:26:02,880 INFO L87 Difference]: Start difference. First operand 41 states and 62 transitions. Second operand 33 states. [2020-07-29 03:26:02,881 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:02,885 INFO L93 Difference]: Finished difference Result 41 states and 62 transitions. [2020-07-29 03:26:02,886 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 62 transitions. [2020-07-29 03:26:02,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:02,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:02,886 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 41 states and 62 transitions. [2020-07-29 03:26:02,887 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 41 states and 62 transitions. [2020-07-29 03:26:02,887 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:02,891 INFO L93 Difference]: Finished difference Result 42 states and 64 transitions. [2020-07-29 03:26:02,891 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 64 transitions. [2020-07-29 03:26:02,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:02,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:02,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:02,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-29 03:26:02,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2020-07-29 03:26:02,894 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 50 transitions. [2020-07-29 03:26:02,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:02,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 03:26:02,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 03:26:02,895 INFO L87 Difference]: Start difference. First operand 33 states and 50 transitions. Second operand 4 states. [2020-07-29 03:26:03,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:03,039 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2020-07-29 03:26:03,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 03:26:03,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:26:03,059 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:03,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2020-07-29 03:26:03,062 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-07-29 03:26:03,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 50 transitions. [2020-07-29 03:26:03,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-07-29 03:26:03,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-07-29 03:26:03,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2020-07-29 03:26:03,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:03,065 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 50 transitions. [2020-07-29 03:26:03,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2020-07-29 03:26:03,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-07-29 03:26:03,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:03,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states and 50 transitions. Second operand 33 states. [2020-07-29 03:26:03,068 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states and 50 transitions. Second operand 33 states. [2020-07-29 03:26:03,068 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand 33 states. [2020-07-29 03:26:03,069 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:03,071 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2020-07-29 03:26:03,072 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2020-07-29 03:26:03,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:03,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:03,072 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states and 50 transitions. [2020-07-29 03:26:03,072 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states and 50 transitions. [2020-07-29 03:26:03,073 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:03,076 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2020-07-29 03:26:03,076 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2020-07-29 03:26:03,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:03,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:03,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:03,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:03,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-29 03:26:03,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2020-07-29 03:26:03,079 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2020-07-29 03:26:03,079 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2020-07-29 03:26:03,079 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:26:03,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 49 transitions. [2020-07-29 03:26:03,080 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-07-29 03:26:03,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:03,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:03,080 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:03,080 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:03,081 INFO L794 eck$LassoCheckResult]: Stem: 970#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 962#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 963#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 971#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 964#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 960#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 961#L535-3 assume !(main_~i~1 < main_~array_size~0); 965#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 955#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 952#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 953#L517-3 assume !(lis_~i~0 < lis_~N); 956#L517-4 lis_~i~0 := 1; 959#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 949#L520-3 [2020-07-29 03:26:03,081 INFO L796 eck$LassoCheckResult]: Loop: 949#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 966#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 967#L521-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8; 972#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 974#L520-3 assume !(lis_~j~0 < lis_~i~0); 977#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 947#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 949#L520-3 [2020-07-29 03:26:03,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:03,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1792663252, now seen corresponding path program 1 times [2020-07-29 03:26:03,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:03,082 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372087861] [2020-07-29 03:26:03,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:03,195 INFO L280 TraceCheckUtils]: 0: Hoare triple {1138#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1138#true} is VALID [2020-07-29 03:26:03,195 INFO L280 TraceCheckUtils]: 1: Hoare triple {1138#true} havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; {1138#true} is VALID [2020-07-29 03:26:03,195 INFO L280 TraceCheckUtils]: 2: Hoare triple {1138#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {1138#true} is VALID [2020-07-29 03:26:03,196 INFO L280 TraceCheckUtils]: 3: Hoare triple {1138#true} call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; {1140#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:26:03,196 INFO L280 TraceCheckUtils]: 4: Hoare triple {1140#(= 0 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {1140#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:26:03,197 INFO L280 TraceCheckUtils]: 5: Hoare triple {1140#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {1141#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:26:03,198 INFO L280 TraceCheckUtils]: 6: Hoare triple {1141#(<= ULTIMATE.start_main_~i~1 1)} assume !(main_~i~1 < main_~array_size~0); {1142#(<= ULTIMATE.start_main_~array_size~0 1)} is VALID [2020-07-29 03:26:03,200 INFO L280 TraceCheckUtils]: 7: Hoare triple {1142#(<= ULTIMATE.start_main_~array_size~0 1)} 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; {1143#(<= ULTIMATE.start_lis_~N 1)} is VALID [2020-07-29 03:26:03,202 INFO L280 TraceCheckUtils]: 8: Hoare triple {1143#(<= ULTIMATE.start_lis_~N 1)} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {1143#(<= ULTIMATE.start_lis_~N 1)} is VALID [2020-07-29 03:26:03,209 INFO L280 TraceCheckUtils]: 9: Hoare triple {1143#(<= ULTIMATE.start_lis_~N 1)} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {1143#(<= ULTIMATE.start_lis_~N 1)} is VALID [2020-07-29 03:26:03,210 INFO L280 TraceCheckUtils]: 10: Hoare triple {1143#(<= ULTIMATE.start_lis_~N 1)} assume !(lis_~i~0 < lis_~N); {1143#(<= ULTIMATE.start_lis_~N 1)} is VALID [2020-07-29 03:26:03,214 INFO L280 TraceCheckUtils]: 11: Hoare triple {1143#(<= ULTIMATE.start_lis_~N 1)} lis_~i~0 := 1; {1144#(and (= ULTIMATE.start_lis_~i~0 1) (<= ULTIMATE.start_lis_~N 1))} is VALID [2020-07-29 03:26:03,241 INFO L280 TraceCheckUtils]: 12: Hoare triple {1144#(and (= ULTIMATE.start_lis_~i~0 1) (<= ULTIMATE.start_lis_~N 1))} assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; {1139#false} is VALID [2020-07-29 03:26:03,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:26:03,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372087861] [2020-07-29 03:26:03,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978288517] [2020-07-29 03:26:03,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:26:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:03,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:26:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:03,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:03,428 INFO L280 TraceCheckUtils]: 0: Hoare triple {1138#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1138#true} is VALID [2020-07-29 03:26:03,429 INFO L280 TraceCheckUtils]: 1: Hoare triple {1138#true} havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; {1138#true} is VALID [2020-07-29 03:26:03,429 INFO L280 TraceCheckUtils]: 2: Hoare triple {1138#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {1138#true} is VALID [2020-07-29 03:26:03,433 INFO L280 TraceCheckUtils]: 3: Hoare triple {1138#true} call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; {1157#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:26:03,434 INFO L280 TraceCheckUtils]: 4: Hoare triple {1157#(<= ULTIMATE.start_main_~i~1 0)} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {1157#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:26:03,435 INFO L280 TraceCheckUtils]: 5: Hoare triple {1157#(<= ULTIMATE.start_main_~i~1 0)} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {1141#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:26:03,436 INFO L280 TraceCheckUtils]: 6: Hoare triple {1141#(<= ULTIMATE.start_main_~i~1 1)} assume !(main_~i~1 < main_~array_size~0); {1142#(<= ULTIMATE.start_main_~array_size~0 1)} is VALID [2020-07-29 03:26:03,437 INFO L280 TraceCheckUtils]: 7: Hoare triple {1142#(<= ULTIMATE.start_main_~array_size~0 1)} 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; {1143#(<= ULTIMATE.start_lis_~N 1)} is VALID [2020-07-29 03:26:03,437 INFO L280 TraceCheckUtils]: 8: Hoare triple {1143#(<= ULTIMATE.start_lis_~N 1)} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {1143#(<= ULTIMATE.start_lis_~N 1)} is VALID [2020-07-29 03:26:03,438 INFO L280 TraceCheckUtils]: 9: Hoare triple {1143#(<= ULTIMATE.start_lis_~N 1)} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {1143#(<= ULTIMATE.start_lis_~N 1)} is VALID [2020-07-29 03:26:03,438 INFO L280 TraceCheckUtils]: 10: Hoare triple {1143#(<= ULTIMATE.start_lis_~N 1)} assume !(lis_~i~0 < lis_~N); {1143#(<= ULTIMATE.start_lis_~N 1)} is VALID [2020-07-29 03:26:03,439 INFO L280 TraceCheckUtils]: 11: Hoare triple {1143#(<= ULTIMATE.start_lis_~N 1)} lis_~i~0 := 1; {1182#(and (<= ULTIMATE.start_lis_~N 1) (<= 1 ULTIMATE.start_lis_~i~0))} is VALID [2020-07-29 03:26:03,439 INFO L280 TraceCheckUtils]: 12: Hoare triple {1182#(and (<= ULTIMATE.start_lis_~N 1) (<= 1 ULTIMATE.start_lis_~i~0))} assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; {1139#false} is VALID [2020-07-29 03:26:03,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:26:03,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:26:03,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-07-29 03:26:03,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856187366] [2020-07-29 03:26:03,441 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:26:03,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:03,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 1 times [2020-07-29 03:26:03,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:03,442 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085037545] [2020-07-29 03:26:03,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:03,451 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:03,458 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:03,461 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:03,643 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2020-07-29 03:26:03,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:03,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 03:26:03,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-29 03:26:03,714 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. cyclomatic complexity: 21 Second operand 9 states. [2020-07-29 03:26:04,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:04,064 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2020-07-29 03:26:04,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 03:26:04,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 03:26:04,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:04,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 71 transitions. [2020-07-29 03:26:04,094 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-07-29 03:26:04,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 71 transitions. [2020-07-29 03:26:04,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-07-29 03:26:04,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-07-29 03:26:04,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 71 transitions. [2020-07-29 03:26:04,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:04,096 INFO L688 BuchiCegarLoop]: Abstraction has 51 states and 71 transitions. [2020-07-29 03:26:04,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 71 transitions. [2020-07-29 03:26:04,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2020-07-29 03:26:04,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:04,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states and 71 transitions. Second operand 45 states. [2020-07-29 03:26:04,100 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states and 71 transitions. Second operand 45 states. [2020-07-29 03:26:04,100 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand 45 states. [2020-07-29 03:26:04,101 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:04,104 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2020-07-29 03:26:04,105 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2020-07-29 03:26:04,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:04,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:04,105 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 51 states and 71 transitions. [2020-07-29 03:26:04,105 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 51 states and 71 transitions. [2020-07-29 03:26:04,107 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:04,110 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2020-07-29 03:26:04,110 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2020-07-29 03:26:04,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:04,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:04,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:04,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:04,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-29 03:26:04,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2020-07-29 03:26:04,113 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 64 transitions. [2020-07-29 03:26:04,113 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 64 transitions. [2020-07-29 03:26:04,113 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 03:26:04,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 64 transitions. [2020-07-29 03:26:04,114 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-07-29 03:26:04,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:04,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:04,115 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:04,115 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:26:04,115 INFO L794 eck$LassoCheckResult]: Stem: 1267#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1259#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1260#L530 assume main_~array_size~0 < 1 || main_~array_size~0 >= 536870911;main_~array_size~0 := 1; 1268#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1261#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1257#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1258#L535-3 assume !(main_~i~1 < main_~array_size~0); 1262#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1253#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1250#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1251#L517-3 assume !(lis_~i~0 < lis_~N); 1254#L517-4 lis_~i~0 := 1; 1246#L519-3 assume !(lis_~i~0 < lis_~N); 1247#L519-4 lis_~i~0 := 0; 1252#L523-3 [2020-07-29 03:26:04,115 INFO L796 eck$LassoCheckResult]: Loop: 1252#L523-3 assume !!(lis_~i~0 < lis_~N);call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4); 1255#L524 assume lis_~max~0 < lis_#t~mem14;havoc lis_#t~mem14;call lis_#t~mem15 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);lis_~max~0 := lis_#t~mem15;havoc lis_#t~mem15; 1256#L523-2 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 1252#L523-3 [2020-07-29 03:26:04,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:04,116 INFO L82 PathProgramCache]: Analyzing trace with hash -520179462, now seen corresponding path program 1 times [2020-07-29 03:26:04,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:04,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878218177] [2020-07-29 03:26:04,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:04,134 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:04,158 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:04,170 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:04,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:04,170 INFO L82 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 1 times [2020-07-29 03:26:04,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:04,170 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468035565] [2020-07-29 03:26:04,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:04,182 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:04,193 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:04,194 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:04,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:04,195 INFO L82 PathProgramCache]: Analyzing trace with hash -424266948, now seen corresponding path program 1 times [2020-07-29 03:26:04,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:04,196 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711763996] [2020-07-29 03:26:04,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:04,215 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:04,231 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:04,239 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:05,016 WARN L193 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 133 [2020-07-29 03:26:05,431 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-07-29 03:26:05,435 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:05,435 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:05,435 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:05,435 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:05,435 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:05,436 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:05,436 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:05,436 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:05,436 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration6_Lasso [2020-07-29 03:26:05,436 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:05,436 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:05,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:05,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:05,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:05,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:05,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:05,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:05,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:05,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:05,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:05,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:05,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:05,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:05,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:05,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:05,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:05,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:05,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:05,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:05,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:05,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:05,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:05,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:05,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:05,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:05,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:05,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:06,069 WARN L193 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 91 [2020-07-29 03:26:06,109 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:26:06,110 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:26:06,721 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2020-07-29 03:26:07,121 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-07-29 03:26:07,355 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:07,355 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:07,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:07,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:07,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:07,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:07,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:07,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:07,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:07,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:07,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:07,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:07,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:07,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:07,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:07,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:07,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:07,390 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:07,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:07,404 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:07,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:07,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:07,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:07,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:07,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:07,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:07,431 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:07,436 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:07,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:07,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:07,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:07,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:07,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:07,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:07,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:07,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:07,463 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:07,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:07,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:07,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:07,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:07,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:07,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:07,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:07,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:07,491 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 03:26:07,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:07,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:07,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:07,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:07,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:07,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:07,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:07,522 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 03:26:07,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:07,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:07,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:07,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:07,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:07,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:07,548 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:07,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:07,550 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:07,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:07,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:07,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:07,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:07,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:07,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:07,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:07,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:07,585 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:07,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:07,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:07,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:07,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:07,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:07,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:07,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:07,621 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:07,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 [2020-07-29 03:26:07,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:07,647 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:07,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:07,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:07,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:07,647 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:07,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:07,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:07,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 [2020-07-29 03:26:07,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:07,676 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:07,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:07,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:07,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:07,677 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:07,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:07,679 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:07,702 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:07,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:07,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:07,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:07,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:07,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:07,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:07,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:07,706 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:07,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:07,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:07,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:07,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:07,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:07,737 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:07,738 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:07,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:07,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:07,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:07,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:07,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:07,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:07,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:07,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:07,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:07,768 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:07,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:07,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:07,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:07,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:07,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:07,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:07,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:07,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:07,799 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:07,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:07,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:07,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:07,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:07,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:07,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:07,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:07,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:07,827 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 03:26:07,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:07,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:07,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:07,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:07,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:07,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:07,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:07,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:07,853 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:07,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:07,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:07,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:07,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:07,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:07,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:07,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:07,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:07,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:07,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:07,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:07,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:07,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:07,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:07,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:07,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:07,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:07,909 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 03:26:07,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:07,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:07,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:07,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:07,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:07,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:07,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:07,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:07,936 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 03:26:07,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:07,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:07,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:07,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:07,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:07,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:07,962 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:07,966 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:07,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:07,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:07,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:07,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:07,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:07,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:07,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:07,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:07,994 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:08,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:08,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:08,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:08,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:08,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:08,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:08,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:08,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:08,023 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:08,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:08,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:08,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:08,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:08,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:08,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:08,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:08,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:08,049 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:08,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 [2020-07-29 03:26:08,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:08,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:08,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:08,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:08,080 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:08,080 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:08,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:08,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 Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:08,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:08,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:08,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:08,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:08,130 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:08,130 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:08,152 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:08,181 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-07-29 03:26:08,181 INFO L444 ModelExtractionUtils]: 42 out of 58 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:08,184 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:26:08,187 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:26:08,187 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:08,187 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~N) = -1*ULTIMATE.start_lis_~i~0 + 1*ULTIMATE.start_lis_~N Supporting invariants [] [2020-07-29 03:26:08,293 INFO L297 tatePredicateManager]: 19 out of 19 supporting invariants were superfluous and have been removed [2020-07-29 03:26:08,297 INFO L393 LassoCheck]: Loop: "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);" "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;" "lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13;" [2020-07-29 03:26:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:08,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:08,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:26:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:08,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:08,349 INFO L280 TraceCheckUtils]: 0: Hoare triple {1550#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1550#unseeded} is VALID [2020-07-29 03:26:08,350 INFO L280 TraceCheckUtils]: 1: Hoare triple {1550#unseeded} havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; {1550#unseeded} is VALID [2020-07-29 03:26:08,351 INFO L280 TraceCheckUtils]: 2: Hoare triple {1550#unseeded} assume main_~array_size~0 < 1 || main_~array_size~0 >= 536870911;main_~array_size~0 := 1; {1550#unseeded} is VALID [2020-07-29 03:26:08,351 INFO L280 TraceCheckUtils]: 3: Hoare triple {1550#unseeded} call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; {1550#unseeded} is VALID [2020-07-29 03:26:08,352 INFO L280 TraceCheckUtils]: 4: Hoare triple {1550#unseeded} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {1550#unseeded} is VALID [2020-07-29 03:26:08,352 INFO L280 TraceCheckUtils]: 5: Hoare triple {1550#unseeded} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {1550#unseeded} is VALID [2020-07-29 03:26:08,353 INFO L280 TraceCheckUtils]: 6: Hoare triple {1550#unseeded} assume !(main_~i~1 < main_~array_size~0); {1550#unseeded} is VALID [2020-07-29 03:26:08,353 INFO L280 TraceCheckUtils]: 7: Hoare triple {1550#unseeded} 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; {1550#unseeded} is VALID [2020-07-29 03:26:08,354 INFO L280 TraceCheckUtils]: 8: Hoare triple {1550#unseeded} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {1550#unseeded} is VALID [2020-07-29 03:26:08,354 INFO L280 TraceCheckUtils]: 9: Hoare triple {1550#unseeded} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {1550#unseeded} is VALID [2020-07-29 03:26:08,355 INFO L280 TraceCheckUtils]: 10: Hoare triple {1550#unseeded} assume !(lis_~i~0 < lis_~N); {1550#unseeded} is VALID [2020-07-29 03:26:08,355 INFO L280 TraceCheckUtils]: 11: Hoare triple {1550#unseeded} lis_~i~0 := 1; {1550#unseeded} is VALID [2020-07-29 03:26:08,356 INFO L280 TraceCheckUtils]: 12: Hoare triple {1550#unseeded} assume !(lis_~i~0 < lis_~N); {1550#unseeded} is VALID [2020-07-29 03:26:08,356 INFO L280 TraceCheckUtils]: 13: Hoare triple {1550#unseeded} lis_~i~0 := 0; {1550#unseeded} is VALID [2020-07-29 03:26:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:08,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:26:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:08,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:08,381 INFO L280 TraceCheckUtils]: 0: Hoare triple {1553#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_lis_~i~0) ULTIMATE.start_lis_~N))} 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); {1702#(and (< ULTIMATE.start_lis_~i~0 ULTIMATE.start_lis_~N) (<= ULTIMATE.start_lis_~N (+ ULTIMATE.start_lis_~i~0 oldRank0)))} is VALID [2020-07-29 03:26:08,382 INFO L280 TraceCheckUtils]: 1: Hoare triple {1702#(and (< ULTIMATE.start_lis_~i~0 ULTIMATE.start_lis_~N) (<= ULTIMATE.start_lis_~N (+ ULTIMATE.start_lis_~i~0 oldRank0)))} 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; {1702#(and (< ULTIMATE.start_lis_~i~0 ULTIMATE.start_lis_~N) (<= ULTIMATE.start_lis_~N (+ ULTIMATE.start_lis_~i~0 oldRank0)))} is VALID [2020-07-29 03:26:08,383 INFO L280 TraceCheckUtils]: 2: Hoare triple {1702#(and (< ULTIMATE.start_lis_~i~0 ULTIMATE.start_lis_~N) (<= ULTIMATE.start_lis_~N (+ ULTIMATE.start_lis_~i~0 oldRank0)))} lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; {1658#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_lis_~i~0) ULTIMATE.start_lis_~N))) unseeded)} is VALID [2020-07-29 03:26:08,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:08,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:26:08,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:08,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:08,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,394 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:26:08,394 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 64 transitions. cyclomatic complexity: 26 Second operand 3 states. [2020-07-29 03:26:08,455 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 64 transitions. cyclomatic complexity: 26. Second operand 3 states. Result 48 states and 69 transitions. Complement of second has 4 states. [2020-07-29 03:26:08,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:08,456 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:08,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 64 transitions. cyclomatic complexity: 26 [2020-07-29 03:26:08,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:08,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:08,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:26:08,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:08,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:08,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:08,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 69 transitions. [2020-07-29 03:26:08,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:26:08,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:08,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:08,458 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 64 transitions. cyclomatic complexity: 26 [2020-07-29 03:26:08,460 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2020-07-29 03:26:08,460 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:26:08,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:08,461 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:08,461 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 48 states and 69 transitions. cyclomatic complexity: 28 [2020-07-29 03:26:08,462 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 03:26:08,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:08,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:08,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 69 transitions. cyclomatic complexity: 28 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:08,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:08,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:08,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 69 transitions. cyclomatic complexity: 28 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:08,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 15 letters. Loop has 7 letters. [2020-07-29 03:26:08,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 7 letters. [2020-07-29 03:26:08,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 69 transitions. cyclomatic complexity: 28 Stem has 15 letters. Loop has 7 letters. [2020-07-29 03:26:08,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 48 letters. Loop has 48 letters. [2020-07-29 03:26:08,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 48 letters. [2020-07-29 03:26:08,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 69 transitions. cyclomatic complexity: 28 Stem has 48 letters. Loop has 48 letters. [2020-07-29 03:26:08,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 45 letters. Loop has 45 letters. [2020-07-29 03:26:08,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 45 letters. [2020-07-29 03:26:08,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 69 transitions. cyclomatic complexity: 28 Stem has 45 letters. Loop has 45 letters. [2020-07-29 03:26:08,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:26:08,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:26:08,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 69 transitions. cyclomatic complexity: 28 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:26:08,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:08,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:08,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 69 transitions. cyclomatic complexity: 28 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:08,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:08,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:08,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 69 transitions. cyclomatic complexity: 28 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:08,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:08,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:08,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 69 transitions. cyclomatic complexity: 28 Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:08,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:26:08,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:26:08,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 69 transitions. cyclomatic complexity: 28 Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:26:08,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 18 letters. Loop has 4 letters. [2020-07-29 03:26:08,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 03:26:08,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 69 transitions. cyclomatic complexity: 28 Stem has 18 letters. Loop has 4 letters. [2020-07-29 03:26:08,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:26:08,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:26:08,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 69 transitions. cyclomatic complexity: 28 Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:26:08,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 15 letters. Loop has 7 letters. [2020-07-29 03:26:08,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 7 letters. [2020-07-29 03:26:08,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 69 transitions. cyclomatic complexity: 28 Stem has 15 letters. Loop has 7 letters. [2020-07-29 03:26:08,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 20 letters. Loop has 7 letters. [2020-07-29 03:26:08,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 7 letters. [2020-07-29 03:26:08,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 69 transitions. cyclomatic complexity: 28 Stem has 20 letters. Loop has 7 letters. [2020-07-29 03:26:08,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 21 letters. Loop has 7 letters. [2020-07-29 03:26:08,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 03:26:08,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 69 transitions. cyclomatic complexity: 28 Stem has 21 letters. Loop has 7 letters. [2020-07-29 03:26:08,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 16 letters. Loop has 4 letters. [2020-07-29 03:26:08,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 03:26:08,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 69 transitions. cyclomatic complexity: 28 Stem has 16 letters. Loop has 4 letters. [2020-07-29 03:26:08,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:08,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:08,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 69 transitions. cyclomatic complexity: 28 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:08,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 20 letters. Loop has 7 letters. [2020-07-29 03:26:08,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 7 letters. [2020-07-29 03:26:08,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 69 transitions. cyclomatic complexity: 28 Stem has 20 letters. Loop has 7 letters. [2020-07-29 03:26:08,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 15 letters. Loop has 7 letters. [2020-07-29 03:26:08,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 7 letters. [2020-07-29 03:26:08,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 69 transitions. cyclomatic complexity: 28 Stem has 15 letters. Loop has 7 letters. [2020-07-29 03:26:08,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 21 letters. Loop has 7 letters. [2020-07-29 03:26:08,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 03:26:08,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 69 transitions. cyclomatic complexity: 28 Stem has 21 letters. Loop has 7 letters. [2020-07-29 03:26:08,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 16 letters. Loop has 4 letters. [2020-07-29 03:26:08,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 03:26:08,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 69 transitions. cyclomatic complexity: 28 Stem has 16 letters. Loop has 4 letters. [2020-07-29 03:26:08,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:26:08,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:26:08,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 69 transitions. cyclomatic complexity: 28 Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:26:08,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 18 letters. Loop has 4 letters. [2020-07-29 03:26:08,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 03:26:08,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 69 transitions. cyclomatic complexity: 28 Stem has 18 letters. Loop has 4 letters. [2020-07-29 03:26:08,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:26:08,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:26:08,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 69 transitions. cyclomatic complexity: 28 Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:26:08,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,482 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:08,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:26:08,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2020-07-29 03:26:08,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:08,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:08,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 14 letters. Loop has 6 letters. [2020-07-29 03:26:08,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:08,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 69 transitions. cyclomatic complexity: 28 [2020-07-29 03:26:08,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:26:08,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 31 states and 42 transitions. [2020-07-29 03:26:08,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 03:26:08,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 03:26:08,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 42 transitions. [2020-07-29 03:26:08,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:08,486 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-07-29 03:26:08,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 42 transitions. [2020-07-29 03:26:08,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-29 03:26:08,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:08,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states and 42 transitions. Second operand 31 states. [2020-07-29 03:26:08,489 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states and 42 transitions. Second operand 31 states. [2020-07-29 03:26:08,489 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 31 states. [2020-07-29 03:26:08,489 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:08,491 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2020-07-29 03:26:08,491 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2020-07-29 03:26:08,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:08,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:08,491 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states and 42 transitions. [2020-07-29 03:26:08,491 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states and 42 transitions. [2020-07-29 03:26:08,492 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:08,493 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2020-07-29 03:26:08,493 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2020-07-29 03:26:08,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:08,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:08,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:08,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:08,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-29 03:26:08,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-07-29 03:26:08,495 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-07-29 03:26:08,495 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-07-29 03:26:08,495 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 03:26:08,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2020-07-29 03:26:08,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:26:08,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:08,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:08,496 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:08,496 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:08,496 INFO L794 eck$LassoCheckResult]: Stem: 1782#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1774#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1775#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1784#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1776#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1772#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1773#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1777#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1793#L535-3 assume !(main_~i~1 < main_~array_size~0); 1783#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1769#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1767#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1768#L517-3 assume !(lis_~i~0 < lis_~N); 1770#L517-4 lis_~i~0 := 1; 1771#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1764#L520-3 [2020-07-29 03:26:08,497 INFO L796 eck$LassoCheckResult]: Loop: 1764#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1778#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1779#L521-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8; 1785#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1787#L520-3 assume !(lis_~j~0 < lis_~i~0); 1790#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1763#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1764#L520-3 [2020-07-29 03:26:08,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:08,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1166516274, now seen corresponding path program 2 times [2020-07-29 03:26:08,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:08,497 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634037800] [2020-07-29 03:26:08,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:08,607 INFO L280 TraceCheckUtils]: 0: Hoare triple {1941#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1941#true} is VALID [2020-07-29 03:26:08,607 INFO L280 TraceCheckUtils]: 1: Hoare triple {1941#true} havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; {1941#true} is VALID [2020-07-29 03:26:08,608 INFO L280 TraceCheckUtils]: 2: Hoare triple {1941#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {1941#true} is VALID [2020-07-29 03:26:08,609 INFO L280 TraceCheckUtils]: 3: Hoare triple {1941#true} call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; {1943#(and (= 0 ULTIMATE.start_main_~i~1) (= 0 ULTIMATE.start_main_~numbers~0.offset) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} is VALID [2020-07-29 03:26:08,610 INFO L280 TraceCheckUtils]: 4: Hoare triple {1943#(and (= 0 ULTIMATE.start_main_~i~1) (= 0 ULTIMATE.start_main_~numbers~0.offset) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {1943#(and (= 0 ULTIMATE.start_main_~i~1) (= 0 ULTIMATE.start_main_~numbers~0.offset) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} is VALID [2020-07-29 03:26:08,611 INFO L280 TraceCheckUtils]: 5: Hoare triple {1943#(and (= 0 ULTIMATE.start_main_~i~1) (= 0 ULTIMATE.start_main_~numbers~0.offset) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {1944#(and (<= 1 ULTIMATE.start_main_~i~1) (= 0 ULTIMATE.start_main_~numbers~0.offset) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} is VALID [2020-07-29 03:26:08,613 INFO L280 TraceCheckUtils]: 6: Hoare triple {1944#(and (<= 1 ULTIMATE.start_main_~i~1) (= 0 ULTIMATE.start_main_~numbers~0.offset) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {1945#(<= 2 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:26:08,613 INFO L280 TraceCheckUtils]: 7: Hoare triple {1945#(<= 2 ULTIMATE.start_main_~array_size~0)} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {1945#(<= 2 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:26:08,614 INFO L280 TraceCheckUtils]: 8: Hoare triple {1945#(<= 2 ULTIMATE.start_main_~array_size~0)} assume !(main_~i~1 < main_~array_size~0); {1945#(<= 2 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:26:08,615 INFO L280 TraceCheckUtils]: 9: Hoare triple {1945#(<= 2 ULTIMATE.start_main_~array_size~0)} 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; {1946#(and (<= 2 ULTIMATE.start_lis_~N) (= 0 ULTIMATE.start_lis_~i~0))} is VALID [2020-07-29 03:26:08,617 INFO L280 TraceCheckUtils]: 10: Hoare triple {1946#(and (<= 2 ULTIMATE.start_lis_~N) (= 0 ULTIMATE.start_lis_~i~0))} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {1946#(and (<= 2 ULTIMATE.start_lis_~N) (= 0 ULTIMATE.start_lis_~i~0))} is VALID [2020-07-29 03:26:08,618 INFO L280 TraceCheckUtils]: 11: Hoare triple {1946#(and (<= 2 ULTIMATE.start_lis_~N) (= 0 ULTIMATE.start_lis_~i~0))} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {1947#(<= (+ ULTIMATE.start_lis_~i~0 1) ULTIMATE.start_lis_~N)} is VALID [2020-07-29 03:26:08,618 INFO L280 TraceCheckUtils]: 12: Hoare triple {1947#(<= (+ ULTIMATE.start_lis_~i~0 1) ULTIMATE.start_lis_~N)} assume !(lis_~i~0 < lis_~N); {1942#false} is VALID [2020-07-29 03:26:08,619 INFO L280 TraceCheckUtils]: 13: Hoare triple {1942#false} lis_~i~0 := 1; {1942#false} is VALID [2020-07-29 03:26:08,619 INFO L280 TraceCheckUtils]: 14: Hoare triple {1942#false} assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; {1942#false} is VALID [2020-07-29 03:26:08,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:08,620 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634037800] [2020-07-29 03:26:08,620 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621232639] [2020-07-29 03:26:08,620 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:26:08,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 03:26:08,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:26:08,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:26:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:08,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:08,791 INFO L280 TraceCheckUtils]: 0: Hoare triple {1941#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1941#true} is VALID [2020-07-29 03:26:08,792 INFO L280 TraceCheckUtils]: 1: Hoare triple {1941#true} havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; {1941#true} is VALID [2020-07-29 03:26:08,792 INFO L280 TraceCheckUtils]: 2: Hoare triple {1941#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {1941#true} is VALID [2020-07-29 03:26:08,793 INFO L280 TraceCheckUtils]: 3: Hoare triple {1941#true} call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; {1941#true} is VALID [2020-07-29 03:26:08,793 INFO L280 TraceCheckUtils]: 4: Hoare triple {1941#true} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {1941#true} is VALID [2020-07-29 03:26:08,794 INFO L280 TraceCheckUtils]: 5: Hoare triple {1941#true} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {1941#true} is VALID [2020-07-29 03:26:08,794 INFO L280 TraceCheckUtils]: 6: Hoare triple {1941#true} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {1941#true} is VALID [2020-07-29 03:26:08,794 INFO L280 TraceCheckUtils]: 7: Hoare triple {1941#true} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {1941#true} is VALID [2020-07-29 03:26:08,795 INFO L280 TraceCheckUtils]: 8: Hoare triple {1941#true} assume !(main_~i~1 < main_~array_size~0); {1941#true} is VALID [2020-07-29 03:26:08,798 INFO L280 TraceCheckUtils]: 9: Hoare triple {1941#true} 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; {1978#(<= ULTIMATE.start_lis_~i~0 0)} is VALID [2020-07-29 03:26:08,799 INFO L280 TraceCheckUtils]: 10: Hoare triple {1978#(<= ULTIMATE.start_lis_~i~0 0)} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {1978#(<= ULTIMATE.start_lis_~i~0 0)} is VALID [2020-07-29 03:26:08,800 INFO L280 TraceCheckUtils]: 11: Hoare triple {1978#(<= ULTIMATE.start_lis_~i~0 0)} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {1985#(<= ULTIMATE.start_lis_~i~0 1)} is VALID [2020-07-29 03:26:08,801 INFO L280 TraceCheckUtils]: 12: Hoare triple {1985#(<= ULTIMATE.start_lis_~i~0 1)} assume !(lis_~i~0 < lis_~N); {1989#(<= ULTIMATE.start_lis_~N 1)} is VALID [2020-07-29 03:26:08,801 INFO L280 TraceCheckUtils]: 13: Hoare triple {1989#(<= ULTIMATE.start_lis_~N 1)} lis_~i~0 := 1; {1993#(and (<= ULTIMATE.start_lis_~N 1) (<= 1 ULTIMATE.start_lis_~i~0))} is VALID [2020-07-29 03:26:08,802 INFO L280 TraceCheckUtils]: 14: Hoare triple {1993#(and (<= ULTIMATE.start_lis_~N 1) (<= 1 ULTIMATE.start_lis_~i~0))} assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; {1942#false} is VALID [2020-07-29 03:26:08,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-29 03:26:08,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:26:08,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2020-07-29 03:26:08,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700851889] [2020-07-29 03:26:08,803 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:26:08,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:08,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 2 times [2020-07-29 03:26:08,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:08,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757197728] [2020-07-29 03:26:08,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:08,810 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:08,816 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:08,818 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:08,997 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2020-07-29 03:26:09,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:09,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 03:26:09,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-29 03:26:09,058 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. cyclomatic complexity: 15 Second operand 11 states. [2020-07-29 03:26:09,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:09,669 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2020-07-29 03:26:09,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 03:26:09,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 03:26:09,707 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:09,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 65 transitions. [2020-07-29 03:26:09,709 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2020-07-29 03:26:09,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 65 transitions. [2020-07-29 03:26:09,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-07-29 03:26:09,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-07-29 03:26:09,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 65 transitions. [2020-07-29 03:26:09,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:09,712 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 65 transitions. [2020-07-29 03:26:09,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 65 transitions. [2020-07-29 03:26:09,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 33. [2020-07-29 03:26:09,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:09,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states and 65 transitions. Second operand 33 states. [2020-07-29 03:26:09,714 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states and 65 transitions. Second operand 33 states. [2020-07-29 03:26:09,714 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand 33 states. [2020-07-29 03:26:09,715 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:09,716 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2020-07-29 03:26:09,716 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2020-07-29 03:26:09,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:09,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:09,717 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 47 states and 65 transitions. [2020-07-29 03:26:09,717 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 47 states and 65 transitions. [2020-07-29 03:26:09,717 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:09,718 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2020-07-29 03:26:09,719 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2020-07-29 03:26:09,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:09,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:09,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:09,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:09,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-29 03:26:09,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2020-07-29 03:26:09,720 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2020-07-29 03:26:09,720 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2020-07-29 03:26:09,720 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 03:26:09,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 44 transitions. [2020-07-29 03:26:09,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:26:09,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:09,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:09,721 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:09,722 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:09,722 INFO L794 eck$LassoCheckResult]: Stem: 2074#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2066#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 2067#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2076#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 2068#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 2064#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2065#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 2069#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2085#L535-3 assume !(main_~i~1 < main_~array_size~0); 2075#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 2060#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2058#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2059#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2061#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2084#L517-3 assume !(lis_~i~0 < lis_~N); 2062#L517-4 lis_~i~0 := 1; 2063#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2055#L520-3 [2020-07-29 03:26:09,722 INFO L796 eck$LassoCheckResult]: Loop: 2055#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2070#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 2071#L521-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8; 2077#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2079#L520-3 assume !(lis_~j~0 < lis_~i~0); 2082#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2054#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2055#L520-3 [2020-07-29 03:26:09,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:09,722 INFO L82 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 3 times [2020-07-29 03:26:09,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:09,723 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459415707] [2020-07-29 03:26:09,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:09,739 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:09,761 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:09,766 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:09,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:09,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 3 times [2020-07-29 03:26:09,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:09,767 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910088787] [2020-07-29 03:26:09,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:09,773 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:09,778 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:09,780 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:09,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:09,781 INFO L82 PathProgramCache]: Analyzing trace with hash 502604869, now seen corresponding path program 1 times [2020-07-29 03:26:09,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:09,781 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759644364] [2020-07-29 03:26:09,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:09,883 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2288#true} is VALID [2020-07-29 03:26:09,883 INFO L280 TraceCheckUtils]: 1: Hoare triple {2288#true} havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; {2288#true} is VALID [2020-07-29 03:26:09,883 INFO L280 TraceCheckUtils]: 2: Hoare triple {2288#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {2288#true} is VALID [2020-07-29 03:26:09,897 INFO L280 TraceCheckUtils]: 3: Hoare triple {2288#true} call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; {2290#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:26:09,903 INFO L280 TraceCheckUtils]: 4: Hoare triple {2290#(= 0 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {2290#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:26:09,904 INFO L280 TraceCheckUtils]: 5: Hoare triple {2290#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {2291#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:26:09,905 INFO L280 TraceCheckUtils]: 6: Hoare triple {2291#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {2291#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:26:09,909 INFO L280 TraceCheckUtils]: 7: Hoare triple {2291#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {2292#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:26:09,910 INFO L280 TraceCheckUtils]: 8: Hoare triple {2292#(<= ULTIMATE.start_main_~i~1 2)} assume !(main_~i~1 < main_~array_size~0); {2293#(<= ULTIMATE.start_main_~array_size~0 2)} is VALID [2020-07-29 03:26:09,911 INFO L280 TraceCheckUtils]: 9: Hoare triple {2293#(<= ULTIMATE.start_main_~array_size~0 2)} 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; {2294#(<= ULTIMATE.start_lis_~N 2)} is VALID [2020-07-29 03:26:09,912 INFO L280 TraceCheckUtils]: 10: Hoare triple {2294#(<= ULTIMATE.start_lis_~N 2)} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {2294#(<= ULTIMATE.start_lis_~N 2)} is VALID [2020-07-29 03:26:09,913 INFO L280 TraceCheckUtils]: 11: Hoare triple {2294#(<= ULTIMATE.start_lis_~N 2)} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {2294#(<= ULTIMATE.start_lis_~N 2)} is VALID [2020-07-29 03:26:09,914 INFO L280 TraceCheckUtils]: 12: Hoare triple {2294#(<= ULTIMATE.start_lis_~N 2)} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {2294#(<= ULTIMATE.start_lis_~N 2)} is VALID [2020-07-29 03:26:09,914 INFO L280 TraceCheckUtils]: 13: Hoare triple {2294#(<= ULTIMATE.start_lis_~N 2)} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {2294#(<= ULTIMATE.start_lis_~N 2)} is VALID [2020-07-29 03:26:09,915 INFO L280 TraceCheckUtils]: 14: Hoare triple {2294#(<= ULTIMATE.start_lis_~N 2)} assume !(lis_~i~0 < lis_~N); {2294#(<= ULTIMATE.start_lis_~N 2)} is VALID [2020-07-29 03:26:09,915 INFO L280 TraceCheckUtils]: 15: Hoare triple {2294#(<= ULTIMATE.start_lis_~N 2)} lis_~i~0 := 1; {2295#(and (<= ULTIMATE.start_lis_~N 2) (= ULTIMATE.start_lis_~i~0 1))} is VALID [2020-07-29 03:26:09,916 INFO L280 TraceCheckUtils]: 16: Hoare triple {2295#(and (<= ULTIMATE.start_lis_~N 2) (= ULTIMATE.start_lis_~i~0 1))} assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; {2295#(and (<= ULTIMATE.start_lis_~N 2) (= ULTIMATE.start_lis_~i~0 1))} is VALID [2020-07-29 03:26:09,916 INFO L280 TraceCheckUtils]: 17: Hoare triple {2295#(and (<= ULTIMATE.start_lis_~N 2) (= ULTIMATE.start_lis_~i~0 1))} assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; {2295#(and (<= ULTIMATE.start_lis_~N 2) (= ULTIMATE.start_lis_~i~0 1))} is VALID [2020-07-29 03:26:09,917 INFO L280 TraceCheckUtils]: 18: Hoare triple {2295#(and (<= ULTIMATE.start_lis_~N 2) (= ULTIMATE.start_lis_~i~0 1))} assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; {2295#(and (<= ULTIMATE.start_lis_~N 2) (= ULTIMATE.start_lis_~i~0 1))} is VALID [2020-07-29 03:26:09,918 INFO L280 TraceCheckUtils]: 19: Hoare triple {2295#(and (<= ULTIMATE.start_lis_~N 2) (= ULTIMATE.start_lis_~i~0 1))} assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8; {2295#(and (<= ULTIMATE.start_lis_~N 2) (= ULTIMATE.start_lis_~i~0 1))} is VALID [2020-07-29 03:26:09,918 INFO L280 TraceCheckUtils]: 20: Hoare triple {2295#(and (<= ULTIMATE.start_lis_~N 2) (= ULTIMATE.start_lis_~i~0 1))} lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; {2295#(and (<= ULTIMATE.start_lis_~N 2) (= ULTIMATE.start_lis_~i~0 1))} is VALID [2020-07-29 03:26:09,919 INFO L280 TraceCheckUtils]: 21: Hoare triple {2295#(and (<= ULTIMATE.start_lis_~N 2) (= ULTIMATE.start_lis_~i~0 1))} assume !(lis_~j~0 < lis_~i~0); {2295#(and (<= ULTIMATE.start_lis_~N 2) (= ULTIMATE.start_lis_~i~0 1))} is VALID [2020-07-29 03:26:09,920 INFO L280 TraceCheckUtils]: 22: Hoare triple {2295#(and (<= ULTIMATE.start_lis_~N 2) (= ULTIMATE.start_lis_~i~0 1))} lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; {2296#(<= ULTIMATE.start_lis_~N ULTIMATE.start_lis_~i~0)} is VALID [2020-07-29 03:26:09,920 INFO L280 TraceCheckUtils]: 23: Hoare triple {2296#(<= ULTIMATE.start_lis_~N ULTIMATE.start_lis_~i~0)} assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; {2289#false} is VALID [2020-07-29 03:26:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-29 03:26:09,921 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759644364] [2020-07-29 03:26:09,921 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601329501] [2020-07-29 03:26:09,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:26:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:09,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 03:26:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:09,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:10,184 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2288#true} is VALID [2020-07-29 03:26:10,185 INFO L280 TraceCheckUtils]: 1: Hoare triple {2288#true} havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; {2288#true} is VALID [2020-07-29 03:26:10,185 INFO L280 TraceCheckUtils]: 2: Hoare triple {2288#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {2288#true} is VALID [2020-07-29 03:26:10,186 INFO L280 TraceCheckUtils]: 3: Hoare triple {2288#true} call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; {2309#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:26:10,187 INFO L280 TraceCheckUtils]: 4: Hoare triple {2309#(<= ULTIMATE.start_main_~i~1 0)} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {2309#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:26:10,188 INFO L280 TraceCheckUtils]: 5: Hoare triple {2309#(<= ULTIMATE.start_main_~i~1 0)} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {2291#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:26:10,189 INFO L280 TraceCheckUtils]: 6: Hoare triple {2291#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {2291#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:26:10,190 INFO L280 TraceCheckUtils]: 7: Hoare triple {2291#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {2292#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:26:10,191 INFO L280 TraceCheckUtils]: 8: Hoare triple {2292#(<= ULTIMATE.start_main_~i~1 2)} assume !(main_~i~1 < main_~array_size~0); {2293#(<= ULTIMATE.start_main_~array_size~0 2)} is VALID [2020-07-29 03:26:10,192 INFO L280 TraceCheckUtils]: 9: Hoare triple {2293#(<= ULTIMATE.start_main_~array_size~0 2)} 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; {2294#(<= ULTIMATE.start_lis_~N 2)} is VALID [2020-07-29 03:26:10,192 INFO L280 TraceCheckUtils]: 10: Hoare triple {2294#(<= ULTIMATE.start_lis_~N 2)} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {2294#(<= ULTIMATE.start_lis_~N 2)} is VALID [2020-07-29 03:26:10,193 INFO L280 TraceCheckUtils]: 11: Hoare triple {2294#(<= ULTIMATE.start_lis_~N 2)} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {2294#(<= ULTIMATE.start_lis_~N 2)} is VALID [2020-07-29 03:26:10,193 INFO L280 TraceCheckUtils]: 12: Hoare triple {2294#(<= ULTIMATE.start_lis_~N 2)} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {2294#(<= ULTIMATE.start_lis_~N 2)} is VALID [2020-07-29 03:26:10,194 INFO L280 TraceCheckUtils]: 13: Hoare triple {2294#(<= ULTIMATE.start_lis_~N 2)} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {2294#(<= ULTIMATE.start_lis_~N 2)} is VALID [2020-07-29 03:26:10,194 INFO L280 TraceCheckUtils]: 14: Hoare triple {2294#(<= ULTIMATE.start_lis_~N 2)} assume !(lis_~i~0 < lis_~N); {2294#(<= ULTIMATE.start_lis_~N 2)} is VALID [2020-07-29 03:26:10,195 INFO L280 TraceCheckUtils]: 15: Hoare triple {2294#(<= ULTIMATE.start_lis_~N 2)} lis_~i~0 := 1; {2346#(and (<= ULTIMATE.start_lis_~N 2) (<= 1 ULTIMATE.start_lis_~i~0))} is VALID [2020-07-29 03:26:10,196 INFO L280 TraceCheckUtils]: 16: Hoare triple {2346#(and (<= ULTIMATE.start_lis_~N 2) (<= 1 ULTIMATE.start_lis_~i~0))} assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; {2346#(and (<= ULTIMATE.start_lis_~N 2) (<= 1 ULTIMATE.start_lis_~i~0))} is VALID [2020-07-29 03:26:10,197 INFO L280 TraceCheckUtils]: 17: Hoare triple {2346#(and (<= ULTIMATE.start_lis_~N 2) (<= 1 ULTIMATE.start_lis_~i~0))} assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; {2346#(and (<= ULTIMATE.start_lis_~N 2) (<= 1 ULTIMATE.start_lis_~i~0))} is VALID [2020-07-29 03:26:10,198 INFO L280 TraceCheckUtils]: 18: Hoare triple {2346#(and (<= ULTIMATE.start_lis_~N 2) (<= 1 ULTIMATE.start_lis_~i~0))} assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; {2346#(and (<= ULTIMATE.start_lis_~N 2) (<= 1 ULTIMATE.start_lis_~i~0))} is VALID [2020-07-29 03:26:10,198 INFO L280 TraceCheckUtils]: 19: Hoare triple {2346#(and (<= ULTIMATE.start_lis_~N 2) (<= 1 ULTIMATE.start_lis_~i~0))} assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8; {2346#(and (<= ULTIMATE.start_lis_~N 2) (<= 1 ULTIMATE.start_lis_~i~0))} is VALID [2020-07-29 03:26:10,199 INFO L280 TraceCheckUtils]: 20: Hoare triple {2346#(and (<= ULTIMATE.start_lis_~N 2) (<= 1 ULTIMATE.start_lis_~i~0))} lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; {2346#(and (<= ULTIMATE.start_lis_~N 2) (<= 1 ULTIMATE.start_lis_~i~0))} is VALID [2020-07-29 03:26:10,200 INFO L280 TraceCheckUtils]: 21: Hoare triple {2346#(and (<= ULTIMATE.start_lis_~N 2) (<= 1 ULTIMATE.start_lis_~i~0))} assume !(lis_~j~0 < lis_~i~0); {2346#(and (<= ULTIMATE.start_lis_~N 2) (<= 1 ULTIMATE.start_lis_~i~0))} is VALID [2020-07-29 03:26:10,200 INFO L280 TraceCheckUtils]: 22: Hoare triple {2346#(and (<= ULTIMATE.start_lis_~N 2) (<= 1 ULTIMATE.start_lis_~i~0))} lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; {2368#(and (<= ULTIMATE.start_lis_~N 2) (<= 2 ULTIMATE.start_lis_~i~0))} is VALID [2020-07-29 03:26:10,201 INFO L280 TraceCheckUtils]: 23: Hoare triple {2368#(and (<= ULTIMATE.start_lis_~N 2) (<= 2 ULTIMATE.start_lis_~i~0))} assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; {2289#false} is VALID [2020-07-29 03:26:10,203 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-29 03:26:10,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:26:10,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2020-07-29 03:26:10,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027581984] [2020-07-29 03:26:10,365 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2020-07-29 03:26:10,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:10,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-29 03:26:10,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-29 03:26:10,428 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. cyclomatic complexity: 15 Second operand 12 states. [2020-07-29 03:26:10,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:10,874 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2020-07-29 03:26:10,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 03:26:10,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-29 03:26:10,926 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:10,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 78 transitions. [2020-07-29 03:26:10,928 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2020-07-29 03:26:10,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 49 states and 64 transitions. [2020-07-29 03:26:10,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-07-29 03:26:10,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-07-29 03:26:10,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 64 transitions. [2020-07-29 03:26:10,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:10,931 INFO L688 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2020-07-29 03:26:10,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 64 transitions. [2020-07-29 03:26:10,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2020-07-29 03:26:10,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:10,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states and 64 transitions. Second operand 47 states. [2020-07-29 03:26:10,934 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states and 64 transitions. Second operand 47 states. [2020-07-29 03:26:10,934 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand 47 states. [2020-07-29 03:26:10,934 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:10,936 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2020-07-29 03:26:10,936 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2020-07-29 03:26:10,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:10,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:10,937 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states and 64 transitions. [2020-07-29 03:26:10,937 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states and 64 transitions. [2020-07-29 03:26:10,937 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:10,939 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2020-07-29 03:26:10,939 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2020-07-29 03:26:10,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:10,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:10,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:10,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:10,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-29 03:26:10,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-07-29 03:26:10,941 INFO L711 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-07-29 03:26:10,941 INFO L591 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-07-29 03:26:10,941 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 03:26:10,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 62 transitions. [2020-07-29 03:26:10,942 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2020-07-29 03:26:10,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:10,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:10,942 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:10,942 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:26:10,942 INFO L794 eck$LassoCheckResult]: Stem: 2459#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2451#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 2452#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2461#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 2453#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 2449#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2450#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 2454#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2483#L535-3 assume !(main_~i~1 < main_~array_size~0); 2482#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 2481#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2480#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2478#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2477#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2476#L517-3 assume !(lis_~i~0 < lis_~N); 2475#L517-4 lis_~i~0 := 1; 2439#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2440#L520-3 [2020-07-29 03:26:10,942 INFO L796 eck$LassoCheckResult]: Loop: 2440#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2455#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 2456#L521-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8; 2465#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2440#L520-3 [2020-07-29 03:26:10,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:10,943 INFO L82 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 4 times [2020-07-29 03:26:10,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:10,943 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415503996] [2020-07-29 03:26:10,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:10,958 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:10,971 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:10,976 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:10,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:10,977 INFO L82 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 1 times [2020-07-29 03:26:10,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:10,977 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485380197] [2020-07-29 03:26:10,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:10,982 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:10,986 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:10,988 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:10,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:10,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2057178037, now seen corresponding path program 1 times [2020-07-29 03:26:10,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:10,989 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176604953] [2020-07-29 03:26:10,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:11,416 INFO L280 TraceCheckUtils]: 0: Hoare triple {2737#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2737#true} is VALID [2020-07-29 03:26:11,416 INFO L280 TraceCheckUtils]: 1: Hoare triple {2737#true} havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; {2737#true} is VALID [2020-07-29 03:26:11,416 INFO L280 TraceCheckUtils]: 2: Hoare triple {2737#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {2737#true} is VALID [2020-07-29 03:26:11,417 INFO L280 TraceCheckUtils]: 3: Hoare triple {2737#true} call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; {2739#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:26:11,418 INFO L280 TraceCheckUtils]: 4: Hoare triple {2739#(= 0 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {2739#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:26:11,418 INFO L280 TraceCheckUtils]: 5: Hoare triple {2739#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {2737#true} is VALID [2020-07-29 03:26:11,419 INFO L280 TraceCheckUtils]: 6: Hoare triple {2737#true} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {2737#true} is VALID [2020-07-29 03:26:11,419 INFO L280 TraceCheckUtils]: 7: Hoare triple {2737#true} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {2737#true} is VALID [2020-07-29 03:26:11,419 INFO L280 TraceCheckUtils]: 8: Hoare triple {2737#true} assume !(main_~i~1 < main_~array_size~0); {2737#true} is VALID [2020-07-29 03:26:11,422 INFO L280 TraceCheckUtils]: 9: Hoare triple {2737#true} 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; {2740#(and (not (= ULTIMATE.start_lis_~prev~0.base ULTIMATE.start_lis_~best~0.base)) (= 0 ULTIMATE.start_lis_~best~0.offset) (= 0 ULTIMATE.start_lis_~i~0))} is VALID [2020-07-29 03:26:11,424 INFO L280 TraceCheckUtils]: 10: Hoare triple {2740#(and (not (= ULTIMATE.start_lis_~prev~0.base ULTIMATE.start_lis_~best~0.base)) (= 0 ULTIMATE.start_lis_~best~0.offset) (= 0 ULTIMATE.start_lis_~i~0))} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {2741#(and (not (= ULTIMATE.start_lis_~prev~0.base ULTIMATE.start_lis_~best~0.base)) (= 0 ULTIMATE.start_lis_~best~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ (* ULTIMATE.start_lis_~i~0 4) ULTIMATE.start_lis_~best~0.offset))) (= 0 ULTIMATE.start_lis_~i~0))} is VALID [2020-07-29 03:26:11,425 INFO L280 TraceCheckUtils]: 11: Hoare triple {2741#(and (not (= ULTIMATE.start_lis_~prev~0.base ULTIMATE.start_lis_~best~0.base)) (= 0 ULTIMATE.start_lis_~best~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ (* ULTIMATE.start_lis_~i~0 4) ULTIMATE.start_lis_~best~0.offset))) (= 0 ULTIMATE.start_lis_~i~0))} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {2742#(and (not (= ULTIMATE.start_lis_~prev~0.base ULTIMATE.start_lis_~best~0.base)) (= 1 (select (store (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ (* ULTIMATE.start_lis_~i~0 4) ULTIMATE.start_lis_~best~0.offset) 1) 0)) (= 0 ULTIMATE.start_lis_~best~0.offset) (= 4 (+ (* 4 ULTIMATE.start_lis_~i~0) ULTIMATE.start_lis_~best~0.offset)))} is VALID [2020-07-29 03:26:11,427 INFO L280 TraceCheckUtils]: 12: Hoare triple {2742#(and (not (= ULTIMATE.start_lis_~prev~0.base ULTIMATE.start_lis_~best~0.base)) (= 1 (select (store (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ (* ULTIMATE.start_lis_~i~0 4) ULTIMATE.start_lis_~best~0.offset) 1) 0)) (= 0 ULTIMATE.start_lis_~best~0.offset) (= 4 (+ (* 4 ULTIMATE.start_lis_~i~0) ULTIMATE.start_lis_~best~0.offset)))} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {2743#(and (= (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) 0) 1) (= 0 ULTIMATE.start_lis_~best~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) 4)))} is VALID [2020-07-29 03:26:11,429 INFO L280 TraceCheckUtils]: 13: Hoare triple {2743#(and (= (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) 0) 1) (= 0 ULTIMATE.start_lis_~best~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) 4)))} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {2743#(and (= (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) 0) 1) (= 0 ULTIMATE.start_lis_~best~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) 4)))} is VALID [2020-07-29 03:26:11,430 INFO L280 TraceCheckUtils]: 14: Hoare triple {2743#(and (= (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) 0) 1) (= 0 ULTIMATE.start_lis_~best~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) 4)))} assume !(lis_~i~0 < lis_~N); {2743#(and (= (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) 0) 1) (= 0 ULTIMATE.start_lis_~best~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) 4)))} is VALID [2020-07-29 03:26:11,431 INFO L280 TraceCheckUtils]: 15: Hoare triple {2743#(and (= (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) 0) 1) (= 0 ULTIMATE.start_lis_~best~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) 4)))} lis_~i~0 := 1; {2744#(and (= (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) 0) 1) (= 1 ULTIMATE.start_lis_~i~0) (= 0 ULTIMATE.start_lis_~best~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ (* ULTIMATE.start_lis_~i~0 4) ULTIMATE.start_lis_~best~0.offset))))} is VALID [2020-07-29 03:26:11,432 INFO L280 TraceCheckUtils]: 16: Hoare triple {2744#(and (= (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) 0) 1) (= 1 ULTIMATE.start_lis_~i~0) (= 0 ULTIMATE.start_lis_~best~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ (* ULTIMATE.start_lis_~i~0 4) ULTIMATE.start_lis_~best~0.offset))))} assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; {2745#(and (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ (* ULTIMATE.start_lis_~j~0 4) ULTIMATE.start_lis_~best~0.offset))) (= 0 ULTIMATE.start_lis_~j~0) (= 1 ULTIMATE.start_lis_~i~0) (= 0 ULTIMATE.start_lis_~best~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ (* ULTIMATE.start_lis_~i~0 4) ULTIMATE.start_lis_~best~0.offset))))} is VALID [2020-07-29 03:26:11,433 INFO L280 TraceCheckUtils]: 17: Hoare triple {2745#(and (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ (* ULTIMATE.start_lis_~j~0 4) ULTIMATE.start_lis_~best~0.offset))) (= 0 ULTIMATE.start_lis_~j~0) (= 1 ULTIMATE.start_lis_~i~0) (= 0 ULTIMATE.start_lis_~best~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ (* ULTIMATE.start_lis_~i~0 4) ULTIMATE.start_lis_~best~0.offset))))} assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; {2745#(and (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ (* ULTIMATE.start_lis_~j~0 4) ULTIMATE.start_lis_~best~0.offset))) (= 0 ULTIMATE.start_lis_~j~0) (= 1 ULTIMATE.start_lis_~i~0) (= 0 ULTIMATE.start_lis_~best~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ (* ULTIMATE.start_lis_~i~0 4) ULTIMATE.start_lis_~best~0.offset))))} is VALID [2020-07-29 03:26:11,435 INFO L280 TraceCheckUtils]: 18: Hoare triple {2745#(and (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ (* ULTIMATE.start_lis_~j~0 4) ULTIMATE.start_lis_~best~0.offset))) (= 0 ULTIMATE.start_lis_~j~0) (= 1 ULTIMATE.start_lis_~i~0) (= 0 ULTIMATE.start_lis_~best~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ (* ULTIMATE.start_lis_~i~0 4) ULTIMATE.start_lis_~best~0.offset))))} assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; {2746#|ULTIMATE.start_lis_#t~short11|} is VALID [2020-07-29 03:26:11,435 INFO L280 TraceCheckUtils]: 19: Hoare triple {2746#|ULTIMATE.start_lis_#t~short11|} assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8; {2738#false} is VALID [2020-07-29 03:26:11,435 INFO L280 TraceCheckUtils]: 20: Hoare triple {2738#false} lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; {2738#false} is VALID [2020-07-29 03:26:11,437 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:26:11,438 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176604953] [2020-07-29 03:26:11,438 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697597824] [2020-07-29 03:26:11,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:26:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:11,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-29 03:26:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:11,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:11,569 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2020-07-29 03:26:11,571 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:26:11,573 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:26:11,574 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 03:26:11,574 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2020-07-29 03:26:11,732 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:26:11,732 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_140|, ULTIMATE.start_main_~numbers~0.base]. (and (= 0 (select |v_#valid_140| ULTIMATE.start_main_~numbers~0.base)) (= (store |v_#valid_140| ULTIMATE.start_main_~numbers~0.base 1) |#valid|)) [2020-07-29 03:26:11,732 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_~numbers~0.base]. (= 1 (select |#valid| ULTIMATE.start_main_~numbers~0.base)) [2020-07-29 03:26:11,827 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:26:11,828 INFO L384 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 15 treesize of output 19 [2020-07-29 03:26:11,829 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:26:11,834 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:26:11,839 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 03:26:11,839 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:8 [2020-07-29 03:26:11,846 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:26:11,847 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_141|, ULTIMATE.start_main_~numbers~0.base]. (and (= 0 (select (store |v_#valid_141| ULTIMATE.start_lis_~best~0.base 1) ULTIMATE.start_lis_~prev~0.base)) (= 1 (select |v_#valid_141| ULTIMATE.start_main_~numbers~0.base)) (= 0 ULTIMATE.start_lis_~i~0)) [2020-07-29 03:26:11,847 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= ULTIMATE.start_lis_~prev~0.base ULTIMATE.start_lis_~best~0.base)) (= 0 ULTIMATE.start_lis_~i~0)) [2020-07-29 03:26:11,885 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2020-07-29 03:26:11,885 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:26:11,896 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:26:11,896 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 03:26:11,897 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2020-07-29 03:26:12,038 INFO L350 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2020-07-29 03:26:12,039 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 39 [2020-07-29 03:26:12,040 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:26:12,051 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:26:12,058 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-29 03:26:12,058 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:37 [2020-07-29 03:26:12,561 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:26:12,595 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:26:12,621 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 03:26:12,706 INFO L280 TraceCheckUtils]: 0: Hoare triple {2737#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2737#true} is VALID [2020-07-29 03:26:12,706 INFO L280 TraceCheckUtils]: 1: Hoare triple {2737#true} havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; {2737#true} is VALID [2020-07-29 03:26:12,707 INFO L280 TraceCheckUtils]: 2: Hoare triple {2737#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {2737#true} is VALID [2020-07-29 03:26:12,708 INFO L280 TraceCheckUtils]: 3: Hoare triple {2737#true} call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; {2759#(exists ((ULTIMATE.start_main_~numbers~0.base Int)) (= 1 (select |#valid| ULTIMATE.start_main_~numbers~0.base)))} is VALID [2020-07-29 03:26:12,708 INFO L280 TraceCheckUtils]: 4: Hoare triple {2759#(exists ((ULTIMATE.start_main_~numbers~0.base Int)) (= 1 (select |#valid| ULTIMATE.start_main_~numbers~0.base)))} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {2759#(exists ((ULTIMATE.start_main_~numbers~0.base Int)) (= 1 (select |#valid| ULTIMATE.start_main_~numbers~0.base)))} is VALID [2020-07-29 03:26:12,712 INFO L280 TraceCheckUtils]: 5: Hoare triple {2759#(exists ((ULTIMATE.start_main_~numbers~0.base Int)) (= 1 (select |#valid| ULTIMATE.start_main_~numbers~0.base)))} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {2759#(exists ((ULTIMATE.start_main_~numbers~0.base Int)) (= 1 (select |#valid| ULTIMATE.start_main_~numbers~0.base)))} is VALID [2020-07-29 03:26:12,713 INFO L280 TraceCheckUtils]: 6: Hoare triple {2759#(exists ((ULTIMATE.start_main_~numbers~0.base Int)) (= 1 (select |#valid| ULTIMATE.start_main_~numbers~0.base)))} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {2759#(exists ((ULTIMATE.start_main_~numbers~0.base Int)) (= 1 (select |#valid| ULTIMATE.start_main_~numbers~0.base)))} is VALID [2020-07-29 03:26:12,713 INFO L280 TraceCheckUtils]: 7: Hoare triple {2759#(exists ((ULTIMATE.start_main_~numbers~0.base Int)) (= 1 (select |#valid| ULTIMATE.start_main_~numbers~0.base)))} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {2759#(exists ((ULTIMATE.start_main_~numbers~0.base Int)) (= 1 (select |#valid| ULTIMATE.start_main_~numbers~0.base)))} is VALID [2020-07-29 03:26:12,714 INFO L280 TraceCheckUtils]: 8: Hoare triple {2759#(exists ((ULTIMATE.start_main_~numbers~0.base Int)) (= 1 (select |#valid| ULTIMATE.start_main_~numbers~0.base)))} assume !(main_~i~1 < main_~array_size~0); {2759#(exists ((ULTIMATE.start_main_~numbers~0.base Int)) (= 1 (select |#valid| ULTIMATE.start_main_~numbers~0.base)))} is VALID [2020-07-29 03:26:12,715 INFO L280 TraceCheckUtils]: 9: Hoare triple {2759#(exists ((ULTIMATE.start_main_~numbers~0.base Int)) (= 1 (select |#valid| ULTIMATE.start_main_~numbers~0.base)))} 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; {2778#(and (not (= ULTIMATE.start_lis_~prev~0.base ULTIMATE.start_lis_~best~0.base)) (= 0 ULTIMATE.start_lis_~i~0))} is VALID [2020-07-29 03:26:12,716 INFO L280 TraceCheckUtils]: 10: Hoare triple {2778#(and (not (= ULTIMATE.start_lis_~prev~0.base ULTIMATE.start_lis_~best~0.base)) (= 0 ULTIMATE.start_lis_~i~0))} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {2782#(and (= ULTIMATE.start_lis_~i~0 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) (+ (* ULTIMATE.start_lis_~i~0 4) ULTIMATE.start_lis_~prev~0.offset))) (not (= ULTIMATE.start_lis_~prev~0.base ULTIMATE.start_lis_~best~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ (* ULTIMATE.start_lis_~i~0 4) ULTIMATE.start_lis_~best~0.offset))) (= 0 ULTIMATE.start_lis_~i~0))} is VALID [2020-07-29 03:26:12,717 INFO L280 TraceCheckUtils]: 11: Hoare triple {2782#(and (= ULTIMATE.start_lis_~i~0 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) (+ (* ULTIMATE.start_lis_~i~0 4) ULTIMATE.start_lis_~prev~0.offset))) (not (= ULTIMATE.start_lis_~prev~0.base ULTIMATE.start_lis_~best~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ (* ULTIMATE.start_lis_~i~0 4) ULTIMATE.start_lis_~best~0.offset))) (= 0 ULTIMATE.start_lis_~i~0))} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {2786#(and (= (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) ULTIMATE.start_lis_~best~0.offset) 1) (not (= ULTIMATE.start_lis_~prev~0.base ULTIMATE.start_lis_~best~0.base)) (= 1 ULTIMATE.start_lis_~i~0) (= 0 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) ULTIMATE.start_lis_~prev~0.offset)))} is VALID [2020-07-29 03:26:12,725 INFO L280 TraceCheckUtils]: 12: Hoare triple {2786#(and (= (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) ULTIMATE.start_lis_~best~0.offset) 1) (not (= ULTIMATE.start_lis_~prev~0.base ULTIMATE.start_lis_~best~0.base)) (= 1 ULTIMATE.start_lis_~i~0) (= 0 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) ULTIMATE.start_lis_~prev~0.offset)))} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {2790#(and (= (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) ULTIMATE.start_lis_~best~0.offset) 1) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 4))) (exists ((ULTIMATE.start_lis_~prev~0.base Int) (ULTIMATE.start_lis_~prev~0.offset Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) (+ ULTIMATE.start_lis_~prev~0.offset 4))) (not (= ULTIMATE.start_lis_~prev~0.base ULTIMATE.start_lis_~best~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) ULTIMATE.start_lis_~prev~0.offset)))))} is VALID [2020-07-29 03:26:12,726 INFO L280 TraceCheckUtils]: 13: Hoare triple {2790#(and (= (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) ULTIMATE.start_lis_~best~0.offset) 1) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 4))) (exists ((ULTIMATE.start_lis_~prev~0.base Int) (ULTIMATE.start_lis_~prev~0.offset Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) (+ ULTIMATE.start_lis_~prev~0.offset 4))) (not (= ULTIMATE.start_lis_~prev~0.base ULTIMATE.start_lis_~best~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) ULTIMATE.start_lis_~prev~0.offset)))))} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {2790#(and (= (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) ULTIMATE.start_lis_~best~0.offset) 1) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 4))) (exists ((ULTIMATE.start_lis_~prev~0.base Int) (ULTIMATE.start_lis_~prev~0.offset Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) (+ ULTIMATE.start_lis_~prev~0.offset 4))) (not (= ULTIMATE.start_lis_~prev~0.base ULTIMATE.start_lis_~best~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) ULTIMATE.start_lis_~prev~0.offset)))))} is VALID [2020-07-29 03:26:12,727 INFO L280 TraceCheckUtils]: 14: Hoare triple {2790#(and (= (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) ULTIMATE.start_lis_~best~0.offset) 1) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 4))) (exists ((ULTIMATE.start_lis_~prev~0.base Int) (ULTIMATE.start_lis_~prev~0.offset Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) (+ ULTIMATE.start_lis_~prev~0.offset 4))) (not (= ULTIMATE.start_lis_~prev~0.base ULTIMATE.start_lis_~best~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) ULTIMATE.start_lis_~prev~0.offset)))))} assume !(lis_~i~0 < lis_~N); {2790#(and (= (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) ULTIMATE.start_lis_~best~0.offset) 1) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 4))) (exists ((ULTIMATE.start_lis_~prev~0.base Int) (ULTIMATE.start_lis_~prev~0.offset Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) (+ ULTIMATE.start_lis_~prev~0.offset 4))) (not (= ULTIMATE.start_lis_~prev~0.base ULTIMATE.start_lis_~best~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) ULTIMATE.start_lis_~prev~0.offset)))))} is VALID [2020-07-29 03:26:12,728 INFO L280 TraceCheckUtils]: 15: Hoare triple {2790#(and (= (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) ULTIMATE.start_lis_~best~0.offset) 1) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 4))) (exists ((ULTIMATE.start_lis_~prev~0.base Int) (ULTIMATE.start_lis_~prev~0.offset Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) (+ ULTIMATE.start_lis_~prev~0.offset 4))) (not (= ULTIMATE.start_lis_~prev~0.base ULTIMATE.start_lis_~best~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) ULTIMATE.start_lis_~prev~0.offset)))))} lis_~i~0 := 1; {2800#(and (= (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) ULTIMATE.start_lis_~best~0.offset) 1) (= 1 ULTIMATE.start_lis_~i~0) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 4))) (exists ((ULTIMATE.start_lis_~prev~0.base Int) (ULTIMATE.start_lis_~prev~0.offset Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) (+ ULTIMATE.start_lis_~prev~0.offset 4))) (not (= ULTIMATE.start_lis_~prev~0.base ULTIMATE.start_lis_~best~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) ULTIMATE.start_lis_~prev~0.offset)))))} is VALID [2020-07-29 03:26:12,729 INFO L280 TraceCheckUtils]: 16: Hoare triple {2800#(and (= (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) ULTIMATE.start_lis_~best~0.offset) 1) (= 1 ULTIMATE.start_lis_~i~0) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 4))) (exists ((ULTIMATE.start_lis_~prev~0.base Int) (ULTIMATE.start_lis_~prev~0.offset Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) (+ ULTIMATE.start_lis_~prev~0.offset 4))) (not (= ULTIMATE.start_lis_~prev~0.base ULTIMATE.start_lis_~best~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) ULTIMATE.start_lis_~prev~0.offset)))))} assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; {2804#(and (= (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) ULTIMATE.start_lis_~best~0.offset) 1) (= 0 ULTIMATE.start_lis_~j~0) (= 1 ULTIMATE.start_lis_~i~0) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 4))) (exists ((ULTIMATE.start_lis_~prev~0.base Int) (ULTIMATE.start_lis_~prev~0.offset Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) (+ ULTIMATE.start_lis_~prev~0.offset 4))) (not (= ULTIMATE.start_lis_~prev~0.base ULTIMATE.start_lis_~best~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) ULTIMATE.start_lis_~prev~0.offset)))))} is VALID [2020-07-29 03:26:12,730 INFO L280 TraceCheckUtils]: 17: Hoare triple {2804#(and (= (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) ULTIMATE.start_lis_~best~0.offset) 1) (= 0 ULTIMATE.start_lis_~j~0) (= 1 ULTIMATE.start_lis_~i~0) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 4))) (exists ((ULTIMATE.start_lis_~prev~0.base Int) (ULTIMATE.start_lis_~prev~0.offset Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) (+ ULTIMATE.start_lis_~prev~0.offset 4))) (not (= ULTIMATE.start_lis_~prev~0.base ULTIMATE.start_lis_~best~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) ULTIMATE.start_lis_~prev~0.offset)))))} assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; {2804#(and (= (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) ULTIMATE.start_lis_~best~0.offset) 1) (= 0 ULTIMATE.start_lis_~j~0) (= 1 ULTIMATE.start_lis_~i~0) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 4))) (exists ((ULTIMATE.start_lis_~prev~0.base Int) (ULTIMATE.start_lis_~prev~0.offset Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) (+ ULTIMATE.start_lis_~prev~0.offset 4))) (not (= ULTIMATE.start_lis_~prev~0.base ULTIMATE.start_lis_~best~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) ULTIMATE.start_lis_~prev~0.offset)))))} is VALID [2020-07-29 03:26:12,735 INFO L280 TraceCheckUtils]: 18: Hoare triple {2804#(and (= (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) ULTIMATE.start_lis_~best~0.offset) 1) (= 0 ULTIMATE.start_lis_~j~0) (= 1 ULTIMATE.start_lis_~i~0) (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 4))) (exists ((ULTIMATE.start_lis_~prev~0.base Int) (ULTIMATE.start_lis_~prev~0.offset Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) (+ ULTIMATE.start_lis_~prev~0.offset 4))) (not (= ULTIMATE.start_lis_~prev~0.base ULTIMATE.start_lis_~best~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_lis_~prev~0.base) ULTIMATE.start_lis_~prev~0.offset)))))} assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; {2746#|ULTIMATE.start_lis_#t~short11|} is VALID [2020-07-29 03:26:12,736 INFO L280 TraceCheckUtils]: 19: Hoare triple {2746#|ULTIMATE.start_lis_#t~short11|} assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8; {2738#false} is VALID [2020-07-29 03:26:12,736 INFO L280 TraceCheckUtils]: 20: Hoare triple {2738#false} lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; {2738#false} is VALID [2020-07-29 03:26:12,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-29 03:26:12,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:26:12,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2020-07-29 03:26:12,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785499271] [2020-07-29 03:26:12,862 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-07-29 03:26:12,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:12,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-29 03:26:12,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-07-29 03:26:12,935 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. cyclomatic complexity: 21 Second operand 17 states. [2020-07-29 03:26:14,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:14,274 INFO L93 Difference]: Finished difference Result 100 states and 140 transitions. [2020-07-29 03:26:14,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-29 03:26:14,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-29 03:26:14,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:14,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 140 transitions. [2020-07-29 03:26:14,361 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 26 [2020-07-29 03:26:14,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 140 transitions. [2020-07-29 03:26:14,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2020-07-29 03:26:14,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2020-07-29 03:26:14,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 140 transitions. [2020-07-29 03:26:14,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:14,364 INFO L688 BuchiCegarLoop]: Abstraction has 100 states and 140 transitions. [2020-07-29 03:26:14,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 140 transitions. [2020-07-29 03:26:14,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 64. [2020-07-29 03:26:14,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:14,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states and 140 transitions. Second operand 64 states. [2020-07-29 03:26:14,370 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states and 140 transitions. Second operand 64 states. [2020-07-29 03:26:14,370 INFO L87 Difference]: Start difference. First operand 100 states and 140 transitions. Second operand 64 states. [2020-07-29 03:26:14,371 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:14,373 INFO L93 Difference]: Finished difference Result 100 states and 140 transitions. [2020-07-29 03:26:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 140 transitions. [2020-07-29 03:26:14,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:14,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:14,374 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 100 states and 140 transitions. [2020-07-29 03:26:14,374 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 100 states and 140 transitions. [2020-07-29 03:26:14,375 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:14,378 INFO L93 Difference]: Finished difference Result 100 states and 140 transitions. [2020-07-29 03:26:14,378 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 140 transitions. [2020-07-29 03:26:14,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:14,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:14,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:14,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:14,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-29 03:26:14,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 85 transitions. [2020-07-29 03:26:14,380 INFO L711 BuchiCegarLoop]: Abstraction has 64 states and 85 transitions. [2020-07-29 03:26:14,380 INFO L591 BuchiCegarLoop]: Abstraction has 64 states and 85 transitions. [2020-07-29 03:26:14,380 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-29 03:26:14,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 85 transitions. [2020-07-29 03:26:14,381 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2020-07-29 03:26:14,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:14,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:14,381 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:14,381 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:26:14,382 INFO L794 eck$LassoCheckResult]: Stem: 2957#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2949#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 2950#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2958#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 2945#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 2946#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2947#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 2948#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 2969#L535-3 assume !(main_~i~1 < main_~array_size~0); 2970#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 2939#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2937#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2938#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2940#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2993#L517-3 assume !(lis_~i~0 < lis_~N); 2992#L517-4 lis_~i~0 := 1; 2991#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2990#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2989#L521 assume !lis_#t~short11; 2988#L521-2 [2020-07-29 03:26:14,382 INFO L796 eck$LassoCheckResult]: Loop: 2988#L521-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8; 2960#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2963#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2987#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 2988#L521-2 [2020-07-29 03:26:14,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:14,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1570854005, now seen corresponding path program 1 times [2020-07-29 03:26:14,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:14,382 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967684140] [2020-07-29 03:26:14,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:14,403 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:14,423 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:14,430 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:14,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:14,431 INFO L82 PathProgramCache]: Analyzing trace with hash 2895270, now seen corresponding path program 2 times [2020-07-29 03:26:14,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:14,432 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634756766] [2020-07-29 03:26:14,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:14,441 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:14,448 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:14,452 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:14,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:14,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1264986138, now seen corresponding path program 1 times [2020-07-29 03:26:14,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:14,453 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813922631] [2020-07-29 03:26:14,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:14,548 INFO L280 TraceCheckUtils]: 0: Hoare triple {3408#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3408#true} is VALID [2020-07-29 03:26:14,548 INFO L280 TraceCheckUtils]: 1: Hoare triple {3408#true} havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; {3408#true} is VALID [2020-07-29 03:26:14,548 INFO L280 TraceCheckUtils]: 2: Hoare triple {3408#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {3408#true} is VALID [2020-07-29 03:26:14,548 INFO L280 TraceCheckUtils]: 3: Hoare triple {3408#true} call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; {3408#true} is VALID [2020-07-29 03:26:14,549 INFO L280 TraceCheckUtils]: 4: Hoare triple {3408#true} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {3408#true} is VALID [2020-07-29 03:26:14,549 INFO L280 TraceCheckUtils]: 5: Hoare triple {3408#true} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {3408#true} is VALID [2020-07-29 03:26:14,549 INFO L280 TraceCheckUtils]: 6: Hoare triple {3408#true} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {3408#true} is VALID [2020-07-29 03:26:14,551 INFO L280 TraceCheckUtils]: 7: Hoare triple {3408#true} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {3408#true} is VALID [2020-07-29 03:26:14,551 INFO L280 TraceCheckUtils]: 8: Hoare triple {3408#true} assume !(main_~i~1 < main_~array_size~0); {3408#true} is VALID [2020-07-29 03:26:14,551 INFO L280 TraceCheckUtils]: 9: Hoare triple {3408#true} 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; {3408#true} is VALID [2020-07-29 03:26:14,551 INFO L280 TraceCheckUtils]: 10: Hoare triple {3408#true} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {3408#true} is VALID [2020-07-29 03:26:14,552 INFO L280 TraceCheckUtils]: 11: Hoare triple {3408#true} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {3408#true} is VALID [2020-07-29 03:26:14,552 INFO L280 TraceCheckUtils]: 12: Hoare triple {3408#true} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {3408#true} is VALID [2020-07-29 03:26:14,552 INFO L280 TraceCheckUtils]: 13: Hoare triple {3408#true} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {3408#true} is VALID [2020-07-29 03:26:14,553 INFO L280 TraceCheckUtils]: 14: Hoare triple {3408#true} assume !(lis_~i~0 < lis_~N); {3408#true} is VALID [2020-07-29 03:26:14,553 INFO L280 TraceCheckUtils]: 15: Hoare triple {3408#true} lis_~i~0 := 1; {3410#(= ULTIMATE.start_lis_~i~0 1)} is VALID [2020-07-29 03:26:14,554 INFO L280 TraceCheckUtils]: 16: Hoare triple {3410#(= ULTIMATE.start_lis_~i~0 1)} assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; {3411#(and (= ULTIMATE.start_lis_~i~0 1) (= 0 ULTIMATE.start_lis_~j~0))} is VALID [2020-07-29 03:26:14,556 INFO L280 TraceCheckUtils]: 17: Hoare triple {3411#(and (= ULTIMATE.start_lis_~i~0 1) (= 0 ULTIMATE.start_lis_~j~0))} assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; {3411#(and (= ULTIMATE.start_lis_~i~0 1) (= 0 ULTIMATE.start_lis_~j~0))} is VALID [2020-07-29 03:26:14,557 INFO L280 TraceCheckUtils]: 18: Hoare triple {3411#(and (= ULTIMATE.start_lis_~i~0 1) (= 0 ULTIMATE.start_lis_~j~0))} assume !lis_#t~short11; {3411#(and (= ULTIMATE.start_lis_~i~0 1) (= 0 ULTIMATE.start_lis_~j~0))} is VALID [2020-07-29 03:26:14,557 INFO L280 TraceCheckUtils]: 19: Hoare triple {3411#(and (= ULTIMATE.start_lis_~i~0 1) (= 0 ULTIMATE.start_lis_~j~0))} assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8; {3411#(and (= ULTIMATE.start_lis_~i~0 1) (= 0 ULTIMATE.start_lis_~j~0))} is VALID [2020-07-29 03:26:14,558 INFO L280 TraceCheckUtils]: 20: Hoare triple {3411#(and (= ULTIMATE.start_lis_~i~0 1) (= 0 ULTIMATE.start_lis_~j~0))} lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; {3412#(and (= ULTIMATE.start_lis_~i~0 1) (<= 1 ULTIMATE.start_lis_~j~0))} is VALID [2020-07-29 03:26:14,559 INFO L280 TraceCheckUtils]: 21: Hoare triple {3412#(and (= ULTIMATE.start_lis_~i~0 1) (<= 1 ULTIMATE.start_lis_~j~0))} assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; {3409#false} is VALID [2020-07-29 03:26:14,560 INFO L280 TraceCheckUtils]: 22: Hoare triple {3409#false} assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; {3409#false} is VALID [2020-07-29 03:26:14,561 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-29 03:26:14,561 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813922631] [2020-07-29 03:26:14,561 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458294263] [2020-07-29 03:26:14,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 03:26:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:14,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:26:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:14,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:14,736 INFO L280 TraceCheckUtils]: 0: Hoare triple {3408#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3408#true} is VALID [2020-07-29 03:26:14,736 INFO L280 TraceCheckUtils]: 1: Hoare triple {3408#true} havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; {3408#true} is VALID [2020-07-29 03:26:14,736 INFO L280 TraceCheckUtils]: 2: Hoare triple {3408#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {3408#true} is VALID [2020-07-29 03:26:14,736 INFO L280 TraceCheckUtils]: 3: Hoare triple {3408#true} call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; {3408#true} is VALID [2020-07-29 03:26:14,737 INFO L280 TraceCheckUtils]: 4: Hoare triple {3408#true} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {3408#true} is VALID [2020-07-29 03:26:14,737 INFO L280 TraceCheckUtils]: 5: Hoare triple {3408#true} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {3408#true} is VALID [2020-07-29 03:26:14,737 INFO L280 TraceCheckUtils]: 6: Hoare triple {3408#true} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {3408#true} is VALID [2020-07-29 03:26:14,737 INFO L280 TraceCheckUtils]: 7: Hoare triple {3408#true} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {3408#true} is VALID [2020-07-29 03:26:14,737 INFO L280 TraceCheckUtils]: 8: Hoare triple {3408#true} assume !(main_~i~1 < main_~array_size~0); {3408#true} is VALID [2020-07-29 03:26:14,738 INFO L280 TraceCheckUtils]: 9: Hoare triple {3408#true} 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; {3408#true} is VALID [2020-07-29 03:26:14,738 INFO L280 TraceCheckUtils]: 10: Hoare triple {3408#true} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {3408#true} is VALID [2020-07-29 03:26:14,738 INFO L280 TraceCheckUtils]: 11: Hoare triple {3408#true} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {3408#true} is VALID [2020-07-29 03:26:14,738 INFO L280 TraceCheckUtils]: 12: Hoare triple {3408#true} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {3408#true} is VALID [2020-07-29 03:26:14,738 INFO L280 TraceCheckUtils]: 13: Hoare triple {3408#true} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {3408#true} is VALID [2020-07-29 03:26:14,739 INFO L280 TraceCheckUtils]: 14: Hoare triple {3408#true} assume !(lis_~i~0 < lis_~N); {3408#true} is VALID [2020-07-29 03:26:14,739 INFO L280 TraceCheckUtils]: 15: Hoare triple {3408#true} lis_~i~0 := 1; {3461#(<= ULTIMATE.start_lis_~i~0 1)} is VALID [2020-07-29 03:26:14,740 INFO L280 TraceCheckUtils]: 16: Hoare triple {3461#(<= ULTIMATE.start_lis_~i~0 1)} assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; {3465#(and (<= ULTIMATE.start_lis_~i~0 1) (<= 0 ULTIMATE.start_lis_~j~0))} is VALID [2020-07-29 03:26:14,741 INFO L280 TraceCheckUtils]: 17: Hoare triple {3465#(and (<= ULTIMATE.start_lis_~i~0 1) (<= 0 ULTIMATE.start_lis_~j~0))} assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; {3465#(and (<= ULTIMATE.start_lis_~i~0 1) (<= 0 ULTIMATE.start_lis_~j~0))} is VALID [2020-07-29 03:26:14,743 INFO L280 TraceCheckUtils]: 18: Hoare triple {3465#(and (<= ULTIMATE.start_lis_~i~0 1) (<= 0 ULTIMATE.start_lis_~j~0))} assume !lis_#t~short11; {3465#(and (<= ULTIMATE.start_lis_~i~0 1) (<= 0 ULTIMATE.start_lis_~j~0))} is VALID [2020-07-29 03:26:14,744 INFO L280 TraceCheckUtils]: 19: Hoare triple {3465#(and (<= ULTIMATE.start_lis_~i~0 1) (<= 0 ULTIMATE.start_lis_~j~0))} assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8; {3465#(and (<= ULTIMATE.start_lis_~i~0 1) (<= 0 ULTIMATE.start_lis_~j~0))} is VALID [2020-07-29 03:26:14,746 INFO L280 TraceCheckUtils]: 20: Hoare triple {3465#(and (<= ULTIMATE.start_lis_~i~0 1) (<= 0 ULTIMATE.start_lis_~j~0))} lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; {3478#(and (<= ULTIMATE.start_lis_~i~0 1) (<= 1 ULTIMATE.start_lis_~j~0))} is VALID [2020-07-29 03:26:14,747 INFO L280 TraceCheckUtils]: 21: Hoare triple {3478#(and (<= ULTIMATE.start_lis_~i~0 1) (<= 1 ULTIMATE.start_lis_~j~0))} assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; {3409#false} is VALID [2020-07-29 03:26:14,748 INFO L280 TraceCheckUtils]: 22: Hoare triple {3409#false} assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; {3409#false} is VALID [2020-07-29 03:26:14,749 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-29 03:26:14,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 03:26:14,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2020-07-29 03:26:14,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045851248] [2020-07-29 03:26:14,893 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2020-07-29 03:26:14,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:14,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:26:14,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-07-29 03:26:14,963 INFO L87 Difference]: Start difference. First operand 64 states and 85 transitions. cyclomatic complexity: 27 Second operand 5 states. [2020-07-29 03:26:15,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:15,080 INFO L93 Difference]: Finished difference Result 78 states and 103 transitions. [2020-07-29 03:26:15,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:26:15,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:26:15,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:15,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 103 transitions. [2020-07-29 03:26:15,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:26:15,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 58 states and 78 transitions. [2020-07-29 03:26:15,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-07-29 03:26:15,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-07-29 03:26:15,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 78 transitions. [2020-07-29 03:26:15,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:15,111 INFO L688 BuchiCegarLoop]: Abstraction has 58 states and 78 transitions. [2020-07-29 03:26:15,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 78 transitions. [2020-07-29 03:26:15,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-07-29 03:26:15,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:15,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states and 78 transitions. Second operand 55 states. [2020-07-29 03:26:15,114 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states and 78 transitions. Second operand 55 states. [2020-07-29 03:26:15,115 INFO L87 Difference]: Start difference. First operand 58 states and 78 transitions. Second operand 55 states. [2020-07-29 03:26:15,115 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:15,116 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2020-07-29 03:26:15,116 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2020-07-29 03:26:15,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:15,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:15,117 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 58 states and 78 transitions. [2020-07-29 03:26:15,117 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 58 states and 78 transitions. [2020-07-29 03:26:15,118 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:15,119 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2020-07-29 03:26:15,119 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2020-07-29 03:26:15,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:15,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:15,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:15,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:15,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-29 03:26:15,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2020-07-29 03:26:15,121 INFO L711 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2020-07-29 03:26:15,121 INFO L591 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2020-07-29 03:26:15,121 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2020-07-29 03:26:15,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 75 transitions. [2020-07-29 03:26:15,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:26:15,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:15,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:15,122 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:15,122 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:15,123 INFO L794 eck$LassoCheckResult]: Stem: 3580#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3572#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 3573#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 3582#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 3574#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 3570#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 3571#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 3575#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 3598#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 3597#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 3596#L535-3 assume !(main_~i~1 < main_~array_size~0); 3581#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 3566#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3564#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3565#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3567#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3606#L517-3 assume !(lis_~i~0 < lis_~N); 3605#L517-4 lis_~i~0 := 1; 3604#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3603#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3600#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 3583#L521-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;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); 3584#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3609#L520-3 assume !(lis_~j~0 < lis_~i~0); 3593#L519-2 [2020-07-29 03:26:15,123 INFO L796 eck$LassoCheckResult]: Loop: 3593#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3560#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3561#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3576#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 3577#L521-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8; 3587#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3588#L520-3 assume !(lis_~j~0 < lis_~i~0); 3593#L519-2 [2020-07-29 03:26:15,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:15,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1034531842, now seen corresponding path program 1 times [2020-07-29 03:26:15,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:15,123 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103224564] [2020-07-29 03:26:15,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:15,262 INFO L280 TraceCheckUtils]: 0: Hoare triple {3862#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3862#true} is VALID [2020-07-29 03:26:15,262 INFO L280 TraceCheckUtils]: 1: Hoare triple {3862#true} havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; {3862#true} is VALID [2020-07-29 03:26:15,262 INFO L280 TraceCheckUtils]: 2: Hoare triple {3862#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {3862#true} is VALID [2020-07-29 03:26:15,264 INFO L280 TraceCheckUtils]: 3: Hoare triple {3862#true} call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; {3864#(and (= 0 ULTIMATE.start_main_~i~1) (= 0 ULTIMATE.start_main_~numbers~0.offset) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} is VALID [2020-07-29 03:26:15,266 INFO L280 TraceCheckUtils]: 4: Hoare triple {3864#(and (= 0 ULTIMATE.start_main_~i~1) (= 0 ULTIMATE.start_main_~numbers~0.offset) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {3864#(and (= 0 ULTIMATE.start_main_~i~1) (= 0 ULTIMATE.start_main_~numbers~0.offset) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} is VALID [2020-07-29 03:26:15,267 INFO L280 TraceCheckUtils]: 5: Hoare triple {3864#(and (= 0 ULTIMATE.start_main_~i~1) (= 0 ULTIMATE.start_main_~numbers~0.offset) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {3865#(and (<= 1 ULTIMATE.start_main_~i~1) (= 0 ULTIMATE.start_main_~numbers~0.offset) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} is VALID [2020-07-29 03:26:15,268 INFO L280 TraceCheckUtils]: 6: Hoare triple {3865#(and (<= 1 ULTIMATE.start_main_~i~1) (= 0 ULTIMATE.start_main_~numbers~0.offset) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {3865#(and (<= 1 ULTIMATE.start_main_~i~1) (= 0 ULTIMATE.start_main_~numbers~0.offset) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} is VALID [2020-07-29 03:26:15,270 INFO L280 TraceCheckUtils]: 7: Hoare triple {3865#(and (<= 1 ULTIMATE.start_main_~i~1) (= 0 ULTIMATE.start_main_~numbers~0.offset) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {3866#(and (= 0 ULTIMATE.start_main_~numbers~0.offset) (<= 2 ULTIMATE.start_main_~i~1) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} is VALID [2020-07-29 03:26:15,271 INFO L280 TraceCheckUtils]: 8: Hoare triple {3866#(and (= 0 ULTIMATE.start_main_~numbers~0.offset) (<= 2 ULTIMATE.start_main_~i~1) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {3867#(<= 3 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:26:15,271 INFO L280 TraceCheckUtils]: 9: Hoare triple {3867#(<= 3 ULTIMATE.start_main_~array_size~0)} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {3867#(<= 3 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:26:15,272 INFO L280 TraceCheckUtils]: 10: Hoare triple {3867#(<= 3 ULTIMATE.start_main_~array_size~0)} assume !(main_~i~1 < main_~array_size~0); {3867#(<= 3 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:26:15,273 INFO L280 TraceCheckUtils]: 11: Hoare triple {3867#(<= 3 ULTIMATE.start_main_~array_size~0)} 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; {3868#(and (<= 3 ULTIMATE.start_lis_~N) (= 0 ULTIMATE.start_lis_~i~0))} is VALID [2020-07-29 03:26:15,275 INFO L280 TraceCheckUtils]: 12: Hoare triple {3868#(and (<= 3 ULTIMATE.start_lis_~N) (= 0 ULTIMATE.start_lis_~i~0))} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {3868#(and (<= 3 ULTIMATE.start_lis_~N) (= 0 ULTIMATE.start_lis_~i~0))} is VALID [2020-07-29 03:26:15,275 INFO L280 TraceCheckUtils]: 13: Hoare triple {3868#(and (<= 3 ULTIMATE.start_lis_~N) (= 0 ULTIMATE.start_lis_~i~0))} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {3869#(<= (+ ULTIMATE.start_lis_~i~0 2) ULTIMATE.start_lis_~N)} is VALID [2020-07-29 03:26:15,276 INFO L280 TraceCheckUtils]: 14: Hoare triple {3869#(<= (+ ULTIMATE.start_lis_~i~0 2) ULTIMATE.start_lis_~N)} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {3869#(<= (+ ULTIMATE.start_lis_~i~0 2) ULTIMATE.start_lis_~N)} is VALID [2020-07-29 03:26:15,277 INFO L280 TraceCheckUtils]: 15: Hoare triple {3869#(<= (+ ULTIMATE.start_lis_~i~0 2) ULTIMATE.start_lis_~N)} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {3870#(<= (+ ULTIMATE.start_lis_~i~0 1) ULTIMATE.start_lis_~N)} is VALID [2020-07-29 03:26:15,278 INFO L280 TraceCheckUtils]: 16: Hoare triple {3870#(<= (+ ULTIMATE.start_lis_~i~0 1) ULTIMATE.start_lis_~N)} assume !(lis_~i~0 < lis_~N); {3863#false} is VALID [2020-07-29 03:26:15,278 INFO L280 TraceCheckUtils]: 17: Hoare triple {3863#false} lis_~i~0 := 1; {3863#false} is VALID [2020-07-29 03:26:15,278 INFO L280 TraceCheckUtils]: 18: Hoare triple {3863#false} assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; {3863#false} is VALID [2020-07-29 03:26:15,278 INFO L280 TraceCheckUtils]: 19: Hoare triple {3863#false} assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; {3863#false} is VALID [2020-07-29 03:26:15,279 INFO L280 TraceCheckUtils]: 20: Hoare triple {3863#false} assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; {3863#false} is VALID [2020-07-29 03:26:15,279 INFO L280 TraceCheckUtils]: 21: Hoare triple {3863#false} assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;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); {3863#false} is VALID [2020-07-29 03:26:15,279 INFO L280 TraceCheckUtils]: 22: Hoare triple {3863#false} lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; {3863#false} is VALID [2020-07-29 03:26:15,279 INFO L280 TraceCheckUtils]: 23: Hoare triple {3863#false} assume !(lis_~j~0 < lis_~i~0); {3863#false} is VALID [2020-07-29 03:26:15,281 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:26:15,281 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103224564] [2020-07-29 03:26:15,281 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472677655] [2020-07-29 03:26:15,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 03:26:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:15,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 03:26:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:15,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:15,649 INFO L280 TraceCheckUtils]: 0: Hoare triple {3862#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3862#true} is VALID [2020-07-29 03:26:15,649 INFO L280 TraceCheckUtils]: 1: Hoare triple {3862#true} havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; {3862#true} is VALID [2020-07-29 03:26:15,649 INFO L280 TraceCheckUtils]: 2: Hoare triple {3862#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {3862#true} is VALID [2020-07-29 03:26:15,650 INFO L280 TraceCheckUtils]: 3: Hoare triple {3862#true} call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; {3883#(<= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:26:15,651 INFO L280 TraceCheckUtils]: 4: Hoare triple {3883#(<= 0 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {3883#(<= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:26:15,652 INFO L280 TraceCheckUtils]: 5: Hoare triple {3883#(<= 0 ULTIMATE.start_main_~i~1)} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {3890#(<= 1 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:26:15,652 INFO L280 TraceCheckUtils]: 6: Hoare triple {3890#(<= 1 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {3890#(<= 1 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:26:15,653 INFO L280 TraceCheckUtils]: 7: Hoare triple {3890#(<= 1 ULTIMATE.start_main_~i~1)} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {3897#(<= 2 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:26:15,654 INFO L280 TraceCheckUtils]: 8: Hoare triple {3897#(<= 2 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {3867#(<= 3 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:26:15,654 INFO L280 TraceCheckUtils]: 9: Hoare triple {3867#(<= 3 ULTIMATE.start_main_~array_size~0)} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {3867#(<= 3 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:26:15,654 INFO L280 TraceCheckUtils]: 10: Hoare triple {3867#(<= 3 ULTIMATE.start_main_~array_size~0)} assume !(main_~i~1 < main_~array_size~0); {3867#(<= 3 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:26:15,655 INFO L280 TraceCheckUtils]: 11: Hoare triple {3867#(<= 3 ULTIMATE.start_main_~array_size~0)} 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; {3910#(and (<= ULTIMATE.start_lis_~i~0 0) (<= 3 ULTIMATE.start_lis_~N))} is VALID [2020-07-29 03:26:15,657 INFO L280 TraceCheckUtils]: 12: Hoare triple {3910#(and (<= ULTIMATE.start_lis_~i~0 0) (<= 3 ULTIMATE.start_lis_~N))} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {3910#(and (<= ULTIMATE.start_lis_~i~0 0) (<= 3 ULTIMATE.start_lis_~N))} is VALID [2020-07-29 03:26:15,657 INFO L280 TraceCheckUtils]: 13: Hoare triple {3910#(and (<= ULTIMATE.start_lis_~i~0 0) (<= 3 ULTIMATE.start_lis_~N))} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {3917#(and (<= ULTIMATE.start_lis_~i~0 1) (<= 3 ULTIMATE.start_lis_~N))} is VALID [2020-07-29 03:26:15,658 INFO L280 TraceCheckUtils]: 14: Hoare triple {3917#(and (<= ULTIMATE.start_lis_~i~0 1) (<= 3 ULTIMATE.start_lis_~N))} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {3917#(and (<= ULTIMATE.start_lis_~i~0 1) (<= 3 ULTIMATE.start_lis_~N))} is VALID [2020-07-29 03:26:15,659 INFO L280 TraceCheckUtils]: 15: Hoare triple {3917#(and (<= ULTIMATE.start_lis_~i~0 1) (<= 3 ULTIMATE.start_lis_~N))} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {3924#(and (<= ULTIMATE.start_lis_~i~0 2) (<= 3 ULTIMATE.start_lis_~N))} is VALID [2020-07-29 03:26:15,660 INFO L280 TraceCheckUtils]: 16: Hoare triple {3924#(and (<= ULTIMATE.start_lis_~i~0 2) (<= 3 ULTIMATE.start_lis_~N))} assume !(lis_~i~0 < lis_~N); {3863#false} is VALID [2020-07-29 03:26:15,660 INFO L280 TraceCheckUtils]: 17: Hoare triple {3863#false} lis_~i~0 := 1; {3863#false} is VALID [2020-07-29 03:26:15,660 INFO L280 TraceCheckUtils]: 18: Hoare triple {3863#false} assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; {3863#false} is VALID [2020-07-29 03:26:15,661 INFO L280 TraceCheckUtils]: 19: Hoare triple {3863#false} assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; {3863#false} is VALID [2020-07-29 03:26:15,661 INFO L280 TraceCheckUtils]: 20: Hoare triple {3863#false} assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; {3863#false} is VALID [2020-07-29 03:26:15,661 INFO L280 TraceCheckUtils]: 21: Hoare triple {3863#false} assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;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); {3863#false} is VALID [2020-07-29 03:26:15,661 INFO L280 TraceCheckUtils]: 22: Hoare triple {3863#false} lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; {3863#false} is VALID [2020-07-29 03:26:15,661 INFO L280 TraceCheckUtils]: 23: Hoare triple {3863#false} assume !(lis_~j~0 < lis_~i~0); {3863#false} is VALID [2020-07-29 03:26:15,663 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:26:15,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:26:15,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2020-07-29 03:26:15,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973183851] [2020-07-29 03:26:15,664 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:26:15,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:15,664 INFO L82 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 4 times [2020-07-29 03:26:15,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:15,665 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441680458] [2020-07-29 03:26:15,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:15,672 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:15,680 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:15,682 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:15,817 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2020-07-29 03:26:15,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:15,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-29 03:26:15,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2020-07-29 03:26:15,889 INFO L87 Difference]: Start difference. First operand 55 states and 75 transitions. cyclomatic complexity: 24 Second operand 15 states. [2020-07-29 03:26:16,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:16,670 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2020-07-29 03:26:16,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 03:26:16,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-29 03:26:16,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:16,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. [2020-07-29 03:26:16,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:26:16,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 64 transitions. [2020-07-29 03:26:16,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-07-29 03:26:16,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-07-29 03:26:16,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2020-07-29 03:26:16,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:16,742 INFO L688 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2020-07-29 03:26:16,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2020-07-29 03:26:16,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2020-07-29 03:26:16,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:16,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states and 64 transitions. Second operand 47 states. [2020-07-29 03:26:16,745 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states and 64 transitions. Second operand 47 states. [2020-07-29 03:26:16,745 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand 47 states. [2020-07-29 03:26:16,746 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:16,748 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2020-07-29 03:26:16,748 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2020-07-29 03:26:16,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:16,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:16,749 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states and 64 transitions. [2020-07-29 03:26:16,749 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states and 64 transitions. [2020-07-29 03:26:16,750 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:16,751 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2020-07-29 03:26:16,751 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2020-07-29 03:26:16,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:16,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:16,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:16,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:16,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-29 03:26:16,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2020-07-29 03:26:16,754 INFO L711 BuchiCegarLoop]: Abstraction has 47 states and 63 transitions. [2020-07-29 03:26:16,754 INFO L591 BuchiCegarLoop]: Abstraction has 47 states and 63 transitions. [2020-07-29 03:26:16,754 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2020-07-29 03:26:16,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 63 transitions. [2020-07-29 03:26:16,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:26:16,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:16,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:16,756 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:16,756 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:16,756 INFO L794 eck$LassoCheckResult]: Stem: 4027#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 4019#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 4020#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 4029#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 4021#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 4017#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 4018#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 4022#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 4041#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 4040#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 4039#L535-3 assume !(main_~i~1 < main_~array_size~0); 4028#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 4012#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4013#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4014#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4010#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4011#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4038#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4037#L517-3 assume !(lis_~i~0 < lis_~N); 4015#L517-4 lis_~i~0 := 1; 4016#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4044#L520-3 assume !(lis_~j~0 < lis_~i~0); 4043#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 4042#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4007#L520-3 [2020-07-29 03:26:16,757 INFO L796 eck$LassoCheckResult]: Loop: 4007#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 4023#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 4024#L521-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8; 4030#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4046#L520-3 assume !(lis_~j~0 < lis_~i~0); 4036#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 4006#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4007#L520-3 [2020-07-29 03:26:16,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:16,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1572106802, now seen corresponding path program 1 times [2020-07-29 03:26:16,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:16,758 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028814813] [2020-07-29 03:26:16,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:16,803 INFO L280 TraceCheckUtils]: 0: Hoare triple {4271#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4271#true} is VALID [2020-07-29 03:26:16,803 INFO L280 TraceCheckUtils]: 1: Hoare triple {4271#true} havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; {4271#true} is VALID [2020-07-29 03:26:16,803 INFO L280 TraceCheckUtils]: 2: Hoare triple {4271#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {4271#true} is VALID [2020-07-29 03:26:16,804 INFO L280 TraceCheckUtils]: 3: Hoare triple {4271#true} call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; {4271#true} is VALID [2020-07-29 03:26:16,804 INFO L280 TraceCheckUtils]: 4: Hoare triple {4271#true} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {4271#true} is VALID [2020-07-29 03:26:16,804 INFO L280 TraceCheckUtils]: 5: Hoare triple {4271#true} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {4271#true} is VALID [2020-07-29 03:26:16,805 INFO L280 TraceCheckUtils]: 6: Hoare triple {4271#true} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {4271#true} is VALID [2020-07-29 03:26:16,805 INFO L280 TraceCheckUtils]: 7: Hoare triple {4271#true} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {4271#true} is VALID [2020-07-29 03:26:16,805 INFO L280 TraceCheckUtils]: 8: Hoare triple {4271#true} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {4271#true} is VALID [2020-07-29 03:26:16,805 INFO L280 TraceCheckUtils]: 9: Hoare triple {4271#true} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {4271#true} is VALID [2020-07-29 03:26:16,806 INFO L280 TraceCheckUtils]: 10: Hoare triple {4271#true} assume !(main_~i~1 < main_~array_size~0); {4271#true} is VALID [2020-07-29 03:26:16,806 INFO L280 TraceCheckUtils]: 11: Hoare triple {4271#true} 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; {4271#true} is VALID [2020-07-29 03:26:16,808 INFO L280 TraceCheckUtils]: 12: Hoare triple {4271#true} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {4271#true} is VALID [2020-07-29 03:26:16,808 INFO L280 TraceCheckUtils]: 13: Hoare triple {4271#true} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {4271#true} is VALID [2020-07-29 03:26:16,808 INFO L280 TraceCheckUtils]: 14: Hoare triple {4271#true} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {4271#true} is VALID [2020-07-29 03:26:16,808 INFO L280 TraceCheckUtils]: 15: Hoare triple {4271#true} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {4271#true} is VALID [2020-07-29 03:26:16,808 INFO L280 TraceCheckUtils]: 16: Hoare triple {4271#true} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {4271#true} is VALID [2020-07-29 03:26:16,809 INFO L280 TraceCheckUtils]: 17: Hoare triple {4271#true} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {4271#true} is VALID [2020-07-29 03:26:16,809 INFO L280 TraceCheckUtils]: 18: Hoare triple {4271#true} assume !(lis_~i~0 < lis_~N); {4271#true} is VALID [2020-07-29 03:26:16,813 INFO L280 TraceCheckUtils]: 19: Hoare triple {4271#true} lis_~i~0 := 1; {4273#(= ULTIMATE.start_lis_~i~0 1)} is VALID [2020-07-29 03:26:16,814 INFO L280 TraceCheckUtils]: 20: Hoare triple {4273#(= ULTIMATE.start_lis_~i~0 1)} assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; {4274#(and (= ULTIMATE.start_lis_~i~0 1) (= 0 ULTIMATE.start_lis_~j~0))} is VALID [2020-07-29 03:26:16,814 INFO L280 TraceCheckUtils]: 21: Hoare triple {4274#(and (= ULTIMATE.start_lis_~i~0 1) (= 0 ULTIMATE.start_lis_~j~0))} assume !(lis_~j~0 < lis_~i~0); {4272#false} is VALID [2020-07-29 03:26:16,815 INFO L280 TraceCheckUtils]: 22: Hoare triple {4272#false} lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; {4272#false} is VALID [2020-07-29 03:26:16,815 INFO L280 TraceCheckUtils]: 23: Hoare triple {4272#false} assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; {4272#false} is VALID [2020-07-29 03:26:16,816 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-29 03:26:16,816 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028814813] [2020-07-29 03:26:16,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:26:16,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 03:26:16,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835903666] [2020-07-29 03:26:16,817 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:26:16,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:16,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 5 times [2020-07-29 03:26:16,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:16,818 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833985306] [2020-07-29 03:26:16,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:16,823 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:16,827 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:16,832 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:17,012 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2020-07-29 03:26:17,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:17,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 03:26:17,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 03:26:17,088 INFO L87 Difference]: Start difference. First operand 47 states and 63 transitions. cyclomatic complexity: 20 Second operand 4 states. [2020-07-29 03:26:17,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:17,183 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2020-07-29 03:26:17,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 03:26:17,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:26:17,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:17,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 64 transitions. [2020-07-29 03:26:17,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:26:17,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 64 transitions. [2020-07-29 03:26:17,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-07-29 03:26:17,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-07-29 03:26:17,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 64 transitions. [2020-07-29 03:26:17,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:17,238 INFO L688 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2020-07-29 03:26:17,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 64 transitions. [2020-07-29 03:26:17,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2020-07-29 03:26:17,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:17,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states and 64 transitions. Second operand 47 states. [2020-07-29 03:26:17,241 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states and 64 transitions. Second operand 47 states. [2020-07-29 03:26:17,241 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand 47 states. [2020-07-29 03:26:17,242 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:17,243 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2020-07-29 03:26:17,243 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2020-07-29 03:26:17,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:17,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:17,244 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states and 64 transitions. [2020-07-29 03:26:17,244 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states and 64 transitions. [2020-07-29 03:26:17,245 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:17,246 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2020-07-29 03:26:17,246 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2020-07-29 03:26:17,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:17,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:17,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:17,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:17,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-29 03:26:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-07-29 03:26:17,248 INFO L711 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-07-29 03:26:17,249 INFO L591 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-07-29 03:26:17,249 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2020-07-29 03:26:17,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 62 transitions. [2020-07-29 03:26:17,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:26:17,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:17,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:17,250 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:17,251 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:17,251 INFO L794 eck$LassoCheckResult]: Stem: 4346#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 4338#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 4339#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 4348#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 4340#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 4336#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 4337#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 4341#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 4365#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 4363#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 4362#L535-3 assume !(main_~i~1 < main_~array_size~0); 4347#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 4333#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4331#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4332#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4334#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4364#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4361#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4360#L517-3 assume !(lis_~i~0 < lis_~N); 4335#L517-4 lis_~i~0 := 1; 4326#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4328#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 4342#L521 assume !lis_#t~short11; 4343#L521-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;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); 4367#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4366#L520-3 assume !(lis_~j~0 < lis_~i~0); 4357#L519-2 [2020-07-29 03:26:17,251 INFO L796 eck$LassoCheckResult]: Loop: 4357#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 4358#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4354#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 4355#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 4349#L521-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8; 4350#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4352#L520-3 assume !(lis_~j~0 < lis_~i~0); 4357#L519-2 [2020-07-29 03:26:17,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:17,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1035359454, now seen corresponding path program 1 times [2020-07-29 03:26:17,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:17,252 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814962416] [2020-07-29 03:26:17,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:17,306 INFO L280 TraceCheckUtils]: 0: Hoare triple {4591#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4591#true} is VALID [2020-07-29 03:26:17,306 INFO L280 TraceCheckUtils]: 1: Hoare triple {4591#true} havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; {4591#true} is VALID [2020-07-29 03:26:17,306 INFO L280 TraceCheckUtils]: 2: Hoare triple {4591#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {4591#true} is VALID [2020-07-29 03:26:17,307 INFO L280 TraceCheckUtils]: 3: Hoare triple {4591#true} call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; {4591#true} is VALID [2020-07-29 03:26:17,307 INFO L280 TraceCheckUtils]: 4: Hoare triple {4591#true} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {4591#true} is VALID [2020-07-29 03:26:17,307 INFO L280 TraceCheckUtils]: 5: Hoare triple {4591#true} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {4591#true} is VALID [2020-07-29 03:26:17,307 INFO L280 TraceCheckUtils]: 6: Hoare triple {4591#true} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {4591#true} is VALID [2020-07-29 03:26:17,307 INFO L280 TraceCheckUtils]: 7: Hoare triple {4591#true} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {4591#true} is VALID [2020-07-29 03:26:17,307 INFO L280 TraceCheckUtils]: 8: Hoare triple {4591#true} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {4591#true} is VALID [2020-07-29 03:26:17,308 INFO L280 TraceCheckUtils]: 9: Hoare triple {4591#true} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {4591#true} is VALID [2020-07-29 03:26:17,308 INFO L280 TraceCheckUtils]: 10: Hoare triple {4591#true} assume !(main_~i~1 < main_~array_size~0); {4591#true} is VALID [2020-07-29 03:26:17,308 INFO L280 TraceCheckUtils]: 11: Hoare triple {4591#true} 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; {4591#true} is VALID [2020-07-29 03:26:17,310 INFO L280 TraceCheckUtils]: 12: Hoare triple {4591#true} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {4591#true} is VALID [2020-07-29 03:26:17,310 INFO L280 TraceCheckUtils]: 13: Hoare triple {4591#true} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {4591#true} is VALID [2020-07-29 03:26:17,310 INFO L280 TraceCheckUtils]: 14: Hoare triple {4591#true} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {4591#true} is VALID [2020-07-29 03:26:17,310 INFO L280 TraceCheckUtils]: 15: Hoare triple {4591#true} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {4591#true} is VALID [2020-07-29 03:26:17,311 INFO L280 TraceCheckUtils]: 16: Hoare triple {4591#true} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {4591#true} is VALID [2020-07-29 03:26:17,311 INFO L280 TraceCheckUtils]: 17: Hoare triple {4591#true} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {4591#true} is VALID [2020-07-29 03:26:17,311 INFO L280 TraceCheckUtils]: 18: Hoare triple {4591#true} assume !(lis_~i~0 < lis_~N); {4591#true} is VALID [2020-07-29 03:26:17,311 INFO L280 TraceCheckUtils]: 19: Hoare triple {4591#true} lis_~i~0 := 1; {4591#true} is VALID [2020-07-29 03:26:17,312 INFO L280 TraceCheckUtils]: 20: Hoare triple {4591#true} assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; {4591#true} is VALID [2020-07-29 03:26:17,312 INFO L280 TraceCheckUtils]: 21: Hoare triple {4591#true} assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; {4591#true} is VALID [2020-07-29 03:26:17,313 INFO L280 TraceCheckUtils]: 22: Hoare triple {4591#true} assume !lis_#t~short11; {4593#(not |ULTIMATE.start_lis_#t~short11|)} is VALID [2020-07-29 03:26:17,314 INFO L280 TraceCheckUtils]: 23: Hoare triple {4593#(not |ULTIMATE.start_lis_#t~short11|)} assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;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); {4592#false} is VALID [2020-07-29 03:26:17,314 INFO L280 TraceCheckUtils]: 24: Hoare triple {4592#false} lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; {4592#false} is VALID [2020-07-29 03:26:17,314 INFO L280 TraceCheckUtils]: 25: Hoare triple {4592#false} assume !(lis_~j~0 < lis_~i~0); {4592#false} is VALID [2020-07-29 03:26:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-29 03:26:17,315 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814962416] [2020-07-29 03:26:17,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:26:17,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:26:17,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297404055] [2020-07-29 03:26:17,316 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:26:17,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:17,317 INFO L82 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 6 times [2020-07-29 03:26:17,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:17,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307382496] [2020-07-29 03:26:17,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:17,325 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:17,329 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:17,331 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:17,493 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2020-07-29 03:26:17,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:17,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:26:17,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:26:17,554 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. cyclomatic complexity: 19 Second operand 3 states. [2020-07-29 03:26:17,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:17,599 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2020-07-29 03:26:17,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:26:17,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:26:17,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:17,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 66 transitions. [2020-07-29 03:26:17,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 03:26:17,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 66 transitions. [2020-07-29 03:26:17,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-07-29 03:26:17,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-07-29 03:26:17,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 66 transitions. [2020-07-29 03:26:17,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:17,640 INFO L688 BuchiCegarLoop]: Abstraction has 51 states and 66 transitions. [2020-07-29 03:26:17,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 66 transitions. [2020-07-29 03:26:17,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-07-29 03:26:17,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:17,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states and 66 transitions. Second operand 51 states. [2020-07-29 03:26:17,646 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states and 66 transitions. Second operand 51 states. [2020-07-29 03:26:17,646 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand 51 states. [2020-07-29 03:26:17,647 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:17,648 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2020-07-29 03:26:17,648 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2020-07-29 03:26:17,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:17,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:17,649 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states and 66 transitions. [2020-07-29 03:26:17,649 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states and 66 transitions. [2020-07-29 03:26:17,650 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:17,651 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2020-07-29 03:26:17,651 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2020-07-29 03:26:17,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:17,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:17,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:17,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:17,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-29 03:26:17,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2020-07-29 03:26:17,653 INFO L711 BuchiCegarLoop]: Abstraction has 51 states and 66 transitions. [2020-07-29 03:26:17,653 INFO L591 BuchiCegarLoop]: Abstraction has 51 states and 66 transitions. [2020-07-29 03:26:17,653 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2020-07-29 03:26:17,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 66 transitions. [2020-07-29 03:26:17,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 03:26:17,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:17,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:17,655 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:17,655 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:17,656 INFO L794 eck$LassoCheckResult]: Stem: 4669#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 4659#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 4660#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 4671#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 4661#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 4657#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 4658#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 4662#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 4687#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 4685#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 4684#L535-3 assume !(main_~i~1 < main_~array_size~0); 4670#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 4653#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4651#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4652#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4654#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4686#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4683#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4682#L517-3 assume !(lis_~i~0 < lis_~N); 4655#L517-4 lis_~i~0 := 1; 4656#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4695#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 4693#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 4688#L521-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;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); 4673#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4681#L520-3 assume !(lis_~j~0 < lis_~i~0); 4680#L519-2 [2020-07-29 03:26:17,656 INFO L796 eck$LassoCheckResult]: Loop: 4680#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 4647#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4648#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 4663#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 4664#L521-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8; 4675#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4676#L520-3 assume !(lis_~j~0 < lis_~i~0); 4680#L519-2 [2020-07-29 03:26:17,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:17,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1035299872, now seen corresponding path program 2 times [2020-07-29 03:26:17,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:17,657 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804044855] [2020-07-29 03:26:17,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:17,714 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:17,763 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:17,769 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:17,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:17,769 INFO L82 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 7 times [2020-07-29 03:26:17,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:17,770 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612687953] [2020-07-29 03:26:17,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:17,775 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:17,778 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:17,780 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:17,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:17,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1635630457, now seen corresponding path program 1 times [2020-07-29 03:26:17,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:17,781 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936720542] [2020-07-29 03:26:17,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:17,854 INFO L280 TraceCheckUtils]: 0: Hoare triple {4927#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4927#true} is VALID [2020-07-29 03:26:17,855 INFO L280 TraceCheckUtils]: 1: Hoare triple {4927#true} havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; {4927#true} is VALID [2020-07-29 03:26:17,855 INFO L280 TraceCheckUtils]: 2: Hoare triple {4927#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {4927#true} is VALID [2020-07-29 03:26:17,855 INFO L280 TraceCheckUtils]: 3: Hoare triple {4927#true} call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; {4927#true} is VALID [2020-07-29 03:26:17,855 INFO L280 TraceCheckUtils]: 4: Hoare triple {4927#true} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {4927#true} is VALID [2020-07-29 03:26:17,855 INFO L280 TraceCheckUtils]: 5: Hoare triple {4927#true} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {4927#true} is VALID [2020-07-29 03:26:17,856 INFO L280 TraceCheckUtils]: 6: Hoare triple {4927#true} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {4927#true} is VALID [2020-07-29 03:26:17,856 INFO L280 TraceCheckUtils]: 7: Hoare triple {4927#true} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {4927#true} is VALID [2020-07-29 03:26:17,856 INFO L280 TraceCheckUtils]: 8: Hoare triple {4927#true} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {4927#true} is VALID [2020-07-29 03:26:17,857 INFO L280 TraceCheckUtils]: 9: Hoare triple {4927#true} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {4927#true} is VALID [2020-07-29 03:26:17,857 INFO L280 TraceCheckUtils]: 10: Hoare triple {4927#true} assume !(main_~i~1 < main_~array_size~0); {4927#true} is VALID [2020-07-29 03:26:17,857 INFO L280 TraceCheckUtils]: 11: Hoare triple {4927#true} 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; {4927#true} is VALID [2020-07-29 03:26:17,857 INFO L280 TraceCheckUtils]: 12: Hoare triple {4927#true} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {4927#true} is VALID [2020-07-29 03:26:17,857 INFO L280 TraceCheckUtils]: 13: Hoare triple {4927#true} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {4927#true} is VALID [2020-07-29 03:26:17,858 INFO L280 TraceCheckUtils]: 14: Hoare triple {4927#true} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {4927#true} is VALID [2020-07-29 03:26:17,858 INFO L280 TraceCheckUtils]: 15: Hoare triple {4927#true} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {4927#true} is VALID [2020-07-29 03:26:17,858 INFO L280 TraceCheckUtils]: 16: Hoare triple {4927#true} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {4927#true} is VALID [2020-07-29 03:26:17,859 INFO L280 TraceCheckUtils]: 17: Hoare triple {4927#true} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {4927#true} is VALID [2020-07-29 03:26:17,859 INFO L280 TraceCheckUtils]: 18: Hoare triple {4927#true} assume !(lis_~i~0 < lis_~N); {4927#true} is VALID [2020-07-29 03:26:17,860 INFO L280 TraceCheckUtils]: 19: Hoare triple {4927#true} lis_~i~0 := 1; {4929#(= ULTIMATE.start_lis_~i~0 1)} is VALID [2020-07-29 03:26:17,860 INFO L280 TraceCheckUtils]: 20: Hoare triple {4929#(= ULTIMATE.start_lis_~i~0 1)} assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; {4929#(= ULTIMATE.start_lis_~i~0 1)} is VALID [2020-07-29 03:26:17,861 INFO L280 TraceCheckUtils]: 21: Hoare triple {4929#(= ULTIMATE.start_lis_~i~0 1)} assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; {4929#(= ULTIMATE.start_lis_~i~0 1)} is VALID [2020-07-29 03:26:17,862 INFO L280 TraceCheckUtils]: 22: Hoare triple {4929#(= ULTIMATE.start_lis_~i~0 1)} assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; {4929#(= ULTIMATE.start_lis_~i~0 1)} is VALID [2020-07-29 03:26:17,863 INFO L280 TraceCheckUtils]: 23: Hoare triple {4929#(= ULTIMATE.start_lis_~i~0 1)} assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;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); {4929#(= ULTIMATE.start_lis_~i~0 1)} is VALID [2020-07-29 03:26:17,864 INFO L280 TraceCheckUtils]: 24: Hoare triple {4929#(= ULTIMATE.start_lis_~i~0 1)} lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; {4929#(= ULTIMATE.start_lis_~i~0 1)} is VALID [2020-07-29 03:26:17,864 INFO L280 TraceCheckUtils]: 25: Hoare triple {4929#(= ULTIMATE.start_lis_~i~0 1)} assume !(lis_~j~0 < lis_~i~0); {4929#(= ULTIMATE.start_lis_~i~0 1)} is VALID [2020-07-29 03:26:17,865 INFO L280 TraceCheckUtils]: 26: Hoare triple {4929#(= ULTIMATE.start_lis_~i~0 1)} lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; {4930#(<= 2 ULTIMATE.start_lis_~i~0)} is VALID [2020-07-29 03:26:17,866 INFO L280 TraceCheckUtils]: 27: Hoare triple {4930#(<= 2 ULTIMATE.start_lis_~i~0)} assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; {4931#(and (<= 2 ULTIMATE.start_lis_~i~0) (= 0 ULTIMATE.start_lis_~j~0))} is VALID [2020-07-29 03:26:17,868 INFO L280 TraceCheckUtils]: 28: Hoare triple {4931#(and (<= 2 ULTIMATE.start_lis_~i~0) (= 0 ULTIMATE.start_lis_~j~0))} assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; {4931#(and (<= 2 ULTIMATE.start_lis_~i~0) (= 0 ULTIMATE.start_lis_~j~0))} is VALID [2020-07-29 03:26:17,870 INFO L280 TraceCheckUtils]: 29: Hoare triple {4931#(and (<= 2 ULTIMATE.start_lis_~i~0) (= 0 ULTIMATE.start_lis_~j~0))} assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; {4931#(and (<= 2 ULTIMATE.start_lis_~i~0) (= 0 ULTIMATE.start_lis_~j~0))} is VALID [2020-07-29 03:26:17,871 INFO L280 TraceCheckUtils]: 30: Hoare triple {4931#(and (<= 2 ULTIMATE.start_lis_~i~0) (= 0 ULTIMATE.start_lis_~j~0))} assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8; {4931#(and (<= 2 ULTIMATE.start_lis_~i~0) (= 0 ULTIMATE.start_lis_~j~0))} is VALID [2020-07-29 03:26:17,872 INFO L280 TraceCheckUtils]: 31: Hoare triple {4931#(and (<= 2 ULTIMATE.start_lis_~i~0) (= 0 ULTIMATE.start_lis_~j~0))} lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; {4932#(<= (+ ULTIMATE.start_lis_~j~0 1) ULTIMATE.start_lis_~i~0)} is VALID [2020-07-29 03:26:17,873 INFO L280 TraceCheckUtils]: 32: Hoare triple {4932#(<= (+ ULTIMATE.start_lis_~j~0 1) ULTIMATE.start_lis_~i~0)} assume !(lis_~j~0 < lis_~i~0); {4928#false} is VALID [2020-07-29 03:26:17,875 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-07-29 03:26:17,875 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936720542] [2020-07-29 03:26:17,875 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037350676] [2020-07-29 03:26:17,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:26:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:17,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:26:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:17,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:18,061 INFO L280 TraceCheckUtils]: 0: Hoare triple {4927#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4927#true} is VALID [2020-07-29 03:26:18,061 INFO L280 TraceCheckUtils]: 1: Hoare triple {4927#true} havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; {4927#true} is VALID [2020-07-29 03:26:18,061 INFO L280 TraceCheckUtils]: 2: Hoare triple {4927#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {4927#true} is VALID [2020-07-29 03:26:18,062 INFO L280 TraceCheckUtils]: 3: Hoare triple {4927#true} call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; {4927#true} is VALID [2020-07-29 03:26:18,062 INFO L280 TraceCheckUtils]: 4: Hoare triple {4927#true} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {4927#true} is VALID [2020-07-29 03:26:18,062 INFO L280 TraceCheckUtils]: 5: Hoare triple {4927#true} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {4927#true} is VALID [2020-07-29 03:26:18,062 INFO L280 TraceCheckUtils]: 6: Hoare triple {4927#true} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {4927#true} is VALID [2020-07-29 03:26:18,062 INFO L280 TraceCheckUtils]: 7: Hoare triple {4927#true} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {4927#true} is VALID [2020-07-29 03:26:18,062 INFO L280 TraceCheckUtils]: 8: Hoare triple {4927#true} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; {4927#true} is VALID [2020-07-29 03:26:18,063 INFO L280 TraceCheckUtils]: 9: Hoare triple {4927#true} main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; {4927#true} is VALID [2020-07-29 03:26:18,063 INFO L280 TraceCheckUtils]: 10: Hoare triple {4927#true} assume !(main_~i~1 < main_~array_size~0); {4927#true} is VALID [2020-07-29 03:26:18,063 INFO L280 TraceCheckUtils]: 11: Hoare triple {4927#true} 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; {4927#true} is VALID [2020-07-29 03:26:18,064 INFO L280 TraceCheckUtils]: 12: Hoare triple {4927#true} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {4927#true} is VALID [2020-07-29 03:26:18,064 INFO L280 TraceCheckUtils]: 13: Hoare triple {4927#true} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {4927#true} is VALID [2020-07-29 03:26:18,064 INFO L280 TraceCheckUtils]: 14: Hoare triple {4927#true} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {4927#true} is VALID [2020-07-29 03:26:18,064 INFO L280 TraceCheckUtils]: 15: Hoare triple {4927#true} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {4927#true} is VALID [2020-07-29 03:26:18,064 INFO L280 TraceCheckUtils]: 16: Hoare triple {4927#true} assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); {4927#true} is VALID [2020-07-29 03:26:18,065 INFO L280 TraceCheckUtils]: 17: Hoare triple {4927#true} lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; {4927#true} is VALID [2020-07-29 03:26:18,065 INFO L280 TraceCheckUtils]: 18: Hoare triple {4927#true} assume !(lis_~i~0 < lis_~N); {4927#true} is VALID [2020-07-29 03:26:18,066 INFO L280 TraceCheckUtils]: 19: Hoare triple {4927#true} lis_~i~0 := 1; {4993#(<= 1 ULTIMATE.start_lis_~i~0)} is VALID [2020-07-29 03:26:18,067 INFO L280 TraceCheckUtils]: 20: Hoare triple {4993#(<= 1 ULTIMATE.start_lis_~i~0)} assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; {4993#(<= 1 ULTIMATE.start_lis_~i~0)} is VALID [2020-07-29 03:26:18,067 INFO L280 TraceCheckUtils]: 21: Hoare triple {4993#(<= 1 ULTIMATE.start_lis_~i~0)} assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; {4993#(<= 1 ULTIMATE.start_lis_~i~0)} is VALID [2020-07-29 03:26:18,068 INFO L280 TraceCheckUtils]: 22: Hoare triple {4993#(<= 1 ULTIMATE.start_lis_~i~0)} assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; {4993#(<= 1 ULTIMATE.start_lis_~i~0)} is VALID [2020-07-29 03:26:18,068 INFO L280 TraceCheckUtils]: 23: Hoare triple {4993#(<= 1 ULTIMATE.start_lis_~i~0)} assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;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); {4993#(<= 1 ULTIMATE.start_lis_~i~0)} is VALID [2020-07-29 03:26:18,069 INFO L280 TraceCheckUtils]: 24: Hoare triple {4993#(<= 1 ULTIMATE.start_lis_~i~0)} lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; {4993#(<= 1 ULTIMATE.start_lis_~i~0)} is VALID [2020-07-29 03:26:18,070 INFO L280 TraceCheckUtils]: 25: Hoare triple {4993#(<= 1 ULTIMATE.start_lis_~i~0)} assume !(lis_~j~0 < lis_~i~0); {4993#(<= 1 ULTIMATE.start_lis_~i~0)} is VALID [2020-07-29 03:26:18,071 INFO L280 TraceCheckUtils]: 26: Hoare triple {4993#(<= 1 ULTIMATE.start_lis_~i~0)} lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; {4930#(<= 2 ULTIMATE.start_lis_~i~0)} is VALID [2020-07-29 03:26:18,071 INFO L280 TraceCheckUtils]: 27: Hoare triple {4930#(<= 2 ULTIMATE.start_lis_~i~0)} assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; {5018#(and (<= 2 ULTIMATE.start_lis_~i~0) (<= ULTIMATE.start_lis_~j~0 0))} is VALID [2020-07-29 03:26:18,073 INFO L280 TraceCheckUtils]: 28: Hoare triple {5018#(and (<= 2 ULTIMATE.start_lis_~i~0) (<= ULTIMATE.start_lis_~j~0 0))} assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; {5018#(and (<= 2 ULTIMATE.start_lis_~i~0) (<= ULTIMATE.start_lis_~j~0 0))} is VALID [2020-07-29 03:26:18,074 INFO L280 TraceCheckUtils]: 29: Hoare triple {5018#(and (<= 2 ULTIMATE.start_lis_~i~0) (<= ULTIMATE.start_lis_~j~0 0))} assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; {5018#(and (<= 2 ULTIMATE.start_lis_~i~0) (<= ULTIMATE.start_lis_~j~0 0))} is VALID [2020-07-29 03:26:18,075 INFO L280 TraceCheckUtils]: 30: Hoare triple {5018#(and (<= 2 ULTIMATE.start_lis_~i~0) (<= ULTIMATE.start_lis_~j~0 0))} assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8; {5018#(and (<= 2 ULTIMATE.start_lis_~i~0) (<= ULTIMATE.start_lis_~j~0 0))} is VALID [2020-07-29 03:26:18,076 INFO L280 TraceCheckUtils]: 31: Hoare triple {5018#(and (<= 2 ULTIMATE.start_lis_~i~0) (<= ULTIMATE.start_lis_~j~0 0))} lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; {5031#(and (<= 2 ULTIMATE.start_lis_~i~0) (<= ULTIMATE.start_lis_~j~0 1))} is VALID [2020-07-29 03:26:18,077 INFO L280 TraceCheckUtils]: 32: Hoare triple {5031#(and (<= 2 ULTIMATE.start_lis_~i~0) (<= ULTIMATE.start_lis_~j~0 1))} assume !(lis_~j~0 < lis_~i~0); {4928#false} is VALID [2020-07-29 03:26:18,078 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-07-29 03:26:18,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:26:18,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-07-29 03:26:18,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834093357] [2020-07-29 03:26:18,229 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2020-07-29 03:26:18,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:18,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 03:26:18,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-07-29 03:26:18,299 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. cyclomatic complexity: 19 Second operand 9 states. [2020-07-29 03:26:18,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:18,578 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2020-07-29 03:26:18,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 03:26:18,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 03:26:18,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:18,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 90 transitions. [2020-07-29 03:26:18,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-07-29 03:26:18,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 45 states and 56 transitions. [2020-07-29 03:26:18,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2020-07-29 03:26:18,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2020-07-29 03:26:18,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 56 transitions. [2020-07-29 03:26:18,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:18,646 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 56 transitions. [2020-07-29 03:26:18,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 56 transitions. [2020-07-29 03:26:18,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2020-07-29 03:26:18,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:18,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states and 56 transitions. Second operand 40 states. [2020-07-29 03:26:18,649 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states and 56 transitions. Second operand 40 states. [2020-07-29 03:26:18,649 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand 40 states. [2020-07-29 03:26:18,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:18,650 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2020-07-29 03:26:18,651 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2020-07-29 03:26:18,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:18,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:18,651 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 45 states and 56 transitions. [2020-07-29 03:26:18,651 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 45 states and 56 transitions. [2020-07-29 03:26:18,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:18,653 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2020-07-29 03:26:18,653 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2020-07-29 03:26:18,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:18,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:18,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:18,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:18,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-29 03:26:18,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2020-07-29 03:26:18,659 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2020-07-29 03:26:18,659 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2020-07-29 03:26:18,659 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2020-07-29 03:26:18,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2020-07-29 03:26:18,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 03:26:18,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:18,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:18,661 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:18,661 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2020-07-29 03:26:18,662 INFO L794 eck$LassoCheckResult]: Stem: 5121#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 5114#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 5115#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 5123#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 5116#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 5112#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 5113#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 5117#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 5134#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 5132#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 5131#L535-3 assume !(main_~i~1 < main_~array_size~0); 5122#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 5109#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 5107#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 5108#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 5110#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 5133#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 5130#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 5129#L517-3 assume !(lis_~i~0 < lis_~N); 5111#L517-4 lis_~i~0 := 1; 5105#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 5106#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 5144#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 5142#L521-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8;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); 5141#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5135#L520-3 assume !(lis_~j~0 < lis_~i~0); 5127#L519-2 [2020-07-29 03:26:18,662 INFO L796 eck$LassoCheckResult]: Loop: 5127#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 5128#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 5140#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 5139#L521 assume !lis_#t~short11; 5137#L521-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8; 5125#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5126#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 5118#L521 assume !lis_#t~short11; 5120#L521-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem8; 5124#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5136#L520-3 assume !(lis_~j~0 < lis_~i~0); 5127#L519-2 [2020-07-29 03:26:18,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:18,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1035299872, now seen corresponding path program 3 times [2020-07-29 03:26:18,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:18,663 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168444649] [2020-07-29 03:26:18,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:18,709 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:18,739 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:18,747 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:18,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:18,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1752732867, now seen corresponding path program 1 times [2020-07-29 03:26:18,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:18,749 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281161907] [2020-07-29 03:26:18,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:18,754 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:18,760 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:18,762 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:18,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:18,763 INFO L82 PathProgramCache]: Analyzing trace with hash 117015998, now seen corresponding path program 1 times [2020-07-29 03:26:18,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:18,763 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192333996] [2020-07-29 03:26:18,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:18,807 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:18,851 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:18,863 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:19,020 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2020-07-29 03:26:32,031 WARN L193 SmtUtils]: Spent 12.92 s on a formula simplification. DAG size of input: 310 DAG size of output: 211 [2020-07-29 03:26:35,703 WARN L193 SmtUtils]: Spent 3.54 s on a formula simplification that was a NOOP. DAG size: 139 [2020-07-29 03:26:35,711 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:35,712 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:35,712 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:35,712 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:35,712 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:35,712 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:35,712 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:35,712 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:35,712 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration15_Lasso [2020-07-29 03:26:35,713 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:35,713 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:35,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:35,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:35,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:35,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:35,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:35,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:35,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:35,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:35,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:35,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:35,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:35,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:35,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:35,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:35,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:38,222 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-29 03:26:38,231 INFO L168 Benchmark]: Toolchain (without parser) took 44855.68 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 519.0 MB). Free memory was 954.9 MB in the beginning and 1.4 GB in the end (delta: -449.3 MB). Peak memory consumption was 611.1 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:38,231 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:26:38,231 INFO L168 Benchmark]: CACSL2BoogieTranslator took 658.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:38,232 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:38,232 INFO L168 Benchmark]: Boogie Preprocessor took 32.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:26:38,232 INFO L168 Benchmark]: RCFGBuilder took 666.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:38,233 INFO L168 Benchmark]: BuchiAutomizer took 43407.39 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 378.5 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -326.5 MB). Peak memory consumption was 593.4 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:38,235 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 658.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 666.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 43407.39 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 378.5 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -326.5 MB). Peak memory consumption was 593.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...