./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/lis-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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-9a8b2e8 [2020-10-20 08:18:12,896 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 08:18:12,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 08:18:12,924 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 08:18:12,924 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 08:18:12,925 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 08:18:12,927 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 08:18:12,928 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 08:18:12,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 08:18:12,931 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 08:18:12,932 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 08:18:12,933 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 08:18:12,934 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 08:18:12,935 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 08:18:12,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 08:18:12,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 08:18:12,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 08:18:12,939 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 08:18:12,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 08:18:12,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 08:18:12,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 08:18:12,956 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 08:18:12,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 08:18:12,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 08:18:12,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 08:18:12,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 08:18:12,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 08:18:12,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 08:18:12,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 08:18:12,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 08:18:12,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 08:18:12,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 08:18:12,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 08:18:12,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 08:18:12,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 08:18:12,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 08:18:12,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 08:18:12,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 08:18:12,969 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 08:18:12,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 08:18:12,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 08:18:12,971 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 08:18:12,995 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 08:18:12,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 08:18:12,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 08:18:12,997 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 08:18:12,997 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 08:18:12,998 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 08:18:12,998 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 08:18:12,998 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 08:18:12,998 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 08:18:12,998 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 08:18:12,998 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 08:18:12,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 08:18:12,999 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 08:18:12,999 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 08:18:12,999 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 08:18:12,999 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 08:18:13,000 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 08:18:13,000 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 08:18:13,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 08:18:13,000 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 08:18:13,000 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 08:18:13,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 08:18:13,001 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 08:18:13,001 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 08:18:13,001 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 08:18:13,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 08:18:13,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 08:18:13,002 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 08:18:13,002 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 08:18:13,002 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 08:18:13,003 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 08:18:13,003 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 08:18:13,004 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 08:18:13,004 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-10-20 08:18:13,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 08:18:13,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 08:18:13,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 08:18:13,224 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 08:18:13,225 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 08:18:13,225 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2020-10-20 08:18:13,318 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74a94a96a/ed70f12295434ac89103791041ca351a/FLAGd7abe0bdf [2020-10-20 08:18:13,941 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 08:18:13,942 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2020-10-20 08:18:13,956 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74a94a96a/ed70f12295434ac89103791041ca351a/FLAGd7abe0bdf [2020-10-20 08:18:14,235 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74a94a96a/ed70f12295434ac89103791041ca351a [2020-10-20 08:18:14,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 08:18:14,248 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 08:18:14,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 08:18:14,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 08:18:14,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 08:18:14,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:18:14" (1/1) ... [2020-10-20 08:18:14,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@577cf467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:14, skipping insertion in model container [2020-10-20 08:18:14,260 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:18:14" (1/1) ... [2020-10-20 08:18:14,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 08:18:14,330 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 08:18:14,728 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:18:14,741 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 08:18:14,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:18:14,864 INFO L208 MainTranslator]: Completed translation [2020-10-20 08:18:14,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:14 WrapperNode [2020-10-20 08:18:14,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 08:18:14,865 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 08:18:14,865 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 08:18:14,866 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 08:18:14,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:14" (1/1) ... [2020-10-20 08:18:14,888 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:14" (1/1) ... [2020-10-20 08:18:14,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 08:18:14,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 08:18:14,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 08:18:14,915 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 08:18:14,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:14" (1/1) ... [2020-10-20 08:18:14,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:14" (1/1) ... [2020-10-20 08:18:14,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:14" (1/1) ... [2020-10-20 08:18:14,930 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:14" (1/1) ... [2020-10-20 08:18:14,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:14" (1/1) ... [2020-10-20 08:18:14,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:14" (1/1) ... [2020-10-20 08:18:14,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:14" (1/1) ... [2020-10-20 08:18:14,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 08:18:14,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 08:18:14,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 08:18:14,955 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 08:18:14,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:14" (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-10-20 08:18:15,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 08:18:15,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 08:18:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 08:18:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 08:18:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 08:18:15,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 08:18:15,410 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 08:18:15,410 INFO L298 CfgBuilder]: Removed 11 assume(true) statements. [2020-10-20 08:18:15,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:18:15 BoogieIcfgContainer [2020-10-20 08:18:15,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 08:18:15,413 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 08:18:15,413 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 08:18:15,417 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 08:18:15,418 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:18:15,418 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 08:18:14" (1/3) ... [2020-10-20 08:18:15,419 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7767b995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:18:15, skipping insertion in model container [2020-10-20 08:18:15,419 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:18:15,420 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:14" (2/3) ... [2020-10-20 08:18:15,420 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7767b995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:18:15, skipping insertion in model container [2020-10-20 08:18:15,420 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:18:15,422 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:18:15" (3/3) ... [2020-10-20 08:18:15,424 INFO L373 chiAutomizerObserver]: Analyzing ICFG lis-alloca-1.i [2020-10-20 08:18:15,464 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 08:18:15,464 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 08:18:15,464 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 08:18:15,464 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 08:18:15,465 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 08:18:15,465 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 08:18:15,465 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 08:18:15,465 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 08:18:15,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-10-20 08:18:15,510 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2020-10-20 08:18:15,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:15,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:15,517 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 08:18:15,517 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:18:15,517 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 08:18:15,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-10-20 08:18:15,520 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2020-10-20 08:18:15,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:15,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:15,521 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 08:18:15,522 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:18:15,530 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-10-20 08:18:15,530 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-10-20 08:18:15,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:15,538 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-10-20 08:18:15,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:15,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444341804] [2020-10-20 08:18:15,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:15,655 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:15,666 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:15,688 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:15,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:15,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2020-10-20 08:18:15,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:15,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518114934] [2020-10-20 08:18:15,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:15,701 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:15,710 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:15,716 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:15,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:15,719 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2020-10-20 08:18:15,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:15,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173808385] [2020-10-20 08:18:15,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:15,773 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:15,788 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:15,792 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:15,967 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-10-20 08:18:16,035 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:18:16,036 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:18:16,036 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:18:16,036 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:18:16,036 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:18:16,036 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:16,036 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:18:16,037 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:18:16,037 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration1_Lasso [2020-10-20 08:18:16,037 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:18:16,037 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:18:16,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:16,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:16,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:16,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:16,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:16,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:16,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:16,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:16,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:16,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:16,571 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:18:16,577 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-10-20 08:18:16,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:18:16,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:16,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:16,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:16,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:16,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:16,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:16,603 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-10-20 08:18:16,606 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) [2020-10-20 08:18:16,649 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-20 08:18:16,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:16,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:16,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:16,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:16,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:16,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:16,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:16,655 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:16,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-20 08:18:16,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:16,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:16,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:16,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:16,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:16,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:16,712 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-10-20 08:18:16,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-20 08:18:16,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:16,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:16,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:16,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:16,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:16,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:16,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:16,769 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) [2020-10-20 08:18:16,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-20 08:18:16,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:16,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:16,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:16,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:16,833 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:16,833 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:16,848 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:18:16,887 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-20 08:18:16,888 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. 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) [2020-10-20 08:18:16,893 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:16,897 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-20 08:18:16,897 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:18:16,898 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1) = -4*ULTIMATE.start_main_~i~1 + 2147483637 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 + 1*ULTIMATE.start_main_~numbers~0.offset + 2147483640 >= 0] [2020-10-20 08:18:16,950 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-10-20 08:18:16,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:17,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 08:18:17,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:17,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 08:18:17,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:17,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:18:17,082 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-10-20 08:18:17,083 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 4 states. [2020-10-20 08:18:17,256 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 4 states. Result 47 states and 74 transitions. Complement of second has 9 states. [2020-10-20 08:18:17,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 08:18:17,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 08:18:17,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2020-10-20 08:18:17,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-20 08:18:17,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:17,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 6 letters. Loop has 2 letters. [2020-10-20 08:18:17,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:17,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 4 letters. Loop has 4 letters. [2020-10-20 08:18:17,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:17,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 74 transitions. [2020-10-20 08:18:17,277 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-20 08:18:17,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 21 states and 33 transitions. [2020-10-20 08:18:17,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-20 08:18:17,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-20 08:18:17,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 33 transitions. [2020-10-20 08:18:17,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:18:17,288 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2020-10-20 08:18:17,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 33 transitions. [2020-10-20 08:18:17,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-10-20 08:18:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-20 08:18:17,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2020-10-20 08:18:17,325 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2020-10-20 08:18:17,325 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2020-10-20 08:18:17,325 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 08:18:17,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 33 transitions. [2020-10-20 08:18:17,328 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-20 08:18:17,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:17,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:17,330 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-20 08:18:17,330 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:18:17,331 INFO L794 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 155#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; 156#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 160#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; 153#L535-3 assume !(main_~i~1 < main_~array_size~0); 154#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; 146#L517-3 [2020-10-20 08:18:17,331 INFO L796 eck$LassoCheckResult]: Loop: 146#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); 145#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 146#L517-3 [2020-10-20 08:18:17,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:17,331 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2020-10-20 08:18:17,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:17,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705718258] [2020-10-20 08:18:17,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:17,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:18:17,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705718258] [2020-10-20 08:18:17,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:18:17,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:18:17,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793765872] [2020-10-20 08:18:17,410 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:18:17,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:17,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2020-10-20 08:18:17,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:17,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860840072] [2020-10-20 08:18:17,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:17,420 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:17,426 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:17,429 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:17,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:18:17,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:18:17,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:18:17,491 INFO L87 Difference]: Start difference. First operand 21 states and 33 transitions. cyclomatic complexity: 16 Second operand 4 states. [2020-10-20 08:18:17,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:18:17,533 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2020-10-20 08:18:17,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:18:17,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2020-10-20 08:18:17,536 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-20 08:18:17,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2020-10-20 08:18:17,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-10-20 08:18:17,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-20 08:18:17,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2020-10-20 08:18:17,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:18:17,538 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-10-20 08:18:17,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2020-10-20 08:18:17,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-10-20 08:18:17,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-20 08:18:17,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2020-10-20 08:18:17,541 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-10-20 08:18:17,541 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-10-20 08:18:17,542 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 08:18:17,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2020-10-20 08:18:17,542 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-20 08:18:17,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:17,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:17,543 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:18:17,544 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:18:17,544 INFO L794 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 203#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; 204#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 210#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; 205#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; 201#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 202#L535-3 assume !(main_~i~1 < main_~array_size~0); 206#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; 196#L517-3 [2020-10-20 08:18:17,544 INFO L796 eck$LassoCheckResult]: Loop: 196#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); 195#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 196#L517-3 [2020-10-20 08:18:17,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:17,545 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2020-10-20 08:18:17,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:17,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168200758] [2020-10-20 08:18:17,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:17,571 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:17,586 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:17,592 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:17,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:17,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2020-10-20 08:18:17,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:17,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124870256] [2020-10-20 08:18:17,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:17,600 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:17,606 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:17,608 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:17,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:17,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1899811567, now seen corresponding path program 1 times [2020-10-20 08:18:17,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:17,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214889985] [2020-10-20 08:18:17,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:17,633 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:17,654 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:17,660 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:18,170 WARN L193 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 97 [2020-10-20 08:18:18,339 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-10-20 08:18:18,342 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:18:18,342 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:18:18,342 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:18:18,342 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:18:18,342 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:18:18,342 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:18,342 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:18:18,343 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:18:18,343 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration3_Lasso [2020-10-20 08:18:18,343 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:18:18,343 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:18:18,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:18,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:18,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:18,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:18,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:18,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:18,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:18,716 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2020-10-20 08:18:18,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-10-20 08:18:18,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:18,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-10-20 08:18:18,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:18,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:18,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:18,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:18,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:18,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:18,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:18,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:18,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:18,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:18,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:18,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:18,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:18,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:18,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:18,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:19,098 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2020-10-20 08:18:19,498 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:18:19,498 INFO L489 LassoAnalysis]: Using template 'affine'. 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-10-20 08:18:19,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-20 08:18:19,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:19,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:19,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:19,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:19,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:19,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:19,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:19,518 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:19,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-20 08:18:19,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:19,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:19,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:19,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:19,547 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:19,547 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:19,553 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 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-10-20 08:18:19,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-20 08:18:19,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:19,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:19,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:19,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:19,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:19,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:19,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:19,589 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-10-20 08:18:19,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:18:19,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:19,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:19,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:19,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:19,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:19,622 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:19,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:19,623 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-10-20 08:18:19,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:18:19,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:19,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:19,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:19,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:19,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:19,652 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:19,656 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-10-20 08:18:19,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-20 08:18:19,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:19,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:19,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:19,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:19,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:19,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:19,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:19,701 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:19,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-20 08:18:19,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:19,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:19,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:19,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:19,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:19,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:19,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:19,735 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:19,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-20 08:18:19,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:19,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:19,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:19,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:19,776 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:19,777 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:19,802 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:18:19,873 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2020-10-20 08:18:19,873 INFO L444 ModelExtractionUtils]: 43 out of 55 variables were initially zero. Simplification set additionally 9 variables to zero. 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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:19,876 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:18:19,884 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:18:19,884 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:18:19,884 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-10-20 08:18:19,966 INFO L297 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2020-10-20 08:18:19,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:20,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:18:20,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:20,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:18:20,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:18:20,033 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-10-20 08:18:20,033 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-10-20 08:18:20,056 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-10-20 08:18:20,057 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-10-20 08:18:20,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:18:20,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-10-20 08:18:20,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 2 letters. [2020-10-20 08:18:20,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:20,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2020-10-20 08:18:20,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:20,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2020-10-20 08:18:20,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:20,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2020-10-20 08:18:20,063 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-10-20 08:18:20,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 31 transitions. [2020-10-20 08:18:20,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-20 08:18:20,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-20 08:18:20,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2020-10-20 08:18:20,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:18:20,066 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-10-20 08:18:20,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2020-10-20 08:18:20,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-10-20 08:18:20,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-20 08:18:20,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2020-10-20 08:18:20,070 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-10-20 08:18:20,070 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-10-20 08:18:20,070 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 08:18:20,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2020-10-20 08:18:20,071 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-10-20 08:18:20,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:20,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:20,073 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:18:20,074 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:18:20,074 INFO L794 eck$LassoCheckResult]: Stem: 381#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 375#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; 376#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 382#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; 377#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; 373#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 374#L535-3 assume !(main_~i~1 < main_~array_size~0); 378#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; 369#L517-3 assume !(lis_~i~0 < lis_~N); 370#L517-4 lis_~i~0 := 1; 363#L519-3 [2020-10-20 08:18:20,075 INFO L796 eck$LassoCheckResult]: Loop: 363#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 365#L520-3 assume !(lis_~j~0 < lis_~i~0); 384#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 363#L519-3 [2020-10-20 08:18:20,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:20,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1899811625, now seen corresponding path program 1 times [2020-10-20 08:18:20,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:20,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712854217] [2020-10-20 08:18:20,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:20,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 08:18:20,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712854217] [2020-10-20 08:18:20,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:18:20,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:18:20,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847952141] [2020-10-20 08:18:20,185 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:18:20,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:20,185 INFO L82 PathProgramCache]: Analyzing trace with hash 74687, now seen corresponding path program 1 times [2020-10-20 08:18:20,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:20,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311699572] [2020-10-20 08:18:20,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:20,189 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:20,191 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:20,194 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:20,209 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:18:20,210 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:18:20,210 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:18:20,210 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:18:20,210 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 08:18:20,210 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:20,210 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:18:20,210 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:18:20,210 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2020-10-20 08:18:20,210 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:18:20,211 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:18:20,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:20,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:20,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:20,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:20,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:20,286 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:18:20,287 INFO L404 LassoAnalysis]: Checking for nontermination... 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-10-20 08:18:20,301 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:18:20,301 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 [2020-10-20 08:18:20,307 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:18:20,307 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:20,342 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:18:20,342 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:18:20,346 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:18:20,346 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 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-10-20 08:18:20,381 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:18:20,381 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) [2020-10-20 08:18:20,439 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 08:18:20,439 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:20,636 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 08:18:20,638 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:18:20,639 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:18:20,639 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:18:20,639 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:18:20,639 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:18:20,639 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:20,639 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:18:20,639 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:18:20,639 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2020-10-20 08:18:20,639 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:18:20,640 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:18:20,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:20,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:20,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:20,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:20,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:20,724 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:18:20,724 INFO L489 LassoAnalysis]: Using template 'affine'. 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-10-20 08:18:20,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-20 08:18:20,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:20,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:20,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:20,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:20,742 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:20,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:20,751 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:18:20,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:18:20,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:20,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:20,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:20,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:20,798 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:20,799 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:20,811 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:20,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-20 08:18:20,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:20,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:20,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:20,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:20,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:20,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:20,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:20,866 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:18:20,873 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-10-20 08:18:20,873 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:20,875 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:18:20,876 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 08:18:20,876 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:18:20,876 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-10-20 08:18:20,897 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 08:18:20,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:20,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:18:20,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:20,934 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:18:20,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:20,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:18:20,945 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-10-20 08:18:20,945 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-10-20 08:18:20,970 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 30 states and 46 transitions. Complement of second has 7 states. [2020-10-20 08:18:20,971 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-10-20 08:18:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:18:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2020-10-20 08:18:20,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 10 letters. Loop has 3 letters. [2020-10-20 08:18:20,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:20,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 13 letters. Loop has 3 letters. [2020-10-20 08:18:20,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:20,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 10 letters. Loop has 6 letters. [2020-10-20 08:18:20,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:20,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 46 transitions. [2020-10-20 08:18:20,974 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 08:18:20,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 28 states and 42 transitions. [2020-10-20 08:18:20,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-20 08:18:20,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-20 08:18:20,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 42 transitions. [2020-10-20 08:18:20,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:18:20,975 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2020-10-20 08:18:20,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 42 transitions. [2020-10-20 08:18:20,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-10-20 08:18:20,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-20 08:18:20,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2020-10-20 08:18:20,979 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 41 transitions. [2020-10-20 08:18:20,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:18:20,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:18:20,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:18:20,980 INFO L87 Difference]: Start difference. First operand 27 states and 41 transitions. Second operand 4 states. [2020-10-20 08:18:21,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:18:21,037 INFO L93 Difference]: Finished difference Result 28 states and 41 transitions. [2020-10-20 08:18:21,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:18:21,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 41 transitions. [2020-10-20 08:18:21,039 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 08:18:21,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 41 transitions. [2020-10-20 08:18:21,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-20 08:18:21,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-20 08:18:21,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 41 transitions. [2020-10-20 08:18:21,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:18:21,041 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 41 transitions. [2020-10-20 08:18:21,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 41 transitions. [2020-10-20 08:18:21,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-10-20 08:18:21,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-20 08:18:21,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2020-10-20 08:18:21,044 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. [2020-10-20 08:18:21,045 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. [2020-10-20 08:18:21,045 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 08:18:21,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 40 transitions. [2020-10-20 08:18:21,046 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 08:18:21,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:21,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:21,047 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:18:21,047 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:18:21,047 INFO L794 eck$LassoCheckResult]: Stem: 557#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 549#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; 550#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 558#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; 551#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; 547#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 548#L535-3 assume !(main_~i~1 < main_~array_size~0); 552#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; 543#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); 540#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 541#L517-3 assume !(lis_~i~0 < lis_~N); 544#L517-4 lis_~i~0 := 1; 535#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 538#L520-3 [2020-10-20 08:18:21,048 INFO L796 eck$LassoCheckResult]: Loop: 538#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; 553#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; 554#L521-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 559#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 538#L520-3 [2020-10-20 08:18:21,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:21,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1792663252, now seen corresponding path program 1 times [2020-10-20 08:18:21,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:21,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988641586] [2020-10-20 08:18:21,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:21,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 08:18:21,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988641586] [2020-10-20 08:18:21,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493768129] [2020-10-20 08:18:21,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:18:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:21,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 08:18:21,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:21,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 08:18:21,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:18:21,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2020-10-20 08:18:21,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161706106] [2020-10-20 08:18:21,210 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:18:21,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:21,210 INFO L82 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 1 times [2020-10-20 08:18:21,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:21,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118864533] [2020-10-20 08:18:21,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:21,219 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:21,226 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:21,228 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:21,377 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-10-20 08:18:21,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:18:21,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 08:18:21,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-20 08:18:21,407 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. cyclomatic complexity: 18 Second operand 10 states. [2020-10-20 08:18:21,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:18:21,703 INFO L93 Difference]: Finished difference Result 71 states and 94 transitions. [2020-10-20 08:18:21,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 08:18:21,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 94 transitions. [2020-10-20 08:18:21,706 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-20 08:18:21,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 48 states and 66 transitions. [2020-10-20 08:18:21,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-10-20 08:18:21,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-10-20 08:18:21,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 66 transitions. [2020-10-20 08:18:21,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:18:21,708 INFO L691 BuchiCegarLoop]: Abstraction has 48 states and 66 transitions. [2020-10-20 08:18:21,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 66 transitions. [2020-10-20 08:18:21,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 31. [2020-10-20 08:18:21,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-20 08:18:21,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-10-20 08:18:21,712 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-20 08:18:21,712 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-20 08:18:21,712 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 08:18:21,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2020-10-20 08:18:21,713 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 08:18:21,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:21,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:21,714 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:18:21,714 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:18:21,715 INFO L794 eck$LassoCheckResult]: Stem: 718#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 710#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; 711#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 720#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; 712#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; 708#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 709#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; 713#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 724#L535-3 assume !(main_~i~1 < main_~array_size~0); 719#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; 702#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); 703#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 704#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); 699#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 700#L517-3 assume !(lis_~i~0 < lis_~N); 707#L517-4 lis_~i~0 := 1; 694#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 696#L520-3 [2020-10-20 08:18:21,715 INFO L796 eck$LassoCheckResult]: Loop: 696#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; 714#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; 715#L521-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 721#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 696#L520-3 [2020-10-20 08:18:21,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:21,715 INFO L82 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 2 times [2020-10-20 08:18:21,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:21,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066560474] [2020-10-20 08:18:21,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:21,740 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:21,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:21,760 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:21,767 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:21,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:21,767 INFO L82 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 2 times [2020-10-20 08:18:21,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:21,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945152795] [2020-10-20 08:18:21,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:21,775 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:21,780 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:21,782 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:21,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:21,783 INFO L82 PathProgramCache]: Analyzing trace with hash 2057178037, now seen corresponding path program 1 times [2020-10-20 08:18:21,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:21,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569426879] [2020-10-20 08:18:21,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:22,083 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 08:18:22,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569426879] [2020-10-20 08:18:22,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189743260] [2020-10-20 08:18:22,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:18:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:22,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 27 conjunts are in the unsatisfiable core [2020-10-20 08:18:22,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:22,178 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-10-20 08:18:22,185 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 08:18:22,191 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:18:22,192 INFO L545 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-10-20 08:18:22,192 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2020-10-20 08:18:22,237 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:18:22,238 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-10-20 08:18:22,239 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 08:18:22,244 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:18:22,246 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 08:18:22,247 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:8 [2020-10-20 08:18:22,268 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-10-20 08:18:22,269 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 08:18:22,277 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:18:22,278 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 08:18:22,278 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2020-10-20 08:18:22,364 INFO L350 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2020-10-20 08:18:22,365 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 50 treesize of output 41 [2020-10-20 08:18:22,366 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 08:18:22,376 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:18:22,380 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 08:18:22,380 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:37 [2020-10-20 08:18:22,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:18:22,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:18:22,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 08:18:22,612 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-20 08:18:22,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:18:22,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2020-10-20 08:18:22,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579764533] [2020-10-20 08:18:22,718 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-10-20 08:18:22,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:18:22,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-20 08:18:22,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-10-20 08:18:22,749 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. cyclomatic complexity: 16 Second operand 17 states. [2020-10-20 08:18:23,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:18:23,414 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2020-10-20 08:18:23,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 08:18:23,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 98 transitions. [2020-10-20 08:18:23,416 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 18 [2020-10-20 08:18:23,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 98 transitions. [2020-10-20 08:18:23,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-10-20 08:18:23,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-10-20 08:18:23,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 98 transitions. [2020-10-20 08:18:23,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:18:23,420 INFO L691 BuchiCegarLoop]: Abstraction has 68 states and 98 transitions. [2020-10-20 08:18:23,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 98 transitions. [2020-10-20 08:18:23,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 41. [2020-10-20 08:18:23,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-20 08:18:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2020-10-20 08:18:23,425 INFO L714 BuchiCegarLoop]: Abstraction has 41 states and 56 transitions. [2020-10-20 08:18:23,425 INFO L594 BuchiCegarLoop]: Abstraction has 41 states and 56 transitions. [2020-10-20 08:18:23,425 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 08:18:23,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 56 transitions. [2020-10-20 08:18:23,426 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 08:18:23,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:23,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:23,427 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:18:23,428 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:18:23,428 INFO L794 eck$LassoCheckResult]: Stem: 920#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 911#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; 912#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 922#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; 913#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; 909#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 910#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; 914#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 928#L535-3 assume !(main_~i~1 < main_~array_size~0); 921#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; 902#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); 903#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 904#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); 899#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 900#L517-3 assume !(lis_~i~0 < lis_~N); 907#L517-4 lis_~i~0 := 1; 908#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 933#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; 934#L521 assume !lis_#t~short11; 916#L521-2 [2020-10-20 08:18:23,428 INFO L796 eck$LassoCheckResult]: Loop: 916#L521-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 924#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 896#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; 915#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; 916#L521-2 [2020-10-20 08:18:23,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:23,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1570854005, now seen corresponding path program 1 times [2020-10-20 08:18:23,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:23,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069397644] [2020-10-20 08:18:23,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:23,480 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:23,524 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:23,534 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:23,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:23,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2895270, now seen corresponding path program 3 times [2020-10-20 08:18:23,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:23,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654059553] [2020-10-20 08:18:23,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:23,541 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:23,557 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:23,561 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:23,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:23,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1264986138, now seen corresponding path program 1 times [2020-10-20 08:18:23,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:23,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807221614] [2020-10-20 08:18:23,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:23,629 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-20 08:18:23,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807221614] [2020-10-20 08:18:23,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357891217] [2020-10-20 08:18:23,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:18:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:23,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:18:23,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:23,711 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-20 08:18:23,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-20 08:18:23,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2020-10-20 08:18:23,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965395094] [2020-10-20 08:18:23,823 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2020-10-20 08:18:23,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:18:23,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:18:23,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-20 08:18:23,884 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. cyclomatic complexity: 20 Second operand 5 states. [2020-10-20 08:18:23,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:18:23,945 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2020-10-20 08:18:23,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:18:23,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 76 transitions. [2020-10-20 08:18:23,947 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 08:18:23,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 48 states and 64 transitions. [2020-10-20 08:18:23,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-10-20 08:18:23,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-10-20 08:18:23,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2020-10-20 08:18:23,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:18:23,950 INFO L691 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2020-10-20 08:18:23,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2020-10-20 08:18:23,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2020-10-20 08:18:23,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-20 08:18:23,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2020-10-20 08:18:23,953 INFO L714 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2020-10-20 08:18:23,954 INFO L594 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2020-10-20 08:18:23,954 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 08:18:23,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 58 transitions. [2020-10-20 08:18:23,954 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 08:18:23,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:23,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:23,956 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:18:23,956 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:18:23,956 INFO L794 eck$LassoCheckResult]: Stem: 1096#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1087#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; 1088#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1098#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; 1089#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; 1085#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1086#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; 1090#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1104#L535-3 assume !(main_~i~1 < main_~array_size~0); 1097#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; 1079#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); 1076#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1077#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); 1080#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1105#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); 1106#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1110#L517-3 assume !(lis_~i~0 < lis_~N); 1109#L517-4 lis_~i~0 := 1; 1070#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1071#L520-3 assume !(lis_~j~0 < lis_~i~0); 1103#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1072#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1074#L520-3 [2020-10-20 08:18:23,956 INFO L796 eck$LassoCheckResult]: Loop: 1074#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; 1091#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; 1092#L521-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 1099#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1074#L520-3 [2020-10-20 08:18:23,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:23,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1189567124, now seen corresponding path program 1 times [2020-10-20 08:18:23,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:23,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706506760] [2020-10-20 08:18:23,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:23,987 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-10-20 08:18:23,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706506760] [2020-10-20 08:18:23,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:18:23,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:18:23,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444335939] [2020-10-20 08:18:23,989 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:18:23,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:23,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 4 times [2020-10-20 08:18:23,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:23,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371303384] [2020-10-20 08:18:23,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:23,995 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:23,999 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:24,001 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:24,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:18:24,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:18:24,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:18:24,125 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. cyclomatic complexity: 20 Second operand 4 states. [2020-10-20 08:18:24,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:18:24,175 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2020-10-20 08:18:24,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:18:24,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 58 transitions. [2020-10-20 08:18:24,176 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 08:18:24,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 58 transitions. [2020-10-20 08:18:24,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-10-20 08:18:24,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-20 08:18:24,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 58 transitions. [2020-10-20 08:18:24,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:18:24,178 INFO L691 BuchiCegarLoop]: Abstraction has 44 states and 58 transitions. [2020-10-20 08:18:24,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 58 transitions. [2020-10-20 08:18:24,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2020-10-20 08:18:24,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-20 08:18:24,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2020-10-20 08:18:24,184 INFO L714 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2020-10-20 08:18:24,184 INFO L594 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2020-10-20 08:18:24,184 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 08:18:24,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 57 transitions. [2020-10-20 08:18:24,187 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 08:18:24,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:24,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:24,188 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:18:24,188 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:18:24,189 INFO L794 eck$LassoCheckResult]: Stem: 1189#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1180#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; 1181#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1191#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; 1182#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; 1178#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1179#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; 1183#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1197#L535-3 assume !(main_~i~1 < main_~array_size~0); 1190#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; 1173#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); 1174#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1206#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); 1205#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1204#L517-3 assume !(lis_~i~0 < lis_~N); 1203#L517-4 lis_~i~0 := 1; 1200#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1195#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; 1186#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; 1187#L521-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1193#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1194#L520-3 assume !(lis_~j~0 < lis_~i~0); 1196#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1166#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1168#L520-3 [2020-10-20 08:18:24,189 INFO L796 eck$LassoCheckResult]: Loop: 1168#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; 1184#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; 1185#L521-2 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 1192#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1168#L520-3 [2020-10-20 08:18:24,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:24,189 INFO L82 PathProgramCache]: Analyzing trace with hash 500757827, now seen corresponding path program 1 times [2020-10-20 08:18:24,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:24,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914755389] [2020-10-20 08:18:24,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:24,290 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-20 08:18:24,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914755389] [2020-10-20 08:18:24,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6690448] [2020-10-20 08:18:24,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:18:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:24,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 08:18:24,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:24,431 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-20 08:18:24,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:18:24,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2020-10-20 08:18:24,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782804754] [2020-10-20 08:18:24,432 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:18:24,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:24,433 INFO L82 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 5 times [2020-10-20 08:18:24,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:24,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477293240] [2020-10-20 08:18:24,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:24,440 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:24,444 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:24,447 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:24,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:18:24,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 08:18:24,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-10-20 08:18:24,577 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. cyclomatic complexity: 19 Second operand 12 states. [2020-10-20 08:18:24,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:18:24,746 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2020-10-20 08:18:24,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 08:18:24,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 93 transitions. [2020-10-20 08:18:24,747 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:18:24,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 93 transitions. [2020-10-20 08:18:24,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-10-20 08:18:24,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2020-10-20 08:18:24,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 93 transitions. [2020-10-20 08:18:24,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:18:24,749 INFO L691 BuchiCegarLoop]: Abstraction has 72 states and 93 transitions. [2020-10-20 08:18:24,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 93 transitions. [2020-10-20 08:18:24,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2020-10-20 08:18:24,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-20 08:18:24,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2020-10-20 08:18:24,754 INFO L714 BuchiCegarLoop]: Abstraction has 67 states and 87 transitions. [2020-10-20 08:18:24,754 INFO L594 BuchiCegarLoop]: Abstraction has 67 states and 87 transitions. [2020-10-20 08:18:24,754 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 08:18:24,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 87 transitions. [2020-10-20 08:18:24,755 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 08:18:24,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:24,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:24,756 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:18:24,756 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:18:24,757 INFO L794 eck$LassoCheckResult]: Stem: 1400#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1390#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; 1391#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1401#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; 1392#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; 1393#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1430#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; 1429#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1428#L535-3 assume !(main_~i~1 < main_~array_size~0); 1427#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; 1426#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); 1425#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1424#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); 1423#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1422#L517-3 assume !(lis_~i~0 < lis_~N); 1419#L517-4 lis_~i~0 := 1; 1417#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1415#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; 1413#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; 1411#L521-2 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1409#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1408#L520-3 assume !(lis_~j~0 < lis_~i~0); 1405#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1406#L519-3 assume !(lis_~i~0 < lis_~N); 1376#L519-4 lis_~i~0 := 0; 1381#L523-3 [2020-10-20 08:18:24,757 INFO L796 eck$LassoCheckResult]: Loop: 1381#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); 1384#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; 1385#L523-2 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 1381#L523-3 [2020-10-20 08:18:24,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:24,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1656376535, now seen corresponding path program 1 times [2020-10-20 08:18:24,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:24,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372595483] [2020-10-20 08:18:24,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:24,789 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:24,812 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:24,830 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:24,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:24,832 INFO L82 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 1 times [2020-10-20 08:18:24,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:24,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219693572] [2020-10-20 08:18:24,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:24,838 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:24,841 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:24,845 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:24,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:24,846 INFO L82 PathProgramCache]: Analyzing trace with hash -234008915, now seen corresponding path program 1 times [2020-10-20 08:18:24,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:24,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905066432] [2020-10-20 08:18:24,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:24,900 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:24,930 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:24,949 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:30,568 WARN L193 SmtUtils]: Spent 5.57 s on a formula simplification. DAG size of input: 276 DAG size of output: 192 [2020-10-20 08:18:32,737 WARN L193 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 148 [2020-10-20 08:18:32,740 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:18:32,740 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:18:32,740 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:18:32,740 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:18:32,741 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:18:32,741 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:32,741 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:18:32,741 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:18:32,741 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration10_Lasso [2020-10-20 08:18:32,741 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:18:32,741 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:18:32,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:32,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-10-20 08:18:32,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-10-20 08:18:32,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:32,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:32,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-10-20 08:18:32,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:32,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:32,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-10-20 08:18:32,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:32,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:32,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:32,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:32,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:32,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:32,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:32,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:32,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:32,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:32,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:32,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:32,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:32,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:32,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:34,220 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:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:382) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-10-20 08:18:34,225 INFO L168 Benchmark]: Toolchain (without parser) took 19983.59 ms. Allocated memory was 41.4 MB in the beginning and 101.2 MB in the end (delta: 59.8 MB). Free memory was 18.5 MB in the beginning and 61.9 MB in the end (delta: -43.4 MB). Peak memory consumption was 75.1 MB. Max. memory is 14.3 GB. [2020-10-20 08:18:34,227 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 31.5 MB. Free memory was 7.3 MB in the beginning and 7.3 MB in the end (delta: 43.7 kB). Peak memory consumption was 43.7 kB. Max. memory is 14.3 GB. [2020-10-20 08:18:34,227 INFO L168 Benchmark]: CACSL2BoogieTranslator took 614.02 ms. Allocated memory was 41.4 MB in the beginning and 45.1 MB in the end (delta: 3.7 MB). Free memory was 17.6 MB in the beginning and 23.3 MB in the end (delta: -5.7 MB). Peak memory consumption was 8.8 MB. Max. memory is 14.3 GB. [2020-10-20 08:18:34,231 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.54 ms. Allocated memory is still 45.1 MB. Free memory was 23.3 MB in the beginning and 21.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 14.3 GB. [2020-10-20 08:18:34,231 INFO L168 Benchmark]: Boogie Preprocessor took 39.61 ms. Allocated memory is still 45.1 MB. Free memory was 21.1 MB in the beginning and 19.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. [2020-10-20 08:18:34,233 INFO L168 Benchmark]: RCFGBuilder took 457.32 ms. Allocated memory is still 45.1 MB. Free memory was 19.4 MB in the beginning and 15.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 14.3 GB. [2020-10-20 08:18:34,236 INFO L168 Benchmark]: BuchiAutomizer took 18809.91 ms. Allocated memory was 45.1 MB in the beginning and 101.2 MB in the end (delta: 56.1 MB). Free memory was 15.2 MB in the beginning and 61.9 MB in the end (delta: -46.7 MB). Peak memory consumption was 68.1 MB. Max. memory is 14.3 GB. [2020-10-20 08:18:34,244 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 31.5 MB. Free memory was 7.3 MB in the beginning and 7.3 MB in the end (delta: 43.7 kB). Peak memory consumption was 43.7 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 614.02 ms. Allocated memory was 41.4 MB in the beginning and 45.1 MB in the end (delta: 3.7 MB). Free memory was 17.6 MB in the beginning and 23.3 MB in the end (delta: -5.7 MB). Peak memory consumption was 8.8 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 49.54 ms. Allocated memory is still 45.1 MB. Free memory was 23.3 MB in the beginning and 21.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 39.61 ms. Allocated memory is still 45.1 MB. Free memory was 21.1 MB in the beginning and 19.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. * RCFGBuilder took 457.32 ms. Allocated memory is still 45.1 MB. Free memory was 19.4 MB in the beginning and 15.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 18809.91 ms. Allocated memory was 45.1 MB in the beginning and 101.2 MB in the end (delta: 56.1 MB). Free memory was 15.2 MB in the beginning and 61.9 MB in the end (delta: -46.7 MB). Peak memory consumption was 68.1 MB. Max. memory is 14.3 GB. * 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...