./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 5fbdf5bf 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.5.800.v20200727-1323.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.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-31 05:20:17,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 05:20:17,357 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 05:20:17,393 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 05:20:17,393 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 05:20:17,396 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 05:20:17,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 05:20:17,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 05:20:17,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 05:20:17,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 05:20:17,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 05:20:17,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 05:20:17,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 05:20:17,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 05:20:17,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 05:20:17,417 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 05:20:17,418 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 05:20:17,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 05:20:17,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 05:20:17,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 05:20:17,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 05:20:17,426 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 05:20:17,427 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 05:20:17,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 05:20:17,431 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 05:20:17,431 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 05:20:17,431 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 05:20:17,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 05:20:17,433 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 05:20:17,433 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 05:20:17,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 05:20:17,434 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 05:20:17,435 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 05:20:17,436 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 05:20:17,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 05:20:17,437 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 05:20:17,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 05:20:17,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 05:20:17,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 05:20:17,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 05:20:17,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 05:20:17,440 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-31 05:20:17,467 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 05:20:17,468 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 05:20:17,468 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 05:20:17,468 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 05:20:17,470 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 05:20:17,470 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 05:20:17,470 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 05:20:17,470 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 05:20:17,470 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 05:20:17,471 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 05:20:17,471 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 05:20:17,471 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 05:20:17,472 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 05:20:17,472 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 05:20:17,472 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-31 05:20:17,472 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 05:20:17,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 05:20:17,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-31 05:20:17,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 05:20:17,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 05:20:17,473 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 05:20:17,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 05:20:17,473 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-31 05:20:17,473 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 05:20:17,473 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 05:20:17,474 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 05:20:17,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 05:20:17,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 05:20:17,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 05:20:17,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 05:20:17,474 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 05:20:17,475 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 05:20:17,475 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 05:20:17,476 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 [2021-08-31 05:20:17,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 05:20:17,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 05:20:17,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 05:20:17,740 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 05:20:17,740 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 05:20:17,741 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 [2021-08-31 05:20:17,784 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6587825e9/aef17d828e5748fabfe3ec0b251c0564/FLAGc2ee3c955 [2021-08-31 05:20:18,204 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 05:20:18,211 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2021-08-31 05:20:18,219 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6587825e9/aef17d828e5748fabfe3ec0b251c0564/FLAGc2ee3c955 [2021-08-31 05:20:18,227 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6587825e9/aef17d828e5748fabfe3ec0b251c0564 [2021-08-31 05:20:18,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 05:20:18,230 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 05:20:18,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 05:20:18,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 05:20:18,233 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 05:20:18,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 05:20:18" (1/1) ... [2021-08-31 05:20:18,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@453278bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:20:18, skipping insertion in model container [2021-08-31 05:20:18,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 05:20:18" (1/1) ... [2021-08-31 05:20:18,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 05:20:18,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 05:20:18,509 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 05:20:18,519 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 05:20:18,548 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 05:20:18,564 INFO L208 MainTranslator]: Completed translation [2021-08-31 05:20:18,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:20:18 WrapperNode [2021-08-31 05:20:18,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 05:20:18,566 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 05:20:18,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 05:20:18,566 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 05:20:18,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:20:18" (1/1) ... [2021-08-31 05:20:18,592 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:20:18" (1/1) ... [2021-08-31 05:20:18,613 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 05:20:18,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 05:20:18,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 05:20:18,614 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 05:20:18,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:20:18" (1/1) ... [2021-08-31 05:20:18,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:20:18" (1/1) ... [2021-08-31 05:20:18,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:20:18" (1/1) ... [2021-08-31 05:20:18,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:20:18" (1/1) ... [2021-08-31 05:20:18,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:20:18" (1/1) ... [2021-08-31 05:20:18,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:20:18" (1/1) ... [2021-08-31 05:20:18,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:20:18" (1/1) ... [2021-08-31 05:20:18,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 05:20:18,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 05:20:18,656 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 05:20:18,657 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 05:20:18,657 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:20:18" (1/1) ... [2021-08-31 05:20:18,662 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:18,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:18,686 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:20:18,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-31 05:20:18,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-31 05:20:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-31 05:20:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-31 05:20:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-31 05:20:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 05:20:18,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 05:20:18,929 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 05:20:18,929 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-08-31 05:20:18,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 05:20:18 BoogieIcfgContainer [2021-08-31 05:20:18,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 05:20:18,931 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 05:20:18,931 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 05:20:18,933 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 05:20:18,937 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 05:20:18,937 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 05:20:18" (1/3) ... [2021-08-31 05:20:18,938 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32305811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 05:20:18, skipping insertion in model container [2021-08-31 05:20:18,938 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 05:20:18,938 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:20:18" (2/3) ... [2021-08-31 05:20:18,939 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32305811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 05:20:18, skipping insertion in model container [2021-08-31 05:20:18,939 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 05:20:18,939 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 05:20:18" (3/3) ... [2021-08-31 05:20:18,940 INFO L389 chiAutomizerObserver]: Analyzing ICFG lis-alloca-1.i [2021-08-31 05:20:18,975 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 05:20:18,975 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 05:20:18,975 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 05:20:18,975 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 05:20:18,975 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 05:20:18,976 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 05:20:18,976 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 05:20:18,976 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 05:20:18,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:20:19,001 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2021-08-31 05:20:19,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:20:19,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:20:19,004 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-08-31 05:20:19,005 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 05:20:19,005 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 05:20:19,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:20:19,009 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2021-08-31 05:20:19,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:20:19,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:20:19,010 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-08-31 05:20:19,010 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 05:20:19,015 INFO L791 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#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; 11#L530true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 7#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; 4#L535-3true [2021-08-31 05:20:19,015 INFO L793 eck$LassoCheckResult]: Loop: 4#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; 17#L535-2true main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 4#L535-3true [2021-08-31 05:20:19,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:19,020 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-08-31 05:20:19,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:20:19,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256587479] [2021-08-31 05:20:19,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:19,027 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:20:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:19,111 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:20:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:19,145 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:20:19,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:19,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2021-08-31 05:20:19,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:20:19,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740274094] [2021-08-31 05:20:19,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:19,152 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:20:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:19,167 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:20:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:19,181 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:20:19,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:19,182 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2021-08-31 05:20:19,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:20:19,183 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745005288] [2021-08-31 05:20:19,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:19,183 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:20:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:19,203 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:20:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:19,229 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:20:19,497 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 05:20:19,497 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 05:20:19,497 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 05:20:19,497 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 05:20:19,498 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 05:20:19,498 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:19,498 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 05:20:19,498 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 05:20:19,498 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration1_Lasso [2021-08-31 05:20:19,498 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 05:20:19,498 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 05:20:19,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:19,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:19,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:19,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:19,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:19,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:19,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:19,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:19,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:19,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:19,802 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 05:20:19,804 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 05:20:19,805 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:19,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:19,818 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:20:19,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 05:20:19,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:20:19,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:20:19,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:20:19,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:20:19,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:20:19,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-08-31 05:20:19,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:20:19,844 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:20:19,853 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:20:19,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-08-31 05:20:19,874 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:19,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:19,875 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:20:19,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-08-31 05:20:19,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 05:20:19,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:20:19,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:20:19,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:20:19,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:20:19,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:20:19,885 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:20:19,885 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:20:19,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:20:19,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-08-31 05:20:19,904 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:19,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:19,905 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:20:19,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-08-31 05:20:19,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 05:20:19,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:20:19,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:20:19,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:20:19,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:20:19,916 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:20:19,916 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:20:19,920 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:20:19,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-08-31 05:20:19,938 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:19,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:19,939 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:20:19,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-08-31 05:20:19,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 05:20:19,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:20:19,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:20:19,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:20:19,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:20:19,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:20:19,949 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:20:19,949 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:20:19,960 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:20:19,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-08-31 05:20:19,976 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:19,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:19,977 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:20:19,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-08-31 05:20:19,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 05:20:19,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:20:19,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:20:19,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:20:19,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:20:20,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:20:20,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:20:20,021 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 05:20:20,078 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2021-08-31 05:20:20,078 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2021-08-31 05:20:20,080 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:20,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:20,089 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:20:20,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-08-31 05:20:20,095 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 05:20:20,110 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-31 05:20:20,110 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 05:20:20,110 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~array_size~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~array_size~0 Supporting invariants [] [2021-08-31 05:20:20,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2021-08-31 05:20:20,134 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2021-08-31 05:20:20,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:20:20,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 05:20:20,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:20:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:20:20,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 05:20:20,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:20:20,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:20:20,224 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 [2021-08-31 05:20:20,225 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:20:20,334 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 65 states and 99 transitions. Complement of second has 7 states. [2021-08-31 05:20:20,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-31 05:20:20,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:20:20,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2021-08-31 05:20:20,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 4 letters. Loop has 2 letters. [2021-08-31 05:20:20,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:20:20,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 6 letters. Loop has 2 letters. [2021-08-31 05:20:20,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:20:20,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 4 letters. Loop has 4 letters. [2021-08-31 05:20:20,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:20:20,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 99 transitions. [2021-08-31 05:20:20,344 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-08-31 05:20:20,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 21 states and 30 transitions. [2021-08-31 05:20:20,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-08-31 05:20:20,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-08-31 05:20:20,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2021-08-31 05:20:20,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:20:20,347 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2021-08-31 05:20:20,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2021-08-31 05:20:20,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-08-31 05:20:20,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:20:20,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2021-08-31 05:20:20,367 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2021-08-31 05:20:20,367 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2021-08-31 05:20:20,368 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 05:20:20,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2021-08-31 05:20:20,368 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-08-31 05:20:20,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:20:20,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:20:20,369 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-31 05:20:20,369 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 05:20:20,369 INFO L791 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 152#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 160#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 156#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; 147#L535-3 assume !(main_~i~1 < main_~array_size~0); 149#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; 162#L517-3 [2021-08-31 05:20:20,370 INFO L793 eck$LassoCheckResult]: Loop: 162#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); 161#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 162#L517-3 [2021-08-31 05:20:20,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:20,370 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2021-08-31 05:20:20,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:20:20,371 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635130264] [2021-08-31 05:20:20,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:20,371 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:20:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:20:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:20:20,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:20:20,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635130264] [2021-08-31 05:20:20,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635130264] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 05:20:20,434 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 05:20:20,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-31 05:20:20,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343100893] [2021-08-31 05:20:20,441 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:20:20,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:20,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2021-08-31 05:20:20,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:20:20,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300169367] [2021-08-31 05:20:20,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:20,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:20:20,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-08-31 05:20:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:20,450 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:20:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:20,454 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:20:20,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:20:20,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-31 05:20:20,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-31 05:20:20,518 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:20:20,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:20:20,566 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2021-08-31 05:20:20,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-31 05:20:20,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2021-08-31 05:20:20,567 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-08-31 05:20:20,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2021-08-31 05:20:20,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-08-31 05:20:20,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-08-31 05:20:20,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2021-08-31 05:20:20,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:20:20,568 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-08-31 05:20:20,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2021-08-31 05:20:20,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2021-08-31 05:20:20,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:20:20,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2021-08-31 05:20:20,570 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2021-08-31 05:20:20,570 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2021-08-31 05:20:20,570 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 05:20:20,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2021-08-31 05:20:20,571 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-08-31 05:20:20,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:20:20,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:20:20,571 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:20:20,572 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 05:20:20,572 INFO L791 eck$LassoCheckResult]: Stem: 201#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 202#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; 210#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 206#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; 197#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 198#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 199#L535-3 assume !(main_~i~1 < main_~array_size~0); 200#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; 212#L517-3 [2021-08-31 05:20:20,572 INFO L793 eck$LassoCheckResult]: Loop: 212#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); 211#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 212#L517-3 [2021-08-31 05:20:20,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:20,572 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2021-08-31 05:20:20,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:20:20,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925983958] [2021-08-31 05:20:20,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:20,573 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:20:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:20,583 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:20:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:20,593 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:20:20,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:20,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2021-08-31 05:20:20,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:20:20,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764893020] [2021-08-31 05:20:20,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:20,595 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:20:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:20,598 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:20:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:20,602 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:20:20,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:20,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1899811567, now seen corresponding path program 1 times [2021-08-31 05:20:20,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:20:20,603 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173275177] [2021-08-31 05:20:20,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:20,604 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:20:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:20,618 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:20:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:20,638 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:20:21,189 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 05:20:21,190 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 05:20:21,190 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 05:20:21,190 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 05:20:21,190 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 05:20:21,190 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:21,190 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 05:20:21,190 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 05:20:21,190 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration3_Lasso [2021-08-31 05:20:21,190 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 05:20:21,190 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 05:20:21,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:21,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:21,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:21,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:21,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:21,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:21,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:21,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:21,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:21,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:21,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:21,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:21,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:21,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:21,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:21,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:21,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:21,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:21,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:21,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:21,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:21,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:21,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:21,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:21,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:21,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:22,003 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 05:20:22,003 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 05:20:22,003 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:22,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:22,009 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:20:22,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 05:20:22,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:20:22,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:20:22,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:20:22,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:20:22,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:20:22,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:20:22,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:20:22,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-08-31 05:20:22,038 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:20:22,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-08-31 05:20:22,061 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:22,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:22,063 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:20:22,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 05:20:22,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-08-31 05:20:22,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:20:22,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:20:22,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:20:22,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:20:22,075 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:20:22,076 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:20:22,085 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:20:22,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-08-31 05:20:22,106 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:22,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:22,107 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:20:22,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-08-31 05:20:22,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 05:20:22,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:20:22,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:20:22,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:20:22,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:20:22,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:20:22,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:20:22,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:20:22,125 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:20:22,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-08-31 05:20:22,142 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:22,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:22,142 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:20:22,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-08-31 05:20:22,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 05:20:22,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:20:22,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:20:22,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:20:22,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:20:22,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:20:22,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:20:22,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:20:22,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:20:22,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-08-31 05:20:22,167 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:22,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:22,167 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:20:22,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-08-31 05:20:22,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 05:20:22,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:20:22,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:20:22,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:20:22,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:20:22,178 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:20:22,178 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:20:22,187 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:20:22,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-08-31 05:20:22,203 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:22,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:22,205 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:20:22,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-08-31 05:20:22,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 05:20:22,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:20:22,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:20:22,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:20:22,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:20:22,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:20:22,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:20:22,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:20:22,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:20:22,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-08-31 05:20:22,240 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:22,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:22,240 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:20:22,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-08-31 05:20:22,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 05:20:22,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:20:22,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:20:22,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:20:22,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:20:22,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:20:22,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:20:22,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:20:22,254 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:20:22,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-08-31 05:20:22,270 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:22,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:22,271 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:20:22,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-08-31 05:20:22,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 05:20:22,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:20:22,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:20:22,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:20:22,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:20:22,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:20:22,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:20:22,304 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:20:22,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-31 05:20:22,321 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:22,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:22,322 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:20:22,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-08-31 05:20:22,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 05:20:22,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:20:22,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:20:22,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:20:22,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:20:22,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:20:22,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:20:22,357 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 05:20:22,382 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-08-31 05:20:22,382 INFO L444 ModelExtractionUtils]: 28 out of 61 variables were initially zero. Simplification set additionally 30 variables to zero. [2021-08-31 05:20:22,382 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:22,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:22,383 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:20:22,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-08-31 05:20:22,385 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 05:20:22,393 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-31 05:20:22,393 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 05:20:22,393 INFO L515 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 [] [2021-08-31 05:20:22,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-08-31 05:20:22,459 INFO L297 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2021-08-31 05:20:22,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:20:22,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 05:20:22,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:20:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:20:22,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 05:20:22,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:20:22,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:20:22,521 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 [2021-08-31 05:20:22,521 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:20:22,547 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 35 transitions. Complement of second has 7 states. [2021-08-31 05:20:22,548 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 [2021-08-31 05:20:22,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:20:22,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2021-08-31 05:20:22,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 2 letters. [2021-08-31 05:20:22,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:20:22,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2021-08-31 05:20:22,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:20:22,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2021-08-31 05:20:22,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:20:22,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2021-08-31 05:20:22,551 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-08-31 05:20:22,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 31 transitions. [2021-08-31 05:20:22,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-31 05:20:22,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-08-31 05:20:22,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2021-08-31 05:20:22,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:20:22,551 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-08-31 05:20:22,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2021-08-31 05:20:22,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-08-31 05:20:22,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:20:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2021-08-31 05:20:22,553 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-08-31 05:20:22,553 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-08-31 05:20:22,553 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-31 05:20:22,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2021-08-31 05:20:22,553 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-08-31 05:20:22,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:20:22,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:20:22,553 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:20:22,553 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:20:22,553 INFO L791 eck$LassoCheckResult]: Stem: 384#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 385#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; 393#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 389#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; 380#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; 381#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 382#L535-3 assume !(main_~i~1 < main_~array_size~0); 383#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; 400#L517-3 assume !(lis_~i~0 < lis_~N); 401#L517-4 lis_~i~0 := 1; 392#L519-3 [2021-08-31 05:20:22,554 INFO L793 eck$LassoCheckResult]: Loop: 392#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 386#L520-3 assume !(lis_~j~0 < lis_~i~0); 387#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 392#L519-3 [2021-08-31 05:20:22,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:22,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1899811625, now seen corresponding path program 1 times [2021-08-31 05:20:22,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:20:22,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995341047] [2021-08-31 05:20:22,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:22,554 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:20:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:20:22,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-31 05:20:22,590 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:20:22,590 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995341047] [2021-08-31 05:20:22,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995341047] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 05:20:22,590 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 05:20:22,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-31 05:20:22,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334734181] [2021-08-31 05:20:22,591 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:20:22,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:22,591 INFO L82 PathProgramCache]: Analyzing trace with hash 74687, now seen corresponding path program 1 times [2021-08-31 05:20:22,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:20:22,592 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859906316] [2021-08-31 05:20:22,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:22,592 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:20:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:22,595 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:20:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:22,598 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:20:22,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-08-31 05:20:22,634 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 05:20:22,634 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 05:20:22,634 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 05:20:22,635 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 05:20:22,635 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-31 05:20:22,635 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:22,635 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 05:20:22,635 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 05:20:22,635 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2021-08-31 05:20:22,635 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 05:20:22,635 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 05:20:22,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:22,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:22,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:22,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:22,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:22,681 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 05:20:22,681 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-31 05:20:22,682 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:22,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:22,685 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:20:22,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-08-31 05:20:22,690 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 05:20:22,690 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 05:20:22,702 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 05:20:22,702 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: [] [2021-08-31 05:20:22,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2021-08-31 05:20:22,719 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:22,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:22,719 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:20:22,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-08-31 05:20:22,721 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 05:20:22,721 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 05:20:22,753 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 05:20:22,753 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: [] [2021-08-31 05:20:22,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-08-31 05:20:22,785 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:22,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:22,789 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:20:22,795 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 05:20:22,795 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 05:20:22,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-08-31 05:20:22,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-08-31 05:20:22,835 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:22,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:22,836 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:20:22,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-08-31 05:20:22,838 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-31 05:20:22,838 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 05:20:22,938 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-31 05:20:22,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-08-31 05:20:22,941 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 05:20:22,942 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 05:20:22,942 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 05:20:22,942 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 05:20:22,942 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 05:20:22,942 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:22,942 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 05:20:22,942 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 05:20:22,942 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2021-08-31 05:20:22,942 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 05:20:22,942 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 05:20:22,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:22,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:22,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:22,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:22,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:23,003 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 05:20:23,003 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 05:20:23,004 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:23,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:23,005 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:20:23,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 05:20:23,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:20:23,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:20:23,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:20:23,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:20:23,021 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:20:23,021 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:20:23,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-08-31 05:20:23,028 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:20:23,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-08-31 05:20:23,046 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:23,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:23,046 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:20:23,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-08-31 05:20:23,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 05:20:23,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:20:23,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:20:23,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:20:23,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:20:23,056 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:20:23,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:20:23,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:20:23,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-08-31 05:20:23,084 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:23,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:23,088 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:20:23,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-08-31 05:20:23,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 05:20:23,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:20:23,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:20:23,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:20:23,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:20:23,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:20:23,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:20:23,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:20:23,116 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 05:20:23,119 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-31 05:20:23,119 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-31 05:20:23,119 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:23,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:23,121 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:20:23,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-08-31 05:20:23,122 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 05:20:23,122 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-31 05:20:23,123 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 05:20:23,123 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0) = -2*ULTIMATE.start_lis_~i~0 + 1 Supporting invariants [] [2021-08-31 05:20:23,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-08-31 05:20:23,138 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-31 05:20:23,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:20:23,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 05:20:23,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:20:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:20:23,185 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-31 05:20:23,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:20:23,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:20:23,213 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-08-31 05:20:23,213 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:20:23,266 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 67 transitions. Complement of second has 9 states. [2021-08-31 05:20:23,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-08-31 05:20:23,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:20:23,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2021-08-31 05:20:23,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 3 letters. [2021-08-31 05:20:23,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:20:23,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 13 letters. Loop has 3 letters. [2021-08-31 05:20:23,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:20:23,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 6 letters. [2021-08-31 05:20:23,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:20:23,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 67 transitions. [2021-08-31 05:20:23,269 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2021-08-31 05:20:23,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 62 transitions. [2021-08-31 05:20:23,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-08-31 05:20:23,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-08-31 05:20:23,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 62 transitions. [2021-08-31 05:20:23,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:20:23,270 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 62 transitions. [2021-08-31 05:20:23,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 62 transitions. [2021-08-31 05:20:23,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2021-08-31 05:20:23,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:20:23,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2021-08-31 05:20:23,273 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 50 transitions. [2021-08-31 05:20:23,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:20:23,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-31 05:20:23,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-31 05:20:23,274 INFO L87 Difference]: Start difference. First operand 33 states and 50 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:20:23,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:20:23,321 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2021-08-31 05:20:23,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-31 05:20:23,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2021-08-31 05:20:23,322 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-08-31 05:20:23,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 50 transitions. [2021-08-31 05:20:23,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-31 05:20:23,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-31 05:20:23,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2021-08-31 05:20:23,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:20:23,323 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 50 transitions. [2021-08-31 05:20:23,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2021-08-31 05:20:23,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2021-08-31 05:20:23,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 32 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:20:23,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2021-08-31 05:20:23,325 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2021-08-31 05:20:23,325 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2021-08-31 05:20:23,325 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-31 05:20:23,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 49 transitions. [2021-08-31 05:20:23,326 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-08-31 05:20:23,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:20:23,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:20:23,326 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:20:23,327 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:20:23,327 INFO L791 eck$LassoCheckResult]: Stem: 586#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 587#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; 601#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 593#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; 582#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; 583#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 584#L535-3 assume !(main_~i~1 < main_~array_size~0); 585#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 610#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); 602#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 603#L517-3 assume !(lis_~i~0 < lis_~N); 611#L517-4 lis_~i~0 := 1; 612#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 588#L520-3 [2021-08-31 05:20:23,327 INFO L793 eck$LassoCheckResult]: Loop: 588#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; 589#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; 594#L521-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 595#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 606#L520-3 assume !(lis_~j~0 < lis_~i~0); 598#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 599#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 588#L520-3 [2021-08-31 05:20:23,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:23,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1792663252, now seen corresponding path program 1 times [2021-08-31 05:20:23,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:20:23,328 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443713468] [2021-08-31 05:20:23,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:23,328 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:20:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:20:23,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-31 05:20:23,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:20:23,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443713468] [2021-08-31 05:20:23,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443713468] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:20:23,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943299480] [2021-08-31 05:20:23,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:23,359 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:20:23,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:23,366 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:20:23,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-08-31 05:20:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:20:23,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-31 05:20:23,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:20:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-31 05:20:23,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:20:23,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-31 05:20:23,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943299480] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:20:23,567 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:20:23,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2021-08-31 05:20:23,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732907550] [2021-08-31 05:20:23,567 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:20:23,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:23,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 1 times [2021-08-31 05:20:23,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:20:23,568 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703851899] [2021-08-31 05:20:23,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:23,568 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:20:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:23,581 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:20:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:23,597 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:20:23,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-08-31 05:20:23,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:20:23,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-31 05:20:23,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-08-31 05:20:23,753 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. cyclomatic complexity: 21 Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:20:23,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:20:23,944 INFO L93 Difference]: Finished difference Result 81 states and 109 transitions. [2021-08-31 05:20:23,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-31 05:20:23,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 109 transitions. [2021-08-31 05:20:23,946 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-08-31 05:20:23,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 58 states and 81 transitions. [2021-08-31 05:20:23,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2021-08-31 05:20:23,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2021-08-31 05:20:23,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 81 transitions. [2021-08-31 05:20:23,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:20:23,947 INFO L681 BuchiCegarLoop]: Abstraction has 58 states and 81 transitions. [2021-08-31 05:20:23,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 81 transitions. [2021-08-31 05:20:23,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 37. [2021-08-31 05:20:23,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:20:23,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2021-08-31 05:20:23,948 INFO L704 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2021-08-31 05:20:23,949 INFO L587 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2021-08-31 05:20:23,949 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-31 05:20:23,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2021-08-31 05:20:23,949 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-08-31 05:20:23,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:20:23,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:20:23,949 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:20:23,949 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:20:23,950 INFO L791 eck$LassoCheckResult]: Stem: 798#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 799#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; 813#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 805#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; 794#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; 795#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 796#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; 797#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 827#L535-3 assume !(main_~i~1 < main_~array_size~0); 822#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; 823#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); 814#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 815#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); 826#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 828#L517-3 assume !(lis_~i~0 < lis_~N); 824#L517-4 lis_~i~0 := 1; 816#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 800#L520-3 [2021-08-31 05:20:23,950 INFO L793 eck$LassoCheckResult]: Loop: 800#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; 801#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; 806#L521-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 807#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 818#L520-3 assume !(lis_~j~0 < lis_~i~0); 810#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 811#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 800#L520-3 [2021-08-31 05:20:23,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:23,950 INFO L82 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 2 times [2021-08-31 05:20:23,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:20:23,950 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922609637] [2021-08-31 05:20:23,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:23,950 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:20:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:23,973 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:20:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:23,998 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:20:24,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:24,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 2 times [2021-08-31 05:20:24,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:20:24,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338298271] [2021-08-31 05:20:24,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:24,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:20:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:24,005 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:20:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:24,009 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:20:24,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:24,009 INFO L82 PathProgramCache]: Analyzing trace with hash 502604869, now seen corresponding path program 1 times [2021-08-31 05:20:24,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:20:24,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9122926] [2021-08-31 05:20:24,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:24,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:20:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:20:24,059 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-31 05:20:24,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:20:24,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9122926] [2021-08-31 05:20:24,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9122926] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:20:24,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099341965] [2021-08-31 05:20:24,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:24,060 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:20:24,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:24,065 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:20:24,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-08-31 05:20:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:20:24,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-31 05:20:24,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:20:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-31 05:20:24,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:20:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-31 05:20:24,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099341965] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:20:24,329 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:20:24,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2021-08-31 05:20:24,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879471966] [2021-08-31 05:20:24,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:20:24,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-31 05:20:24,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-08-31 05:20:24,445 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. cyclomatic complexity: 19 Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:20:24,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:20:24,587 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2021-08-31 05:20:24,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-31 05:20:24,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 92 transitions. [2021-08-31 05:20:24,589 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2021-08-31 05:20:24,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 62 states and 83 transitions. [2021-08-31 05:20:24,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2021-08-31 05:20:24,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2021-08-31 05:20:24,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 83 transitions. [2021-08-31 05:20:24,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:20:24,590 INFO L681 BuchiCegarLoop]: Abstraction has 62 states and 83 transitions. [2021-08-31 05:20:24,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 83 transitions. [2021-08-31 05:20:24,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2021-08-31 05:20:24,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 54 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:20:24,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2021-08-31 05:20:24,593 INFO L704 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2021-08-31 05:20:24,594 INFO L587 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2021-08-31 05:20:24,594 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-31 05:20:24,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 75 transitions. [2021-08-31 05:20:24,594 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-08-31 05:20:24,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:20:24,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:20:24,595 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:20:24,595 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-31 05:20:24,595 INFO L791 eck$LassoCheckResult]: Stem: 1069#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1070#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; 1084#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1076#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; 1065#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; 1066#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1067#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; 1068#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1113#L535-3 assume !(main_~i~1 < main_~array_size~0); 1095#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; 1096#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); 1085#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1086#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); 1099#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1103#L517-3 assume !(lis_~i~0 < lis_~N); 1097#L517-4 lis_~i~0 := 1; 1098#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1107#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 [2021-08-31 05:20:24,595 INFO L793 eck$LassoCheckResult]: Loop: 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; 1077#L521-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 1078#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1090#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 [2021-08-31 05:20:24,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:24,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1159051365, now seen corresponding path program 1 times [2021-08-31 05:20:24,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:20:24,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44045292] [2021-08-31 05:20:24,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:24,596 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:20:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:24,613 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:20:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:24,642 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:20:24,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:24,642 INFO L82 PathProgramCache]: Analyzing trace with hash 2655420, now seen corresponding path program 1 times [2021-08-31 05:20:24,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:20:24,643 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807111120] [2021-08-31 05:20:24,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:24,643 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:20:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:24,651 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:20:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:24,656 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:20:24,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:24,656 INFO L82 PathProgramCache]: Analyzing trace with hash -651990240, now seen corresponding path program 1 times [2021-08-31 05:20:24,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:20:24,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898204489] [2021-08-31 05:20:24,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:24,657 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:20:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:20:24,704 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-31 05:20:24,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:20:24,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898204489] [2021-08-31 05:20:24,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898204489] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:20:24,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299175270] [2021-08-31 05:20:24,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:24,705 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:20:24,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:24,717 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:20:24,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-08-31 05:20:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:20:24,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 05:20:24,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:20:24,826 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-31 05:20:24,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-31 05:20:24,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299175270] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 05:20:24,827 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-31 05:20:24,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2021-08-31 05:20:24,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755419846] [2021-08-31 05:20:24,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:20:24,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 05:20:24,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-08-31 05:20:24,982 INFO L87 Difference]: Start difference. First operand 55 states and 75 transitions. cyclomatic complexity: 27 Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:20:25,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:20:25,037 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2021-08-31 05:20:25,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-31 05:20:25,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 97 transitions. [2021-08-31 05:20:25,039 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-08-31 05:20:25,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 97 transitions. [2021-08-31 05:20:25,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2021-08-31 05:20:25,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2021-08-31 05:20:25,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 97 transitions. [2021-08-31 05:20:25,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:20:25,040 INFO L681 BuchiCegarLoop]: Abstraction has 72 states and 97 transitions. [2021-08-31 05:20:25,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 97 transitions. [2021-08-31 05:20:25,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2021-08-31 05:20:25,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.375) internal successors, (88), 63 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:20:25,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2021-08-31 05:20:25,045 INFO L704 BuchiCegarLoop]: Abstraction has 64 states and 88 transitions. [2021-08-31 05:20:25,045 INFO L587 BuchiCegarLoop]: Abstraction has 64 states and 88 transitions. [2021-08-31 05:20:25,045 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-31 05:20:25,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 88 transitions. [2021-08-31 05:20:25,046 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-08-31 05:20:25,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:20:25,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:20:25,046 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:20:25,046 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:20:25,047 INFO L791 eck$LassoCheckResult]: Stem: 1272#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1273#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; 1287#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1279#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; 1268#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; 1269#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1270#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; 1271#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1317#L535-3 assume !(main_~i~1 < main_~array_size~0); 1304#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; 1305#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); 1308#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1309#L517-3 assume !!(lis_~i~0 < lis_~N);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); 1288#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1289#L517-3 assume !(lis_~i~0 < lis_~N); 1306#L517-4 lis_~i~0 := 1; 1290#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1292#L520-3 assume !(lis_~j~0 < lis_~i~0); 1330#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1312#L519-3 assume !(lis_~i~0 < lis_~N); 1307#L519-4 lis_~i~0 := 0; 1301#L523-3 [2021-08-31 05:20:25,047 INFO L793 eck$LassoCheckResult]: Loop: 1301#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); 1302#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; 1303#L523-2 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 1301#L523-3 [2021-08-31 05:20:25,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:25,047 INFO L82 PathProgramCache]: Analyzing trace with hash 2057131266, now seen corresponding path program 1 times [2021-08-31 05:20:25,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:20:25,047 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808706741] [2021-08-31 05:20:25,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:25,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:20:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:20:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-31 05:20:25,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:20:25,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808706741] [2021-08-31 05:20:25,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808706741] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 05:20:25,068 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 05:20:25,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-31 05:20:25,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817371304] [2021-08-31 05:20:25,068 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:20:25,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:25,069 INFO L82 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 1 times [2021-08-31 05:20:25,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:20:25,069 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027177207] [2021-08-31 05:20:25,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:25,069 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:20:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:25,072 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:20:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:25,074 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:20:25,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:20:25,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-31 05:20:25,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-31 05:20:25,104 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. cyclomatic complexity: 30 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:20:25,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:20:25,149 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2021-08-31 05:20:25,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-31 05:20:25,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 89 transitions. [2021-08-31 05:20:25,150 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-08-31 05:20:25,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 66 states and 88 transitions. [2021-08-31 05:20:25,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2021-08-31 05:20:25,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2021-08-31 05:20:25,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 88 transitions. [2021-08-31 05:20:25,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:20:25,151 INFO L681 BuchiCegarLoop]: Abstraction has 66 states and 88 transitions. [2021-08-31 05:20:25,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 88 transitions. [2021-08-31 05:20:25,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2021-08-31 05:20:25,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.34375) internal successors, (86), 63 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:20:25,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2021-08-31 05:20:25,153 INFO L704 BuchiCegarLoop]: Abstraction has 64 states and 86 transitions. [2021-08-31 05:20:25,153 INFO L587 BuchiCegarLoop]: Abstraction has 64 states and 86 transitions. [2021-08-31 05:20:25,153 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-31 05:20:25,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 86 transitions. [2021-08-31 05:20:25,154 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-08-31 05:20:25,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:20:25,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:20:25,154 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:20:25,154 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:20:25,155 INFO L791 eck$LassoCheckResult]: Stem: 1410#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1411#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; 1423#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1416#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; 1406#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; 1407#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1408#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; 1409#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1460#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; 1456#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1455#L535-3 assume !(main_~i~1 < main_~array_size~0); 1457#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; 1441#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); 1424#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1425#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); 1454#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1453#L517-3 assume !(lis_~i~0 < lis_~N); 1452#L517-4 lis_~i~0 := 1; 1450#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1451#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; 1431#L521 assume !lis_#t~short11; 1417#L521-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 1418#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1412#L520-3 assume !(lis_~j~0 < lis_~i~0); 1413#L519-2 [2021-08-31 05:20:25,155 INFO L793 eck$LassoCheckResult]: Loop: 1413#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1421#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1445#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; 1462#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; 1464#L521-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 1463#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1461#L520-3 assume !(lis_~j~0 < lis_~i~0); 1413#L519-2 [2021-08-31 05:20:25,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:25,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1034472260, now seen corresponding path program 1 times [2021-08-31 05:20:25,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:20:25,155 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214717767] [2021-08-31 05:20:25,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:25,155 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:20:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:20:25,171 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-08-31 05:20:25,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:20:25,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214717767] [2021-08-31 05:20:25,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214717767] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 05:20:25,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 05:20:25,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 05:20:25,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106549474] [2021-08-31 05:20:25,172 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:20:25,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:25,172 INFO L82 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 3 times [2021-08-31 05:20:25,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:20:25,173 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226897905] [2021-08-31 05:20:25,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:25,173 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:20:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:25,176 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:20:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:25,179 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:20:25,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:20:25,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 05:20:25,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 05:20:25,303 INFO L87 Difference]: Start difference. First operand 64 states and 86 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:20:25,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:20:25,342 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2021-08-31 05:20:25,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 05:20:25,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 91 transitions. [2021-08-31 05:20:25,344 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-08-31 05:20:25,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 91 transitions. [2021-08-31 05:20:25,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2021-08-31 05:20:25,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2021-08-31 05:20:25,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 91 transitions. [2021-08-31 05:20:25,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:20:25,346 INFO L681 BuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2021-08-31 05:20:25,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 91 transitions. [2021-08-31 05:20:25,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-08-31 05:20:25,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.318840579710145) internal successors, (91), 68 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:20:25,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2021-08-31 05:20:25,360 INFO L704 BuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2021-08-31 05:20:25,360 INFO L587 BuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2021-08-31 05:20:25,360 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-31 05:20:25,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 91 transitions. [2021-08-31 05:20:25,361 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-08-31 05:20:25,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:20:25,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:20:25,361 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:20:25,362 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:20:25,362 INFO L791 eck$LassoCheckResult]: Stem: 1549#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1550#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1564#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1555#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; 1545#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; 1546#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1547#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; 1548#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1597#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; 1598#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1599#L535-3 assume !(main_~i~1 < main_~array_size~0); 1578#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; 1579#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); 1595#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1594#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); 1593#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1592#L517-3 assume !(lis_~i~0 < lis_~N); 1591#L517-4 lis_~i~0 := 1; 1589#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1590#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; 1613#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; 1611#L521-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 1610#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1600#L520-3 assume !(lis_~j~0 < lis_~i~0); 1560#L519-2 [2021-08-31 05:20:25,362 INFO L793 eck$LassoCheckResult]: Loop: 1560#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1561#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1551#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; 1552#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; 1572#L521-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 1557#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1570#L520-3 assume !(lis_~j~0 < lis_~i~0); 1560#L519-2 [2021-08-31 05:20:25,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:25,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1034531842, now seen corresponding path program 1 times [2021-08-31 05:20:25,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:20:25,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18826519] [2021-08-31 05:20:25,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:25,371 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:20:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:20:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-31 05:20:25,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:20:25,482 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18826519] [2021-08-31 05:20:25,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18826519] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:20:25,483 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459048176] [2021-08-31 05:20:25,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:25,483 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:20:25,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:20:25,484 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:20:25,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-08-31 05:20:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:20:25,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-31 05:20:25,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:20:25,634 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-31 05:20:25,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:20:25,697 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-31 05:20:25,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459048176] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:20:25,697 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:20:25,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2021-08-31 05:20:25,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122237152] [2021-08-31 05:20:25,698 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:20:25,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:25,698 INFO L82 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 4 times [2021-08-31 05:20:25,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:20:25,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833261240] [2021-08-31 05:20:25,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:25,698 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:20:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:25,701 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:20:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:25,704 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:20:25,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:20:25,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-31 05:20:25,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2021-08-31 05:20:25,860 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. cyclomatic complexity: 28 Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:20:26,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:20:26,118 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2021-08-31 05:20:26,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-31 05:20:26,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 99 transitions. [2021-08-31 05:20:26,119 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-08-31 05:20:26,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 99 transitions. [2021-08-31 05:20:26,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2021-08-31 05:20:26,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2021-08-31 05:20:26,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 99 transitions. [2021-08-31 05:20:26,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:20:26,120 INFO L681 BuchiCegarLoop]: Abstraction has 76 states and 99 transitions. [2021-08-31 05:20:26,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 99 transitions. [2021-08-31 05:20:26,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2021-08-31 05:20:26,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 70 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:20:26,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2021-08-31 05:20:26,126 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2021-08-31 05:20:26,126 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2021-08-31 05:20:26,126 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-31 05:20:26,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 93 transitions. [2021-08-31 05:20:26,127 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-08-31 05:20:26,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:20:26,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:20:26,127 INFO L842 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] [2021-08-31 05:20:26,127 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:20:26,128 INFO L791 eck$LassoCheckResult]: Stem: 1864#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1865#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; 1879#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1870#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; 1860#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; 1861#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1862#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; 1863#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1903#L535-3 assume !(main_~i~1 < main_~array_size~0); 1905#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; 1915#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); 1914#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1913#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); 1912#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1911#L517-3 assume !(lis_~i~0 < lis_~N); 1899#L517-4 lis_~i~0 := 1; 1882#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1883#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; 1890#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; 1891#L521-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 1872#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1928#L520-3 assume !(lis_~j~0 < lis_~i~0); 1927#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1920#L519-3 assume !(lis_~i~0 < lis_~N); 1900#L519-4 lis_~i~0 := 0; 1894#L523-3 [2021-08-31 05:20:26,128 INFO L793 eck$LassoCheckResult]: Loop: 1894#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); 1895#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; 1896#L523-2 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 1894#L523-3 [2021-08-31 05:20:26,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:26,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1656376535, now seen corresponding path program 1 times [2021-08-31 05:20:26,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:20:26,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148977259] [2021-08-31 05:20:26,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:26,129 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:20:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:26,172 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:20:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:26,200 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:20:26,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:26,200 INFO L82 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 2 times [2021-08-31 05:20:26,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:20:26,201 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954764506] [2021-08-31 05:20:26,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:26,201 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:20:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:26,203 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:20:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:26,205 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:20:26,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:20:26,205 INFO L82 PathProgramCache]: Analyzing trace with hash -234008915, now seen corresponding path program 1 times [2021-08-31 05:20:26,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:20:26,205 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011193257] [2021-08-31 05:20:26,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:20:26,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:20:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:26,224 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:20:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:20:26,256 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:20:30,291 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 05:20:30,291 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 05:20:30,291 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 05:20:30,291 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 05:20:30,291 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 05:20:30,291 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:20:30,291 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 05:20:30,291 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 05:20:30,291 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration11_Lasso [2021-08-31 05:20:30,291 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 05:20:30,291 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 05:20:30,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:30,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:30,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:30,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:30,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:20:30,673 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:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-31 05:20:30,676 INFO L158 Benchmark]: Toolchain (without parser) took 12445.42ms. Allocated memory was 60.8MB in the beginning and 125.8MB in the end (delta: 65.0MB). Free memory was 38.2MB in the beginning and 71.9MB in the end (delta: -33.7MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. [2021-08-31 05:20:30,677 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 60.8MB. Free memory was 42.8MB in the beginning and 42.8MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 05:20:30,677 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.20ms. Allocated memory is still 60.8MB. Free memory was 38.0MB in the beginning and 38.3MB in the end (delta: -240.1kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-08-31 05:20:30,677 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.59ms. Allocated memory is still 60.8MB. Free memory was 38.3MB in the beginning and 36.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 05:20:30,677 INFO L158 Benchmark]: Boogie Preprocessor took 40.90ms. Allocated memory is still 60.8MB. Free memory was 36.4MB in the beginning and 34.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 05:20:30,678 INFO L158 Benchmark]: RCFGBuilder took 275.00ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 34.8MB in the beginning and 60.6MB in the end (delta: -25.8MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2021-08-31 05:20:30,678 INFO L158 Benchmark]: BuchiAutomizer took 11744.15ms. Allocated memory was 79.7MB in the beginning and 125.8MB in the end (delta: 46.1MB). Free memory was 60.6MB in the beginning and 71.9MB in the end (delta: -11.3MB). Peak memory consumption was 74.2MB. Max. memory is 16.1GB. [2021-08-31 05:20:30,679 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.16ms. Allocated memory is still 60.8MB. Free memory was 42.8MB in the beginning and 42.8MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.20ms. Allocated memory is still 60.8MB. Free memory was 38.0MB in the beginning and 38.3MB in the end (delta: -240.1kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.59ms. Allocated memory is still 60.8MB. Free memory was 38.3MB in the beginning and 36.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.90ms. Allocated memory is still 60.8MB. Free memory was 36.4MB in the beginning and 34.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 275.00ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 34.8MB in the beginning and 60.6MB in the end (delta: -25.8MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 11744.15ms. Allocated memory was 79.7MB in the beginning and 125.8MB in the end (delta: 46.1MB). Free memory was 60.6MB in the beginning and 71.9MB in the end (delta: -11.3MB). Peak memory consumption was 74.2MB. Max. memory is 16.1GB. * 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. [2021-08-31 05:20:30,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2021-08-31 05:20:30,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2021-08-31 05:20:31,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-08-31 05:20:31,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2021-08-31 05:20:31,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...